| Publication | Date of Publication | Type |
|---|
| Friendly bisections of random graphs | 2023-10-17 | Paper |
| On subgraphs with degrees of prescribed residues in the random graph | 2023-10-12 | Paper |
| Counting Hamilton cycles in Dirac hypergraphs | 2023-10-04 | Paper |
| Singularity of the \(k\)-core of a random graph | 2023-05-11 | Paper |
| Sparse recovery properties of discrete random matrices | 2023-04-03 | Paper |
| Singularity of sparse random matrices: simple proofs | 2023-03-31 | Paper |
| Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial | 2023-02-10 | Paper |
| Dirac-type Problem of Rainbow matchings and Hamilton cycles in Random Graphs | 2022-11-10 | Paper |
| Every graph contains a linearly sized induced subgraph with all degrees odd | 2022-08-04 | Paper |
| List-Decodability With Large Radius for Reed-Solomon Codes | 2022-07-13 | Paper |
| Dirac-type theorems in random hypergraphs | 2022-04-27 | Paper |
| Counting Hamiltonian Cycles in Dirac Hypergraphs | 2021-10-28 | Paper |
| Singularity of random symmetric matrices -- simple proof | 2021-09-03 | Paper |
| On the counting problem in inverse Littlewood–Offord theory | 2021-08-13 | Paper |
| A quantitative Lovász criterion for Property B | 2021-06-15 | Paper |
| Resilience of the rank of random matrices | 2021-06-15 | Paper |
| Number of 1-factorizations of regular high-degree graphs | 2021-01-25 | Paper |
| Lower bounds for multicolor Ramsey numbers | 2021-01-20 | Paper |
| 1‐Factorizations of pseudorandom graphs | 2020-11-30 | Paper |
| Almost all Steiner triple systems are almost resolvable | 2020-11-20 | Paper |
| Towards the linear arboricity conjecture | 2020-04-07 | Paper |
| Long Monotone Trails in Random Edge-Labellings of Random Graphs | 2020-04-06 | Paper |
| Supersaturated Sparse Graphs and Hypergraphs | 2020-02-17 | Paper |
| Co-degrees resilience for perfect matchings in random hypergraphs | 2020-02-10 | Paper |
| The probability of selecting $k$ edge-disjoint Hamilton cycles in the complete graph | 2020-01-04 | Paper |
| Optimal threshold for a random graph to be 2-universal | 2019-09-26 | Paper |
| SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS | 2019-09-24 | Paper |
| Counting Hamilton Decompositions of Oriented Graphs | 2019-09-09 | Paper |
| Packing trees of unbounded degrees in random graphs | 2019-07-11 | Paper |
| Packing and counting arbitrary Hamilton cycles in random digraphs | 2019-06-07 | Paper |
| Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs | 2019-03-28 | Paper |
| Counting Hamilton cycles in sparse random directed graphs | 2019-02-20 | Paper |
| Spanning universality in random graphs | 2019-02-20 | Paper |
| Law of the iterated logarithm for random graphs | 2019-02-20 | Paper |
| Packing perfect matchings in random hypergraphs | 2018-05-25 | Paper |
| Resilience for the Littlewood-Offord problem | 2018-01-18 | Paper |
| Packing Loose Hamilton Cycles | 2017-10-27 | Paper |
| Embedding large graphs into a random graph | 2017-10-24 | Paper |
| Robust hamiltonicity of random directed graphs extended abstract | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365089 | 2017-09-29 | Paper |
| Resilience for the Littlewood-Offord problem | 2017-09-19 | Paper |
| Robust Hamiltonicity of random directed graphs | 2017-08-22 | Paper |
| Packing, counting and covering Hamilton cycles in random directed graphs | 2017-08-10 | Paper |
| Efficient Winning Strategies in Random‐Turn Maker–Breaker Games | 2017-07-05 | Paper |
| Packing spanning graphs from separable families | 2017-06-09 | Paper |
| Almost‐spanning universality in random graphs | 2017-06-02 | Paper |
| Strong games played on random graphs | 2017-02-17 | Paper |
| Rainbow Hamilton cycles in random graphs and hypergraphs | 2017-01-25 | Paper |
| Counting and packing Hamilton cycles in dense graphs and oriented graphs | 2016-11-25 | Paper |
| Almost-spanning universality in random graphs (extended abstract) | 2016-10-14 | Paper |
| Packing, counting and covering Hamilton cycles in random directed graphs | 2016-10-14 | Paper |
| Universality of random graphs and rainbow embedding | 2016-06-10 | Paper |
| Random matrices: Law of the iterated logarithm | 2016-05-24 | Paper |
| Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs | 2016-02-19 | Paper |
| Generating random graphs in biased Maker-Breaker games | 2016-01-07 | Paper |
| Building Spanning Trees Quickly in Maker-Breaker Games | 2015-09-23 | Paper |
| On a conjecture of Thomassen | 2015-08-27 | Paper |
| Biased games on random boards | 2015-07-23 | Paper |
| Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs | 2015-03-11 | Paper |
| A Construction of Almost Steiner Systems | 2014-12-22 | Paper |
| Packing a randomly edge-colored random graph with rainbow $k$-outs | 2014-10-07 | Paper |
| Weak and strong \(k\)-connectivity games | 2014-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419991 | 2014-06-11 | Paper |
| Avoider-Enforcer games played on edge disjoint hypergraphs | 2014-01-27 | Paper |
| Fast embedding of spanning trees in biased Maker-Breaker games | 2013-11-01 | Paper |
| The biased odd cycle game | 2013-06-07 | Paper |
| Fast Strategies In Maker–Breaker Games Played on Random Boards | 2012-10-31 | Paper |
| Hitting time results for Maker-Breaker games | 2012-08-30 | Paper |
| Fast embedding of spanning trees in biased maker-breaker games | 2012-06-18 | Paper |
| Winning strong games through fast strategies for weak games | 2011-07-29 | Paper |
| On almost precipitous ideals | 2010-04-15 | Paper |
| Hamiltonicity of Sparse Pseudorandom Graphs | 0001-01-03 | Paper |
| A quantum algorithm for learning a graph of bounded degree | 0001-01-03 | Paper |
