Volgen
Alex Scott
Alex Scott
Professor of Mathematics, University of Oxford
Geverifieerd e-mailadres voor maths.ox.ac.uk - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
2582005
Approximation hardness of short symmetric instances of MAX-3SAT
P Berman, M Karpinski, A Scott
2352004
A survey of ‐boundedness
A Scott, P Seymour
Journal of Graph Theory 95 (3), 473-504, 2020
1962020
Induced trees in graphs of large chromatic number
AD Scott
Journal of Graph Theory 24 (4), 297-311, 1997
1251997
Problems and results on judicious partitions
B Bollobás, AD Scott
Random Structures & Algorithms 21 (3‐4), 414-430, 2002
1142002
A bound for the cops and robbers problem
A Scott, B Sudakov
SIAM Journal on Discrete Mathematics 25 (3), 1438-1442, 2011
1072011
Better bounds for Max Cut
B Bollobás, AD Scott
Contemporary combinatorics 10, 185, 2002
952002
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
872016
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
822013
Exact bounds for judicious partitions of graphs
B Bollobás, AD Scott
Combinatorica 19 (4), 473-486, 1999
771999
Judicious partitions and related problems.
AD Scott
BCC, 95-117, 2005
752005
Szemerédi's regularity lemma for matrices and sparse graphs
A Scott
Combinatorics, Probability and Computing 20 (3), 455-466, 2011
742011
Reversals and transpositions over finite alphabets
AJ Radcliffe, AD Scott, EL Wilmer
SIAM journal on discrete mathematics 19 (1), 224-244, 2005
732005
Approximation hardness and satisfiability of bounded occurrence instances of SAT
PR Berman, AD Scott, M Karpinski
SIS-2003-269, 2003
712003
Induced subgraphs of graphs with large chromatic number. III. Long holes
M Chudnovsky, A Scott, P Seymour
Combinatorica 37 (6), 1057-1072, 2017
532017
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
522013
On separating systems
B Bollobás, A Scott
European Journal of Combinatorics 28 (4), 1068-1071, 2007
522007
Max cut for random graphs with a planted partition
B Bollobás, AD Scott
Combinatorics, Probability and Computing 13 (4-5), 451-474, 2004
492004
Linear-programming design and analysis of fast algorithms for Max 2-CSP
AD Scott, GB Sorkin
Discrete Optimization 4 (3-4), 260-287, 2007
462007
Maximum directed cuts in acyclic digraphs
N Alon, B Bollobás, A Gyárfás, J Lehel, A Scott
Journal of Graph Theory 55 (1), 1-13, 2007
452007
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20