| Publication | Date of Publication | Type |
|---|
| Balanced allocation on dynamic hypergraphs | 2023-10-31 | Paper |
| Counting independent sets in graphs with bounded bipartite pathwidth | 2023-10-12 | Paper |
| Decomposing random regular graphs into stars | 2023-08-30 | Paper |
| Balanced allocation on hypergraphs | 2023-08-21 | Paper |
| Degree sequences of sufficiently dense random uniform hypergraphs | 2023-04-03 | Paper |
| Spanning trees in random regular uniform hypergraphs | 2023-03-31 | Paper |
| Lower bounds on the chromatic number of random graphs | 2023-01-23 | Paper |
| A triangle process on graphs with given degree sequence | 2023-01-20 | Paper |
| Generating graphs randomly | 2022-11-18 | Paper |
| A triangle process on regular graphs | 2022-03-22 | Paper |
| The mixing time of switch Markov chains: a unified approach | 2021-10-28 | Paper |
| Subgraph counts for dense random graphs with specified degrees | 2021-06-15 | Paper |
| Mixing time of the switch Markov chain and stable degree sequences | 2021-03-25 | Paper |
| Threshold functions for substructures in random subsets of finite vector spaces | 2021-02-08 | Paper |
| The average number of spanning hypertrees in sparse uniform hypergraphs | 2021-01-21 | Paper |
| A triangle process on regular graphs | 2020-12-23 | Paper |
| On the Parameterised Complexity of Induced Multipartite Graph Parameters | 2020-04-21 | Paper |
| A threshold result for loose Hamiltonicity in random regular uniform hypergraphs | 2020-04-07 | Paper |
| Counting independent sets in graphs with bounded bipartite pathwidth | 2020-02-24 | Paper |
| Uniform generation of spanning regular subgraphs of a dense graph | 2019-11-15 | Paper |
| Rigid Colorings of Hypergraphs and Contiguity | 2019-09-06 | Paper |
| Hypergraph coloring up to condensation | 2019-08-14 | Paper |
| Triangle-creation processes on cubic graphs | 2019-05-11 | Paper |
| The flip Markov chain for connected regular graphs | 2019-02-08 | Paper |
| Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges | 2019-01-29 | Paper |
| Lower bounds on the chromatic number of random graphs | 2018-12-23 | Paper |
| Counting independent sets in graphs with bounded bipartite pathwidth | 2018-12-07 | Paper |
| The switch Markov chain for sampling irregular graphs and digraphs | 2018-03-12 | Paper |
| The switch Markov chain for sampling irregular graphs (Extended Abstract) | 2017-10-05 | Paper |
| The average number of spanning trees in sparse graphs with given degrees | 2017-06-19 | Paper |
| Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees | 2016-09-13 | Paper |
| Mixing of the Glauber dynamics for the ferromagnetic Potts model | 2016-02-03 | Paper |
| Asymptotic enumeration of sparse uniform hypergraphs with given degrees | 2015-09-30 | Paper |
| On the chromatic number of a random hypergraph | 2015-06-10 | Paper |
| The switch Markov chain for sampling irregular graphs | 2014-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921768 | 2014-10-13 | Paper |
| On the number of spanning trees in random regular graphs | 2014-09-04 | Paper |
| Structure and eigenvalues of heat-bath Markov chains | 2014-06-04 | Paper |
| Asymptotic Enumeration of Sparse Multigraphs with Given Degrees | 2014-04-10 | Paper |
| On the Number of Perfect Matchings in Random Lifts | 2013-03-13 | Paper |
| Making Markov chains less lazy | 2012-03-29 | Paper |
| Counting loopy graphs with given degrees | 2012-03-08 | Paper |
| A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs | 2012-03-06 | Paper |
| Random dense bipartite graphs and directed graphs with specified degrees | 2010-11-09 | Paper |
| Asymptotic enumeration of correlation-immune Boolean functions | 2010-04-12 | Paper |
| The cycle structure of two rows in a random Latin square | 2009-03-04 | Paper |
| Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums | 2008-11-06 | Paper |
| Expansion properties of a random regular graph after random vertex deletions | 2008-05-29 | Paper |
| Asymptotic enumeration of dense 0-1 matrices with specified line sums | 2008-02-04 | Paper |
| Sampling Regular Graphs and a Peer-to-Peer Network | 2008-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3422410 | 2007-02-13 | Paper |
| The generalized acyclic edge chromatic number of random regular graphs | 2007-02-07 | Paper |
| Neighbour-distinguishing edge colourings of random regular graphs | 2006-08-30 | Paper |
| Bounds on the generalised acyclic chromatic numbers of bounded degree graphs | 2006-06-16 | Paper |
| Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums | 2006-03-16 | Paper |
| Generation of simple quadrangulations of the sphere | 2006-01-10 | Paper |
| Corrigendum: The complexity of counting graph homomorphisms | 2005-02-16 | Paper |
| Random hypergraph processes with degree restrictions | 2005-01-20 | Paper |
| The relative complexity of approximate counting problems | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471152 | 2004-06-18 | Paper |
| Hamiltonian decompositions of random bipartite regular graphs. | 2004-03-14 | Paper |
| Convergence of the Iterated Prisoner's Dilemma Game | 2003-03-17 | Paper |
| Permutation Pseudographs and Contiguity | 2003-03-09 | Paper |
| Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs | 2002-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753731 | 2002-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4521549 | 2001-07-29 | Paper |
| An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952624 | 2001-03-02 | Paper |
| The complexity of counting colourings and independent sets in sparse graphs and hypergraphs | 2000-12-19 | Paper |
| Polynomial-time counting and sampling of two-rowed contingency tables | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952676 | 2000-10-23 | Paper |
| On Markov Chains for Independent Sets | 2000-10-04 | Paper |
| An Algorithm for Recognising the Exterior Square of a Multiset | 2000-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250202 | 2000-06-21 | Paper |
| A more rapidly mixing Markov chain for graph colorings | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263659 | 1999-11-21 | Paper |
| On Approximately Counting Colorings of Small Degree Graphs | 1999-10-28 | Paper |
| An algorithm for recognising the exterior square of a matrix | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219031 | 1999-07-07 | Paper |
| Theoretical and experimental comparison of efficiency of finite field extensions | 1996-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862208 | 1996-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288073 | 1994-04-21 | Paper |
