| Publication | Date of Publication | Type |
|---|
| On the size-Ramsey number of grid graphs | 2023-03-30 | Paper |
| The tree packing conjecture for trees of almost linear maximum degree | 2021-06-22 | Paper |
| On minimum bisection and related cut problems in trees and tree‐like graphs | 2018-10-31 | Paper |
| Minimal Ramsey graphs for cyclicity | 2018-07-31 | Paper |
| Logical limit laws for minor-closed classes of graphs | 2018-04-18 | Paper |
| Counting results for sparse pseudorandom hypergraphs. I. | 2017-08-31 | Paper |
| Counting results for sparse pseudorandom hypergraphs. II. | 2017-08-31 | Paper |
| An Approximate Version of the Tree Packing Conjecture via Random Embeddings | 2017-03-22 | Paper |
| Approximating minimum \(k\)-section in trees with linear diameter | 2016-10-17 | Paper |
| A counting lemma for sparse pseudorandom hypergraphs | 2016-10-17 | Paper |
| On minimum bisection and related partition problems in graphs with bounded tree width | 2016-10-14 | Paper |
| Local resilience of spanning subgraphs in sparse random graphs | 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 |
| Ramsey numbers for bipartite graphs with small bandwidth | 2015-06-02 | Paper |
| Coloring \(d\)-embeddable \(k\)-uniform hypergraphs | 2015-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934645 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419980 | 2014-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419987 | 2014-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419960 | 2014-06-11 | Paper |
| Almost spanning subgraphs of random graphs after adversarial edge removal | 2014-02-24 | Paper |
| Supporting document to the paper "Logical limit laws for minor-closed classes of graphs" | 2014-01-24 | Paper |
| Induced \(C_5\)-free graphs of fixed density: counting and homogeneous sets | 2013-11-01 | Paper |
| Primality of trees | 2013-07-30 | 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 |
| Perfect graphs of fixed density: counting and homogeneous sets | 2012-09-12 | Paper |
| Embedding into Bipartite Graphs | 2011-07-18 | Paper |
| Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs | 2010-06-17 | Paper |
| Coloring Random Intersection Graphs and Complex Networks | 2010-03-17 | Paper |
| Proof of the bandwidth conjecture of Bollobás and Komlós | 2008-12-01 | Paper |
| Diskrete Mathematik | 2008-10-30 | 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 |
| The random planar graph process | 2008-03-28 | Paper |
| Essentially infinite colourings of hypergraphs | 2007-11-27 | Paper |
| \(K_4\)-free subgraphs of random graphs revisited | 2007-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439681 | 2007-05-29 | Paper |
| Efficiently covering complex networks with cliques of similar vertices | 2006-04-28 | Paper |
| Degree sequences of \(F\)-free graphs | 2006-01-17 | Paper |
| Large planar subgraphs in dense graphs | 2005-11-22 | Paper |
| For which densities are random triangle-free graphs almost surely bipartite? | 2004-09-07 | Paper |
| Exact and approximative algorithms for coloring G(n,p) | 2004-08-06 | Paper |
| On random planar graphs, the number of planar graphs and their triangulations | 2003-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418675 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411935 | 2003-07-10 | Paper |
| Almost all graphs with high girth and suitable density have high chromatic number | 2002-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542180 | 2002-08-04 | Paper |
| Phase transitions in the evolution of partial orders | 2002-06-02 | Paper |
| Random maximalH-free graphs | 2001-08-30 | Paper |
| Asymptotic enumeration, global structure, and constrained evolution | 2001-07-24 | Paper |
| Counting partial orders with a fixed number of comparable pairs | 2001-07-18 | Paper |
| Hypergraph Packing and Graph Embedding | 2000-01-04 | Paper |
| Randomized algorithms to generate hypergraphs with given degree sequences | N/A | Paper |
