| Publication | Date of Publication | Type |
|---|
Matchings and loose cycles in the semirandom hypergraph model
(available as arXiv preprint) | N/A | Paper |
| The resolution complexity of random constraint satisfaction problems | 2026-05-29 | Paper |
| The exact satisfiability threshold for a potentially intractable random constraint satisfaction problem | 2026-05-29 | Paper |
| The analysis of a list-coloring algorithm on a random graph | 2026-05-21 | Paper |
Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model
Random Structures & Algorithms | 2025-05-06 | Paper |
Adaptable and conflict colouring multigraphs with no cycles of length three or four
Journal of Graph Theory | 2023-10-10 | Paper |
A variant of the Erdős–Rényi random graph process
Journal of Graph Theory | 2023-10-06 | Paper |
Asymptotically good edge correspondence colourings
Journal of Graph Theory | 2023-10-05 | Paper |
| The degree-restricted random process is far from uniform | 2022-11-01 | Paper |
| Asymptotically optimal frugal colouring | 2019-05-06 | Paper |
| Asymptotically good edge correspondence colouring | 2018-08-26 | Paper |
Backbone colourings of graphs
Discrete Mathematics | 2016-07-05 | Paper |
| k-colouring when k is close to | 2016-07-01 | Paper |
Containing viral spread on sparse random graphs: bounds, algorithms, and experiments
Internet Mathematics | 2016-05-25 | Paper |
Colouring graphs when the number of colours is nearly the maximum degree
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Sets that are connected in two random graphs
Random Structures & Algorithms | 2014-11-17 | Paper |
Colouring graphs when the number of colours is almost the maximum degree
Journal of Combinatorial Theory. Series B | 2014-10-22 | Paper |
| Inside the clustering threshold for random linear equations | 2013-09-19 | Paper |
A dichotomy theorem for the resolution complexity of random constraint satisfaction problems
SIAM Journal on Computing | 2013-07-04 | Paper |
The satisfiability threshold for a seemingly intractable random constraint satisfaction problem
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
The scaling window for a random graph with a given degree sequence
Random Structures & Algorithms | 2012-08-30 | Paper |
On the edge-density of 4-critical graphs
Combinatorica | 2011-02-08 | Paper |
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Asymptotically optimal frugal colouring
Journal of Combinatorial Theory. Series B | 2010-04-21 | Paper |
Corrigendum to ``Asymptotically optimal frugal colouring'' [J. Comb. Theory, Ser. B 100, No. 2, 226--246 (2010)]
Journal of Combinatorial Theory. Series B | 2010-04-21 | Paper |
| Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms | 2006-12-14 | Paper |
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Random Structures & Algorithms | 2006-06-06 | Paper |
(\(\Delta-k\))-critical graphs
Journal of Combinatorial Theory. Series B | 2005-03-08 | Paper |
| scientific article; zbMATH DE number 1775440 (Why is no real title available?) | 2004-01-27 | Paper |
| Thresholds for colourability and satisfiability in random graphs and Boolean formulae | 2002-03-29 | Paper |
Random constraint satisfaction: A more accurate picture
Constraints | 2002-02-10 | Paper |
| scientific article; zbMATH DE number 1033851 (Why is no real title available?) | 2001-11-26 | Paper |
Very rapidly mixing Markov chains for \(2\Delta\)-colorings and for independent sets in a graph with maximum degree 4
Random Structures & Algorithms | 2001-11-13 | Paper |
Graph colouring and the probabilistic method
Algorithms and Combinatorics | 2001-09-02 | Paper |
| Near-optimal list colorings | 2000-12-19 | Paper |
Splitting an Expander Graph
Journal of Algorithms | 2000-11-07 | Paper |
Critical subgraphs of a random graph
The Electronic Journal of Combinatorics | 2000-01-16 | Paper |
Critical subgraphs of a random graph
The Electronic Journal of Combinatorics | 2000-01-16 | Paper |
| scientific article; zbMATH DE number 1303525 (Why is no real title available?) | 1999-11-08 | Paper |
A bound on the total chromatic number
Combinatorica | 1999-09-14 | Paper |
| scientific article; zbMATH DE number 1241392 (Why is no real title available?) | 1999-08-17 | Paper |
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Combinatorics, Probability and Computing | 1999-07-19 | Paper |
Colouring a graph frugally
Combinatorica | 1999-03-14 | Paper |
Total Coloring With \Delta + \mbox\lowercasepoly(\log \Delta) Colors
SIAM Journal on Computing | 1999-02-22 | Paper |
| scientific article; zbMATH DE number 1189240 (Why is no real title available?) | 1998-08-13 | Paper |
The existence of uniquely \(-G\) colourable graphs
Discrete Mathematics | 1998-03-24 | Paper |
| scientific article; zbMATH DE number 1047719 (Why is no real title available?) | 1997-08-11 | Paper |
A bound on the strong chromatic index of a graph
Journal of Combinatorial Theory. Series B | 1997-05-05 | Paper |
Perfect Matchings in Random <i>r</i>-regular, <i>s</i>-uniform Hypergraphs
Combinatorics, Probability and Computing | 1997-03-06 | Paper |
Generating and Counting Hamilton Cycles in Random Regular Graphs
Journal of Algorithms | 1996-12-16 | Paper |
A critical point for random graphs with a given degree sequence
Random Structures & Algorithms | 1995-10-23 | Paper |
The dominating number of a random cubic graph
Random Structures & Algorithms | 1995-10-17 | Paper |
Broadcasting in random graphs
Discrete Applied Mathematics | 1995-05-03 | Paper |
Hamilton Cycles in Random Regular Digraphs
Combinatorics, Probability and Computing | 1994-10-24 | Paper |
