Alexander D. Scott - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2023

Polynomial bounds for chromatic number. I. Excluding a biclique and an induced treeAlexander D. Scott, Paul D. Seymour, Sophie Spirkl. jgt, 102(3):458-471, 2023. [doi]

2017

On Lower Bounds for the Matching Number of Subcubic GraphsPenny E. Haxell, Alexander D. Scott. jgt, 85(2):336-348, 2017. [doi]

2015

Disjoint induced subgraphs of the same order and sizeBéla Bollobás, Teeradej Kittipassorn, Bhargav P. Narayanan, Alexander D. Scott. ejc, 49:153-166, 2015. [doi]

2009

Polynomial constraint satisfaction problems, graph bisection, and the Ising partition functionAlexander D. Scott, Gregory B. Sorkin. TALG, 5(4), 2009. [doi]

2007

Computational complexity of some restricted instances of 3-SATPiotr Berman, Marek Karpinski, Alexander D. Scott. DAM, 155(5):649-653, 2007. [doi]

Linear-programming design and analysis of fast algorithms for Max 2-CSPAlexander D. Scott, Gregory B. Sorkin. disopt, 4(3-4):260-287, 2007. [doi]

2006

Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected TimeAlexander D. Scott, Gregory B. Sorkin. cpc, 15(1-2):281-315, 2006. [doi]

On Dependency Graphs and the Lattice GasAlexander D. Scott, Alan D. Sokal. cpc, 15(1-2):253-279, 2006. [doi]

An LP-Designed Algorithm for Constraint SatisfactionAlexander D. Scott, Gregory B. Sorkin. esa 2006: 588-599 [doi]

2005

Judicious partitions and related problemsAlexander D. Scott. sbcci 2005: 95-117

2004

Computational Complexity of Some Restricted Instances of 3SATPiotr Berman, Marek Karpinski, Alexander D. Scott. eccc, (111), 2004. [doi]

Topics in Graph Automorphisms and Reconstruction by Josef Lauri and Raffaele Scapellato, Cambridge University Press, 2003, 172 ppAlexander D. Scott. cpc, 13(1):122, 2004.

Sign in or sign up to see more results.

runs on WebDSL