| Almost all 5-regular graphs have a 3-flow. | 2 | 0.49 | 2020 |
| Local algorithms, regular graphs of large girth, and random regular graphs | 4 | 0.48 | 2018 |
| The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph. | 0 | 0.34 | 2018 |
| Uniform generation of random graphs with power-law degree sequences. | 0 | 0.34 | 2018 |
| Minimum Power Dominating Sets of Random Cubic Graphs. | 0 | 0.34 | 2017 |
| Meyniel's conjecture holds for random graphs | 3 | 0.48 | 2016 |
| The threshold for combs in random graphs. | 0 | 0.34 | 2016 |
| Uniform Generation of Random Regular Graphs | 4 | 0.49 | 2015 |
| The Evolution And Structure Of Social Networks | 0 | 0.34 | 2014 |
| The mixing time of the giant component of a random graph | 18 | 0.90 | 2014 |
| Asymptotic enumeration of sparse 2-connected graphs. | 0 | 0.34 | 2013 |
| Asymptotic enumeration of strongly connected digraphs by vertices and edges. | 2 | 0.42 | 2013 |
| Induced subgraphs in sparse random graphs with given degree sequences | 2 | 0.39 | 2012 |
| Gradient-Constrained Minimum Networks. III. Fixed Topology. | 0 | 0.34 | 2012 |
| Cores of random r-partite hypergraphs | 6 | 0.43 | 2012 |
| Regular induced subgraphs of a random Graph | 2 | 0.41 | 2011 |
| Pegging graphs yields a small diameter | 0 | 0.34 | 2011 |
| Orientability Thresholds for Random Hypergraphs. | 2 | 0.41 | 2010 |
| Load balancing and orientability thresholds for random hypergraphs | 10 | 0.70 | 2010 |
| The diameter of sparse random graphs | 9 | 1.02 | 2010 |
| Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs. | 2 | 0.43 | 2010 |
| Asymptotics of Some Convolutional Recurrences | 2 | 0.39 | 2010 |
| Short cycle distribution in random regular graphs recursively generated by pegging | 3 | 0.55 | 2009 |
| On the chromatic number of a random 5-regular graph | 5 | 0.53 | 2009 |
| Rate of convergence of the short cycle distribution in random regular graphs generated by pegging | 1 | 0.42 | 2009 |
| Representing Small Group Evolution | 7 | 0.73 | 2009 |
| Distribution of subgraphs of random regular graphs | 6 | 0.63 | 2008 |
| Induced forests in regular graphs with large girth | 6 | 0.49 | 2008 |
| Expansion properties of a random regular graph after random vertex deletions | 4 | 0.62 | 2008 |
| Corrigendum: Corrigendum to “Counting connected graphs inside-out” [J. Combin. Theory Ser. B 93 (2005) 127--172] | 2 | 0.40 | 2008 |
| Constrained Path Optimisation for Underground Mine Layout | 1 | 0.48 | 2007 |
| Bounds on the bisection width for random d -regular graphs | 15 | 0.88 | 2007 |
| Colouring Random Regular Graphs | 9 | 0.57 | 2007 |
| Growing Protean Graphs | 8 | 0.65 | 2007 |
| Birth control for giants | 24 | 1.59 | 2007 |
| Cleaning random d-regular graphs with brushes using a degree-greedy algorithm | 8 | 0.76 | 2007 |
| Rainbow Hamilton cycles in random regular graphs | 9 | 0.87 | 2007 |
| Colouring Random 4-Regular Graphs | 7 | 0.61 | 2007 |
| Network modelling of underground mine layout: two case studies | 2 | 0.54 | 2007 |
| The generalized acyclic edge chromatic number of random regular graphs | 5 | 0.52 | 2006 |
| Encores on Cores | 14 | 0.88 | 2006 |
| Analysis of algorithms on the cores of random graphs | 0 | 0.34 | 2006 |
| 3-star factors in random d-regular graphs | 3 | 0.44 | 2006 |
| Random k-Sat: A Tight Threshold For Moderately Growing k | 20 | 1.29 | 2005 |
| The acyclic edge chromatic number of a random d-regular graph is d + 1 | 26 | 1.61 | 2005 |
| Counting connected graphs inside-out | 35 | 2.08 | 2005 |
| Avoidance of a giant component in half the edge set of a random graph | 19 | 1.72 | 2004 |
| Hamiltonian decompositions of random bipartite regular graphs | 3 | 0.40 | 2004 |
| Random Hypergraph Processes with Degree Restrictions | 2 | 0.42 | 2004 |
| To Adrian Bondy and U.S.R. Murty | 0 | 0.34 | 2004 |
