| A spanning bandwidth theorem in random graphs. | 0 | 0.34 | 2022 |
| On the size-Ramsey number of grid graphs | 0 | 0.34 | 2021 |
| Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter. | 0 | 0.34 | 2017 |
| On minimum bisection and related cut problems in trees and tree-like graphs | 0 | 0.34 | 2017 |
| Counting results for sparse pseudorandom hypergraphs II. | 0 | 0.34 | 2017 |
| Spanning embeddings of arrangeable graphs with sublinear bandwidth | 0 | 0.34 | 2016 |
| Local resilience of spanning subgraphs in sparse random graphs | 1 | 0.36 | 2015 |
| A counting lemma for sparse pseudorandom hypergraphs | 0 | 0.34 | 2015 |
| Approximating Minimum k -Section in Trees with Linear Diameter | 2 | 0.48 | 2015 |
| An Extension of the Blow-up Lemma to Arrangeable Graphs. | 4 | 0.46 | 2015 |
| On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width | 1 | 0.43 | 2015 |
| An Approximate Version of the Tree Packing Conjecture via Random Embeddings. | 0 | 0.34 | 2014 |
| Coloring d-Embeddable k-Uniform Hypergraphs. | 1 | 0.36 | 2014 |
| Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal. | 5 | 0.55 | 2013 |
| Perfect graphs of fixed density: Counting and homogeneous sets | 0 | 0.34 | 2012 |
| Induced C5-free graphs of fixed density: counting and homogeneous sets. | 0 | 0.34 | 2011 |
| Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs | 18 | 0.98 | 2010 |
| Embedding into Bipartite Graphs | 2 | 0.37 | 2010 |
| Coloring Random Intersection Graphs and Complex Networks | 12 | 1.53 | 2009 |
| Bandwidth, treewidth, separators, expansion, and universality | 1 | 0.36 | 2008 |
| The random planar graph process | 7 | 0.66 | 2008 |
| Spanning 3-colourable subgraphs of small bandwidth in dense graphs | 5 | 0.53 | 2008 |
| Embedding spanning subgraphs of small bandwidth | 0 | 0.34 | 2007 |
| On the bandwidth conjecture for 3-colourable graphs | 0 | 0.34 | 2007 |
| Efficiently covering complex networks with cliques of similar vertices | 15 | 1.45 | 2006 |
| Degree Sequences of F-Free Graphs | 0 | 0.34 | 2005 |
| Globally bounded local edge colourings of hypergraphs | 0 | 0.34 | 2005 |
| Large planar subgraphs in dense graphs | 12 | 0.93 | 2005 |
| Exact and approximative algorithms for coloring G(n,p) | 14 | 0.80 | 2004 |
| Colouring Random Graphs in Expected Polynomial Time | 10 | 0.83 | 2003 |
| For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? | 7 | 1.06 | 2003 |
| On random planar graphs, the number of planar graphs and their triangulations | 22 | 12.40 | 2003 |
| Phase transitions in the evolution of partial orders | 4 | 2.88 | 2001 |
| Asymptotic enumeration, global structure, and constrained evolution | 8 | 1.04 | 2001 |
| Random maximal H-free graphs | 13 | 0.91 | 2001 |
| Almost all graphs with high girth and suitable density have high chromatic number | 1 | 0.42 | 2001 |
| Counting Partial Orders with a Fixed Number of Comparable Pairs | 3 | 2.83 | 2001 |
| Random graphs, random triangle-free graphs, and random partial orders | 0 | 0.34 | 2001 |
