| Publication | Date of Publication | Type |
|---|
| A robust Corrádi-Hajnal theorem | 2024-11-20 | Paper |
| Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles | 2024-09-30 | Paper |
| The square of a Hamilton cycle in randomly perturbed graphs | 2024-09-02 | Paper |
| Graph and hypergraph packing | 2024-03-20 | Paper |
| Universality for graphs of bounded degeneracy | 2023-09-11 | Paper |
| Triangles in randomly perturbed graphs | 2023-04-03 | Paper |
| Graphs with large minimum degree and no small odd cycles are $3$-colourable | 2023-02-03 | Paper |
| Partition universality for graphs of bounded degeneracy and degree | 2022-11-28 | Paper |
| A robust Corr\'adi--Hajnal Theorem | 2022-09-02 | Paper |
| Partitioning a 2-edge-coloured graph of minimum degree $2n/3 + o(n)$ into three monochromatic cycles | 2022-04-01 | Paper |
| The tree packing conjecture for trees of almost linear maximum degree | 2021-06-22 | Paper |
| Cycle factors in randomly perturbed graphs | 2021-03-10 | Paper |
| EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS | 2020-06-09 | Paper |
| Universality for bounded degree spanning trees in randomly perturbed graphs | 2020-02-14 | Paper |
| Large-scale structures in random graphs | 2019-09-25 | Paper |
| Embedding spanning bounded degree subgraphs in randomly perturbed graphs | 2018-01-18 | Paper |
| Making spanning graphs | 2017-11-14 | Paper |
| An Approximate Version of the Tree Packing Conjecture via Random Embeddings | 2017-03-22 | Paper |
| Blow-up lemmas for sparse graphs | 2016-12-02 | Paper |
| Triangle-free subgraphs of random graphs | 2016-10-14 | Paper |
| Local resilience of spanning subgraphs in sparse random graphs | 2016-10-14 | Paper |
| Tight cycles in hypergraphs | 2016-10-14 | Paper |
| Regular slices for hypergraphs | 2016-10-14 | Paper |
| An approximate version of the tree packing conjecture | 2016-04-21 | Paper |
| Spanning embeddings of arrangeable graphs with sublinear bandwidth | 2016-03-22 | Paper |
| An Extension of the Blow-up Lemma to Arrangeable Graphs | 2015-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934645 | 2014-12-18 | Paper |
| An extension of Turán's theorem, uniqueness and stability | 2014-10-23 | Paper |
| Almost spanning subgraphs of random graphs after adversarial edge removal | 2014-02-24 | Paper |
| A density Corrádi-Hajnal theorem | 2013-11-01 | Paper |
| Induced \(C_5\)-free graphs of fixed density: counting and homogeneous sets | 2013-11-01 | Paper |
| The tripartite Ramsey number for trees | 2013-10-10 | Paper |
| Minimum degree conditions for large subgraphs | 2013-10-10 | Paper |
| Forcing spanning subgraphs via Ore type conditions | 2013-10-10 | Paper |
| Almost spanning subgraphs of random graphs after adversarial edge removal | 2013-07-19 | Paper |
| Bandwidth, treewidth, separators, expansion, and universality | 2013-06-28 | Paper |
| Ramsey properties of permutations | 2013-06-07 | Paper |
| Perfect graphs of fixed density: counting and homogeneous sets | 2012-09-12 | Paper |
| Properly coloured copies and rainbow copies of large graphs with small maximum degree | 2012-08-14 | Paper |
| The tripartite Ramsey number for trees | 2012-06-13 | Paper |
| Embedding into Bipartite Graphs | 2011-07-18 | Paper |
| Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs | 2010-06-17 | Paper |
| On the tractability of coloring semirandom graphs | 2010-06-09 | Paper |
| Proof of the bandwidth conjecture of Bollobás and Komlós | 2008-12-01 | Paper |
| Spanning 3-colourable subgraphs of small bandwidth in dense graphs | 2008-07-24 | Paper |
| Embedding spanning subgraphs of small bandwidth | 2008-06-05 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| The square of a Hamilton cycle in randomly perturbed graphs | N/A | Paper |
