| Publication | Date of Publication | Type |
|---|
Efficient algorithms for the Potts model on small-set expanders
(available as arXiv preprint) | N/A | Paper |
Sampling List Packings
(available as arXiv preprint) | N/A | Paper |
| Sampling list packings | 2026-07-14 | Paper |
| Approximately counting independent sets of a given size in bounded-degree graphs | 2026-05-12 | Paper |
| A spectral approach to approximately counting independent sets in dense bipartite graphs | 2026-01-14 | Paper |
Potential Hessian Ascent III: Sampling the Sherrington--Kirkpatrick Model at Beta < 1/2
(available as arXiv preprint) | 2026-01-01 | Paper |
Degree-sequence bounds for independent sets via multivariate local occupancy
(available as arXiv preprint) | 2026-01-01 | Paper |
Weak Poincaré Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model
(available as arXiv preprint) | 2026-01-01 | Paper |
First-order phase transitions in the hard-core model
(available as arXiv preprint) | 2026-01-01 | Paper |
Random independent sets and local sparsity
(available as arXiv preprint) | 2026-01-01 | Paper |
List packing number of bounded degree graphs
Combinatorics, Probability and Computing | 2025-12-16 | Paper |
An approximate blow-up lemma for sparse hypergraphs
Procedia Computer Science | 2025-12-02 | Paper |
| Algorithms for the ferromagnetic Potts model on expanders | 2025-08-15 | Paper |
The hard-core model in graph theory
(available as arXiv preprint) | 2025-01-01 | Paper |
Local Weak Degeneracy of Planar Graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
On expectations and variances in the hard-core model on bounded degree graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
A robust Corrádi-Hajnal theorem
Random Structures & Algorithms | 2024-11-20 | Paper |
Algorithms for the ferromagnetic Potts model on expanders
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Efficient algorithms for the Potts model on small-set expanders
Chicago Journal of Theoretical Computer Science | 2024-05-14 | Paper |
Packing list‐colorings
Random Structures & Algorithms | 2024-01-05 | Paper |
On the occupancy fraction of the antiferromagnetic Ising model
(available as arXiv preprint) | 2024-01-01 | Paper |
Computational thresholds for the fixed-magnetization Ising model
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Occupancy fraction, fractional colouring, and triangle fraction
Journal of Graph Theory | 2023-10-04 | Paper |
Occupancy fraction, fractional colouring, and triangle fraction
Journal of Graph Theory | 2023-10-04 | Paper |
| Approximately counting independent sets in dense bipartite graphs via subspace enumeration | 2023-07-18 | Paper |
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs
SIAM Journal on Computing | 2023-04-28 | Paper |
| List packing number of bounded degree graphs | 2023-03-02 | Paper |
Approximately counting independent sets in dense bipartite graphs via subspace enumeration
(available as arXiv preprint) | 2023-01-01 | Paper |
| A robust Corr\'adi--Hajnal Theorem | 2022-09-02 | Paper |
scientific article; zbMATH DE number 7561741 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
The -Ramsey problem for triangle-free graphs
SIAM Journal on Discrete Mathematics | 2022-05-10 | Paper |
| Algorithms for the ferromagnetic Potts model on expanders | 2022-04-04 | 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 |
A proof of the upper matching conjecture for large graphs
Journal of Combinatorial Theory. Series B | 2021-09-16 | Paper |
Approximately counting independent sets of a given size in bounded-degree graphs
(available as arXiv preprint) | 2021-02-09 | Paper |
Coloring triangle-free graphs with local list sizes
Random Structures & Algorithms | 2020-11-30 | Paper |
| An algorithmic framework for colouring locally sparse graphs | 2020-04-15 | Paper |
| Graph structure via local occupancy | 2020-03-31 | Paper |
Graph structure via local occupancy
(available as arXiv preprint) | 2020-01-01 | Paper |
An algorithmic framework for colouring locally sparse graphs
(available as arXiv preprint) | 2020-01-01 | Paper |
Statistical physics approaches to Unique Games
(available as arXiv preprint) | 2019-11-04 | Paper |
| Regularity inheritance in hypergraphs | 2019-01-17 | Paper |
Regularity inheritance in hypergraphs
(available as arXiv preprint) | 2019-01-01 | Paper |
Counting proper colourings in 4-regular graphs via the Potts model
The Electronic Journal of Combinatorics | 2018-10-30 | Paper |
Counting proper colourings in 4-regular graphs via the Potts model
The Electronic Journal of Combinatorics | 2018-10-30 | Paper |
Extremes of the internal energy of the Potts model on cubic graphs
Random Structures & Algorithms | 2018-09-28 | Paper |
Tight bounds on the coefficients of partition functions via stability
Journal of Combinatorial Theory. Series A | 2018-09-07 | Paper |
Tight bounds on the coefficients of partition functions via stability
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Tight bounds on the coefficients of partition functions via stability
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
On the average size of independent sets in triangle-free graphs
Proceedings of the American Mathematical Society | 2017-11-21 | Paper |
Independent sets, matchings, and occupancy fractions
Journal of the London Mathematical Society | 2017-09-14 | Paper |
Independent sets, matchings, and occupancy fractions
Journal of the London Mathematical Society | 2017-09-14 | Paper |
Multicolour Ramsey numbers of paths and even cycles
European Journal of Combinatorics | 2017-06-19 | Paper |
Multicolour Ramsey numbers of paths and even cycles
European Journal of Combinatorics | 2017-06-19 | Paper |
| Counting in hypergraphs via regularity inheritance | 2016-10-14 | Paper |
