Alex D. Scott
Affiliations: University of Oxford, Mathematical Institute, UK
According to our database^{1},
Alex D. Scott
authored at least 127 papers
between 1992 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on orcid.org
On csauthors.net:
Bibliography
2022
SIAM J. Discret. Math., 2022
SIAM J. Discret. Math., 2022
Random Struct. Algorithms, 2022
Electron. J. Comb., 2022
2021
ACM Trans. Algorithms, 2021
Random Struct. Algorithms, 2021
J. Graph Theory, 2021
J. Comb. Theory, Ser. B, 2021
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings.
J. Comb. Theory, Ser. B, 2021
Discret. Math., 2021
Comb. Probab. Comput., 2021
Comb. Probab. Comput., 2021
Electron. J. Comb., 2021
Comb., 2021
Comb., 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
2020
J. Graph Theory, 2020
J. Graph Theory, 2020
J. Comb. Theory, Ser. B, 2020
Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture.
J. Comb. Theory, Ser. B, 2020
J. Comb. Theory, Ser. A, 2020
J. Comb. Theory, Ser. B, 2020
J. ACM, 2020
Eur. J. Comb., 2020
Asymptotic Dimension of MinorClosed Families and AssouadNagata Dimension of Surfaces.
CoRR, 2020
2019
J. Graph Theory, 2019
J. Graph Theory, 2019
J. Graph Theory, 2019
J. Comb. Theory, Ser. A, 2019
J. Comb. Theory, Ser. B, 2019
Eur. J. Comb., 2019
Discret. Appl. Math., 2019
Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue.
Comb., 2019
Comb., 2019
Comb., 2019
2018
J. Comb. Theory, Ser. B, 2018
J. Comb. Theory, Ser. A, 2018
Eur. J. Comb., 2018
Eur. J. Comb., 2018
CoRR, 2018
CoRR, 2018
2017
Random Struct. Algorithms, 2017
Random Struct. Algorithms, 2017
J. Graph Theory, 2017
J. Comb. Theory, Ser. B, 2017
Comb. Probab. Comput., 2017
Electron. J. Comb., 2017
Electron. J. Comb., 2017
Comb., 2017
2016
J. Comb. Theory, Ser. B, 2016
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures.
J. Comb. Theory, Ser. B, 2016
J. Comb. Theory, Ser. B, 2016
Inf. Comput., 2016
Eur. J. Comb., 2016
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring.
Distributed Comput., 2016
2015
J. Comb. Theory, Ser. B, 2015
Eur. J. Comb., 2015
Eur. J. Comb., 2015
2014
SIAM J. Discret. Math., 2014
For most graphs <i>H</i>, most <i>H</i>free graphs have a linear homogeneous set.
Random Struct. Algorithms, 2014
Theory Comput. Syst., 2014
J. Comb. Theory, Ser. B, 2014
CoRR, 2014
Electron. J. Comb., 2014
2013
Theor. Comput. Sci., 2013
SIAM J. Discret. Math., 2013
Soc. Choice Welf., 2013
J. Comb. Theory, Ser. B, 2013
J. Comb. Theory, Ser. B, 2013
Feedback from nature: an optimal distributed algorithm for maximal independent set selection.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013
2012
Soc. Choice Welf., 2012
J. Graph Theory, 2012
Discret. Appl. Math., 2012
Comb. Probab. Comput., 2012
Electron. J. Comb., 2012
2011
SIAM J. Discret. Math., 2011
J. Graph Theory, 2011
Comb. Probab. Comput., 2011
CoRR, 2011
2010
Discret. Math., 2010
CoRR, 2010
2009
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function.
ACM Trans. Algorithms, 2009
Uniform multicommodity flow through the complete graph with random edgecapacities.
Oper. Res. Lett., 2009
2007
J. Graph Theory, 2007
J. Comb. Theory, Ser. B, 2007
Internet Math., 2007
Eur. J. Comb., 2007
Discret. Optim., 2007
Discret. Appl. Math., 2007
2006
Graphs Comb., 2006
Comb. Probab. Comput., 2006
Comb. Probab. Comput., 2006
Linearprogramming design and analysis of fast algorithms for Max 2Sat and Max 2CSP
CoRR, 2006
Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems
CoRR, 2006
Proceedings of the Algorithms, 2006
2005
Judicious partitions and related problems.
Proceedings of the Surveys in Combinatorics, 2005
2004
J. Graph Theory, 2004
Electron. Colloquium Comput. Complex., 2004
Topics in Graph Automorphisms and Reconstruction by Josef Lauri and Raffaele Scapellato, Cambridge University Press, 2003, 172 pp.
Comb. Probab. Comput., 2004
Comb. Probab. Comput., 2004
2003
SIAM J. Discret. Math., 2003
Electron. Colloquium Comput. Complex., 2003
Electron. Colloquium Comput. Complex., 2003
Comb. Probab. Comput., 2003
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances.
Proceedings of the Approximation, 2003
2002
Random Struct. Algorithms, 2002
Graphs Comb., 2002
2001
Graphs Comb., 2001
Eur. J. Comb., 2001
2000
Eur. J. Comb., 2000
Eur. J. Comb., 2000
1999
J. Comb. Theory, Ser. B, 1999
J. Comb. Theory, Ser. A, 1999
Electron. J. Comb., 1999
Comb., 1999
1998
J. Comb. Theory, Ser. A, 1998
1997
J. Graph Theory, 1997
J. Comb. Theory, Ser. A, 1997
Discret. Math., 1997
Discret. Math., 1997
Discret. Math., 1997
Discret. Math., 1997
Discret. Appl. Math., 1997
1996
J. Comb. Theory, Ser. B, 1996
1995
Discret. Math., 1995
1992
Comb. Probab. Comput., 1992