Alexander D. Scott

Publication Activity (10 Years)

Years Active: 2004-2023
Publications (10 Years): 2

Top Topics

Image Registration

Graph Theoretic

Top Venues

J. Graph Theory

Publications

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