Alex Scott

Cited by

	All	Since 2018
Citations	3473	1807
h-index	31	20
i10-index	91	57

520

260

130

390

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220239 8 10 30 17 27 36 53 61 65 79 106 73 122 119 172 185 210 205 258 264 325 390 515 39

Public access

View all

59 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Maria ChudnovskyPrinceton UniversityVerified email at math.princeton.edu
Sophie SpirklUniversity of WaterlooVerified email at uwaterloo.ca
Andrew J. RadcliffeProfessor of Mathematics, University of Nebraska-LincolnVerified email at math.unl.edu
Gregory SorkinLondon School of Economics and Political ScienceVerified email at lse.ac.uk
Carla GroenlandUtrecht UniversityVerified email at uu.nl
David R. WoodSchool of Mathematics, Monash UniversityVerified email at monash.edu
Alan D. SokalProfessor of Physics, New York University; Professor of Mathematics, University College LondonVerified email at nyu.edu
Marek KarpinskiProfessor of Computer Science, University of BonnVerified email at cs.uni-bonn.de
Stéphan ThomasséÉcole Normale Supérieure de LyonVerified email at ens-lyon.fr
Kitty MeeksUniversity of GlasgowVerified email at glasgow.ac.uk
Jacob FoxStanford UniversityVerified email at stanford.edu
Tom JohnstonUniversity of OxfordVerified email at lmh.ox.ac.uk
Bruce ReedMcGill UniversityVerified email at cs.mcgill.ca
Benjamin SudakovETH, ZurichVerified email at math.ethz.ch
Dániel KorándiUniversity of Oxford, UKVerified email at maths.ox.ac.uk
Jonathan A. NoelUniversity of VictoriaVerified email at uvic.ca
Sergey NorinAssociate Professor, McGill UniversityVerified email at math.mcgill.ca
Martin LoeblProfessor of Informatics, Charles University, PragueVerified email at kam.mff.cuni.cz
Marthe BonamyLaBRI, CNRS, Université BordeauxVerified email at u-bordeaux.fr
Peter JeavonsProfessor of Computer Science, University of OxfordVerified email at cs.ox.ac.uk

Alex Scott

Professor of Mathematics, University of Oxford

Verified email at maths.ox.ac.uk - Homepage

Combinatorics graph theory probability algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma AD Scott, AD Sokal Journal of Statistical Physics 118, 1151-1261, 2005	209	2005
Approximation hardness of short symmetric instances of MAX-3SAT P Berman, M Karpinski, A Scott	180	2004
A survey of ‐boundedness A Scott, P Seymour Journal of Graph Theory 95 (3), 473-504, 2020	103	2020
Problems and results on judicious partitions B Bollobás, AD Scott Random Structures & Algorithms 21 (3‐4), 414-430, 2002	103	2002
Induced trees in graphs of large chromatic number AD Scott Journal of Graph Theory 24 (4), 297-311, 1997	98	1997
A bound for the cops and robbers problem A Scott, B Sudakov SIAM Journal on Discrete Mathematics 25 (3), 1438-1442, 2011	92	2011
Better bounds for Max Cut B Bollobás, AD Scott Contemporary combinatorics 10, 185, 2002	86	2002
Exact bounds for judicious partitions of graphs B Bollobás, AD Scott Combinatorica 19 (4), 473-486, 1999	73	1999
Szemerédi's regularity lemma for matrices and sparse graphs A Scott Combinatorics, Probability and Computing 20 (3), 455-466, 2011	67	2011
Induced subgraphs of graphs with large chromatic number. I. Odd holes A Scott, P Seymour Journal of Combinatorial Theory, Series B 121, 68-84, 2016	66	2016
Judicious partitions and related problems. AD Scott BCC, 95-117, 2005	64	2005
Reversals and transpositions over finite alphabets AJ Radcliffe, AD Scott, EL Wilmer SIAM journal on discrete mathematics 19 (1), 224-244, 2005	63	2005
Tournaments and colouring E Berger, K Choromanski, M Chudnovsky, J Fox, M Loebl, A Scott, ... Journal of Combinatorial Theory, Series B 103 (1), 1-20, 2013	58	2013
Approximation hardness and satisfiability of bounded occurrence instances of SAT PR Berman, AD Scott, M Karpinski SIS-2003-269, 2003	58	2003
Feedback from nature: an optimal distributed algorithm for maximal independent set selection A Scott, P Jeavons, L Xu Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013	47	2013
On separating systems B Bollobás, A Scott European Journal of Combinatorics 28 (4), 1068-1071, 2007	45	2007
Linear-programming design and analysis of fast algorithms for Max 2-CSP AD Scott, GB Sorkin Discrete Optimization 4 (3-4), 260-287, 2007	44	2007
Max cut for random graphs with a planted partition B Bollobás, AD Scott Combinatorics, Probability and Computing 13 (4-5), 451-474, 2004	43	2004
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances AD Scott, GB Sorkin Approximation, Randomization, and Combinatorial Optimization.. Algorithms …, 2003	42	2003
Induced subgraphs of graphs with large chromatic number. III. Long holes M Chudnovsky, A Scott, P Seymour Combinatorica 37 (6), 1057-1072, 2017	40	2017

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors