| Publication | Date of Publication | Type |
|---|
Zero-free regions for the independence polynomial on restricted graph classes
Journal of the London Mathematical Society. Second Series | 2026-02-27 | Paper |
Cycle partitions in dense regular digraphs and oriented graphs
Forum of Mathematics, Sigma | 2025-05-14 | Paper |
| Cycle partition of dense regular digraphs and oriented graphs (extended abstract) | 2025-04-15 | Paper |
A near-optimal zero-free disk for the Ising model
Combinatorial Theory | 2024-10-08 | Paper |
Improved bounds for the zeros of the chromatic polynomial via Whitney's broken circuit theorem
Journal of Combinatorial Theory. Series B | 2024-10-08 | Paper |
Orthogonal schedules in single round robin tournaments
Operations Research Letters | 2024-06-17 | Paper |
Hamilton cycles in dense regular digraphs and oriented graphs
Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
| Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs | 2024-01-15 | Paper |
| A near-optimal zero-free disk for the Ising model | 2023-11-09 | Paper |
Sampling from the low temperature Potts model through a Markov chain on flows
Random Structures & Algorithms | 2023-10-17 | Paper |
| Cycle Partitions in Dense Regular Digraphs and Oriented Graphs | 2023-09-20 | Paper |
| Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem | 2023-09-19 | Paper |
| scientific article; zbMATH DE number 7701429 (Why is no real title available?) | 2023-06-26 | Paper |
scientific article; zbMATH DE number 7701429 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-26 | Paper |
scientific article; zbMATH DE number 7561741 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs
SIAM Journal on Discrete Mathematics | 2022-06-23 | Paper |
Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
Forum of Mathematics, Sigma | 2022-02-11 | Paper |
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) | 2021-12-15 | Paper |
| Path decompositions of random directed graphs | 2021-09-28 | Paper |
Structure and colour in triangle-free graphs
The Electronic Journal of Combinatorics | 2021-06-21 | Paper |
| Improved bounds for zeros of the chromatic polynomial on bounded degree graphs | 2021-05-07 | Paper |
Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs
The Electronic Journal of Combinatorics | 2020-12-03 | Paper |
Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
(available as arXiv preprint) | 2020-06-26 | Paper |
Decomposing tournaments into paths
Proceedings of the London Mathematical Society | 2020-05-12 | Paper |
Statistical physics approaches to Unique Games
(available as arXiv preprint) | 2019-11-04 | Paper |
Computing the number of induced copies of a fixed graph in a bounded degree graph
Algorithmica | 2019-05-07 | Paper |
Discrepancy and large dense monochromatic subsets
Journal of Combinatorics | 2018-12-10 | Paper |
Excluding hooks and their complements
The Electronic Journal of Combinatorics | 2018-09-07 | Paper |
Excluding hooks and their complements
The Electronic Journal of Combinatorics | 2018-09-07 | Paper |
Hamilton cycles in sparse robustly expanding digraphs
The Electronic Journal of Combinatorics | 2018-09-07 | Paper |
Hamilton cycles in sparse robustly expanding digraphs
The Electronic Journal of Combinatorics | 2018-09-07 | Paper |
| Decomposing tournaments into paths | 2018-01-18 | Paper |
Decomposing tournaments into paths
(available as arXiv preprint) | 2018-01-18 | Paper |
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
(available as arXiv preprint) | 2018-01-18 | Paper |
On a Ramsey-type problem of Erdős and Pach
Bulletin of the London Mathematical Society | 2018-01-16 | Paper |
On a Ramsey-type problem of Erdős and Pach
Bulletin of the London Mathematical Society | 2018-01-16 | Paper |
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
SIAM Journal on Computing | 2018-01-10 | Paper |
Obtaining online ecological colourings by generalizing first-fit
Theory of Computing Systems | 2017-11-07 | Paper |
| On a Ramsey-type problem of Erdős and Pach | 2016-10-14 | Paper |
Finding shortest paths between graph colourings
Algorithmica | 2016-09-07 | Paper |
A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem
Random Structures & Algorithms | 2016-06-10 | Paper |
Parameterized traveling salesman problem: beating the average
SIAM Journal on Discrete Mathematics | 2016-02-05 | Paper |
Mixing of the Glauber dynamics for the ferromagnetic Potts model
Random Structures & Algorithms | 2016-02-03 | Paper |
A precise threshold for quasi-Ramsey numbers
SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
Finding shortest paths between graph colourings
Parameterized and Exact Computation | 2015-09-15 | Paper |
Finding shortest paths between graph colourings
Parameterized and Exact Computation | 2015-09-15 | Paper |
Poset limits can be totally ordered
Transactions of the American Mathematical Society | 2015-04-22 | Paper |
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
Proceedings of the London Mathematical Society. Third Series | 2014-10-15 | Paper |
Tight inequalities among set hitting times in Markov chains
Proceedings of the American Mathematical Society | 2014-09-16 | Paper |
| Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments | 2014-06-11 | Paper |
On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
Journal of Graph Theory | 2014-05-22 | Paper |
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
Theoretical Computer Science | 2014-01-07 | Paper |
| On the diameter of reconfiguration graphs for vertex colourings | 2013-11-01 | Paper |
Determining edge expansion and other connectivity measures of graphs of bounded genus
SIAM Journal on Computing | 2013-09-25 | Paper |
The complexity of finding uniform sparsest cuts in various graph classes
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
Parameterized and Exact Computation | 2012-06-15 | Paper |
The complexity status of problems related to sparsest cuts
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Determining edge expansion and other connectivity measures of graphs of bounded genus
Lecture Notes in Computer Science | 2010-09-06 | Paper |
Obtaining online ecological colourings by generalizing first-fit
Computer Science – Theory and Applications | 2010-06-22 | Paper |
Average relational distance in linear extensions of posets
Discrete Mathematics | 2010-04-27 | Paper |
Cutting two graphs simultaneously
Journal of Graph Theory | 2008-11-19 | Paper |
Partitioning posets
Order | 2008-09-09 | Paper |
