Alexander D. Scott

15 papers A 1Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2023 J jnl
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree.
J. Graph Theory
Alexander D. Scott, Paul D. Seymour, Sophie Spirkl
2017 J jnl
On Lower Bounds for the Matching Number of Subcubic Graphs.
J. Graph Theory
Penny E. Haxell, Alexander D. Scott
2015 J jnl
Disjoint induced subgraphs of the same order and size.
Eur. J. Comb.
Béla Bollobás, Teeradej Kittipassorn, Bhargav P. Narayanan, Alexander D. Scott
2010 J jnl
Structure of random r-SAT below the pure literal threshold
CoRR
Alexander D. Scott, Gregory B. Sorkin
2009 J jnl
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function.
ACM Trans. Algorithms
Alexander D. Scott, Gregory B. Sorkin
2007 J jnl
Computational complexity of some restricted instances of 3-SAT.
Discret. Appl. Math.
Piotr Berman, Marek Karpinski, Alexander D. Scott
2007 J jnl
Linear-programming design and analysis of fast algorithms for Max 2-CSP.
Discret. Optim.
Alexander D. Scott, Gregory B. Sorkin
2006 A conf
An LP-Designed Algorithm for Constraint Satisfaction.
ESA
Alexander D. Scott, Gregory B. Sorkin
2006 J jnl
Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP
CoRR
Alexander D. Scott, Gregory B. Sorkin
2006 J jnl
On Dependency Graphs and the Lattice Gas.
Comb. Probab. Comput.
Alexander D. Scott, Alan D. Sokal
2006 J jnl
Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems
CoRR
Alexander D. Scott, Gregory B. Sorkin
2006 J jnl
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time.
Comb. Probab. Comput.
Alexander D. Scott, Gregory B. Sorkin
2005 — conf
Judicious partitions and related problems.
BCC
Alexander D. Scott
2004 J jnl
Computational Complexity of Some Restricted Instances of 3SAT
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski, Alexander D. Scott
2004 J jnl
Topics in Graph Automorphisms and Reconstruction by Josef Lauri and Raffaele Scapellato, Cambridge University Press, 2003, 172 pp.
Comb. Probab. Comput.
Alexander D. Scott