| On the purity of minor-closed classes of graphs. | 0 | 0.34 | 2019 |
| Random perfect graphs. | 0 | 0.34 | 2019 |
| Clique coloring of binomial random graphs | 0 | 0.34 | 2019 |
| On the critical densities of minor-closed classes. | 0 | 0.34 | 2019 |
| Learning random points from geometric graphs or orderings | 0 | 0.34 | 2018 |
| Linear Extensions and Comparable Pairs in Partial Orders. | 0 | 0.34 | 2018 |
| Clique colourings of geometric graphs | 0 | 0.34 | 2018 |
| Modularity of Erdos-Renyi random graphs | 0 | 0.34 | 2018 |
| Modularity of regular and treelike graphs. | 1 | 0.37 | 2018 |
| Bridge-Addability, Edge-Expansion and Connectivity. | 0 | 0.34 | 2017 |
| Hamilton Cycles, Minimum Degree, and Bipartite Holes. | 2 | 0.39 | 2017 |
| Uniform multicommodity flows in the hypercube with random edge-capacities. | 0 | 0.34 | 2017 |
| Colour degree matrices of graphs with at most one cycle | 1 | 0.36 | 2016 |
| Connectivity for bridge-alterable graph classes | 0 | 0.34 | 2016 |
| Recognition of Unipolar and Generalised Split Graphs. | 5 | 0.65 | 2015 |
| Extremal Distances for Subtree Transfer Operations in Binary Trees | 2 | 0.39 | 2015 |
| On the Spread of Random Graphs. | 0 | 0.34 | 2014 |
| The number of disk graphs | 0 | 0.34 | 2014 |
| Uniform multicommodity flow in the hypercube with random edge capacities. | 0 | 0.34 | 2014 |
| For most graphs H, most H-free graphs have a linear homogeneous set | 0 | 0.34 | 2014 |
| Random Graphs from a Weighted Minor-Closed Class. | 0 | 0.34 | 2013 |
| Modularity in random regular graphs and lattices. | 3 | 0.41 | 2013 |
| Connectivity for bridge-addable monotone graph classes | 8 | 1.12 | 2012 |
| Quicksort and Large Deviations. | 0 | 0.34 | 2012 |
| Largest sparse subgraphs of random graphs | 0 | 0.34 | 2011 |
| Random unlabelled graphs containing few disjoint cycles | 3 | 0.47 | 2011 |
| On graphs with few disjoint t-star minors | 2 | 0.38 | 2011 |
| Random graphs with few disjoint cycles | 4 | 0.45 | 2011 |
| The t-Stability Number of a Random Graph. | 0 | 0.34 | 2010 |
| The number of bits needed to represent a unit disk graph | 1 | 0.36 | 2010 |
| Acyclic improper colourings of graphs with bounded maximum degree | 5 | 0.52 | 2010 |
| Uniform multicommodity flow through the complete graph with random edge-capacities | 1 | 0.38 | 2009 |
| Random graphs from a minor-closed class | 10 | 0.68 | 2009 |
| On the maximum degree of a random planar graph | 12 | 0.78 | 2008 |
| Random graphs on surfaces | 15 | 1.10 | 2008 |
| Random cubic planar graphs | 15 | 1.23 | 2007 |
| List Colouring Squares of Planar Graphs | 23 | 1.25 | 2007 |
| On The Span Of A Random Channel Assignment Problem | 1 | 0.35 | 2007 |
| Vertex-Colouring Edge-Weightings | 28 | 6.82 | 2007 |
| Concentration for self-bounding functions and an inequality of Talagrand | 7 | 0.67 | 2006 |
| Random planar graphs | 49 | 5.07 | 2005 |
| On the Number of Edges in Random Planar Graphs | 17 | 12.38 | 2004 |
| Graph Imperfection with a Co-Site Constraint | 1 | 0.45 | 2004 |
| Channel assignment on graphs of bounded treewidth | 11 | 0.96 | 2003 |
| Concentration for locally acting permutations | 2 | 1.18 | 2003 |
| Random channel assignment in the plane | 23 | 1.52 | 2003 |
| On the span in channel assignment problems: bounds, computing and counting | 26 | 1.64 | 2003 |
| On the divisibility of graphs | 15 | 1.70 | 2002 |
| Channel Assignment with Large Demands | 1 | 0.40 | 2001 |
| Bisecting sparse random graphs | 7 | 0.93 | 2001 |
