Alex Scott
Alex Scott
Professor of Mathematics, University of Oxford
Verified email at maths.ox.ac.uk - Homepage
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 (5), 1151-1261, 2005
1892005
Approximation hardness of short symmetric instances of MAX-3SAT
P Berman, M Karpinski, A Scott
1382004
Problems and results on judicious partitions
B Bollobás, AD Scott
Random Structures & Algorithms 21 (3‐4), 414-430, 2002
882002
A bound for the cops and robbers problem
A Scott, B Sudakov
SIAM Journal on Discrete Mathematics 25 (3), 1438-1442, 2011
802011
Better bounds for max cut
B Bollobás, AD Scott
Contemporary combinatorics 10, 185-246, 2002
782002
Induced trees in graphs of large chromatic number
AD Scott
Journal of Graph Theory 24 (4), 297-311, 1997
701997
Exact bounds for judicious partitions of graphs
B Bollobás, AD Scott
Combinatorica 19 (4), 473-486, 1999
691999
Szemerédi's regularity lemma for matrices and sparse graphs
A Scott
Combinatorics, Probability and Computing 20 (3), 455-466, 2011
622011
Reversals and transpositions over finite alphabets
AJ Radcliffe, AD Scott, EL Wilmer
SIAM journal on discrete mathematics 19 (1), 224-244, 2005
572005
Judicious partitions and related problems.
AD Scott
Surveys in combinatorics 327, 95-117, 2005
562005
Approximation hardness and satisfiability of bounded occurrence instances of SAT
PR Berman, AD Scott, M Karpinski
SIS-2003-269, 2003
492003
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
462016
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
442013
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
442013
Linear-programming design and analysis of fast algorithms for Max 2-CSP
AD Scott, GB Sorkin
Discrete Optimization 4 (3-4), 260-287, 2007
432007
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
422003
Max cut for random graphs with a planted partition
B Bollobás, AD Scott
Combinatorics Probability and Computing 13 (4-5), 451-474, 2004
412004
On separating systems
B Bollobás, A Scott
European Journal of Combinatorics 28 (4), 1068-1071, 2007
392007
Judicious partitions of graphs
B Bollobás, AD Scott
Periodica Mathematica Hungarica 26 (2), 125-137, 1993
371993
Solving sparse random instances of Max Cut and Max 2-CSP in linear expected time
AD Scott, GB Sorkin
Comb. Probab. Comput. 15 (1-2), 281-315, 2006
36*2006
The system can't perform the operation now. Try again later.
Articles 1–20