| Publication | Date of Publication | Type |
|---|
| Hamilton cycles in dense regular digraphs and oriented graphs | 2024-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147346 | 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 | 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 |
| https://portal.mardi4nfdi.de/entity/Q6161056 | 2023-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092461 | 2022-07-21 | Paper |
| A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs | 2022-06-23 | Paper |
| Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs | 2022-02-11 | Paper |
| On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs | 2021-12-15 | Paper |
| Path decompositions of random directed graphs | 2021-09-28 | Paper |
| Structure and colour in triangle-free graphs | 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 | 2020-12-03 | Paper |
| Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs | 2020-06-26 | Paper |
| Decomposing tournaments into paths | 2020-05-12 | Paper |
| Statistical physics approaches to Unique Games | 2019-11-04 | Paper |
| Computing the number of induced copies of a fixed graph in a bounded degree graph | 2019-05-07 | Paper |
| Discrepancy and large dense monochromatic subsets | 2018-12-10 | Paper |
| Excluding hooks and their complements | 2018-09-07 | Paper |
| Hamilton cycles in sparse robustly expanding digraphs | 2018-09-07 | Paper |
| Decomposing tournaments into paths | 2018-01-18 | Paper |
| Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials | 2018-01-18 | Paper |
| On a Ramsey-type problem of Erdős and Pach | 2018-01-16 | Paper |
| Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials | 2018-01-10 | Paper |
| Obtaining online ecological colourings by generalizing first-fit | 2017-11-07 | Paper |
| On a Ramsey-type problem of Erdős and Pach | 2016-10-14 | Paper |
| Finding shortest paths between graph colourings | 2016-09-07 | Paper |
| A domination algorithm for {0,1}-instances of the travelling salesman problem | 2016-06-10 | Paper |
| Parameterized Traveling Salesman Problem: Beating the Average | 2016-02-05 | Paper |
| Mixing of the Glauber dynamics for the ferromagnetic Potts model | 2016-02-03 | Paper |
| A Precise Threshold for Quasi-Ramsey Numbers | 2015-09-23 | Paper |
| Finding Shortest Paths Between Graph Colourings | 2015-09-15 | Paper |
| Poset limits can be totally ordered | 2015-04-22 | Paper |
| Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments | 2014-10-15 | Paper |
| Tight inequalities among set hitting times in Markov chains | 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 2K2‐Free Graphs | 2014-05-22 | Paper |
| Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs | 2014-02-25 | Paper |
| Tight complexity bounds for FPT subgraph problems parameterized by the clique-width | 2014-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857338 | 2013-11-01 | Paper |
| Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus | 2013-09-25 | Paper |
| The complexity of finding uniform sparsest cuts in various graph classes | 2012-09-13 | Paper |
| Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width | 2012-06-15 | Paper |
| The Complexity Status of Problems Related to Sparsest Cuts | 2011-05-19 | Paper |
| Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus | 2010-09-06 | Paper |
| Obtaining Online Ecological Colourings by Generalizing First-Fit | 2010-06-22 | Paper |
| Average relational distance in linear extensions of posets | 2010-04-27 | Paper |
| Cutting two graphs simultaneously | 2008-11-19 | Paper |
| Partitioning posets | 2008-09-09 | Paper |
