Models of random regular graphs NC Wormald London mathematical society lecture note series, 239-298, 1999 | 861 | 1999 |

Sudden emergence of a giantk-core in a random graph B Pittel, J Spencer, N Wormald Journal of Combinatorial Theory, Series B 67 (1), 111-151, 1996 | 517 | 1996 |

Differential equations for random processes and random graphs NC Wormald The annals of applied probability, 1217-1235, 1995 | 492 | 1995 |

Edge crossings in drawings of bipartite graphs P Eades, NC Wormald Algorithmica 11, 379-403, 1994 | 429 | 1994 |

The differential equation method for random graph processes and greedy algorithms NC Wormald Lectures on approximation and randomized algorithms 73 (155), 0943.05073, 1999 | 346 | 1999 |

Generating random regular graphs quickly A Steger, NC Wormald Combinatorics, Probability and Computing 8 (4), 377-396, 1999 | 338 | 1999 |

Almost all regular graphs are Hamiltonian RW Robinson, NC Wormald Random Structures & Algorithms 5 (2), 363-374, 1994 | 276 | 1994 |

Asymptotic enumeration by degree sequence of graphs with degrees*o*(*n*^{1/2})BD McKay, NC Wormald Combinatorica 11 (4), 369-382, 1991 | 251 | 1991 |

Uniform generation of random regular graphs of moderate degree BD McKay, NC Wormald Journal of Algorithms 11 (1), 52-67, 1990 | 209 | 1990 |

Almost all cubic graphs are Hamiltonian RW Robinson, NC Wormald Random Structures & Algorithms 3 (2), 117-125, 1992 | 202 | 1992 |

The asymptotic distribution of short cycles in random regular graphs NC Wormald Journal of Combinatorial Theory, Series B 31 (2), 168-182, 1981 | 190 | 1981 |

Some problems in the enumeration of labelled graphs NC Wormald Bulletin of the Australian Mathematical Society 21 (1), 159-160, 1980 | 186 | 1980 |

The asymptotic connectivity of labelled regular graphs NC Wormald Journal of Combinatorial Theory, Series B 31 (2), 156-167, 1981 | 180 | 1981 |

Asymptotic enumeration by degree sequence of graphs of high degree BD McKay, NC Wormald European Journal of Combinatorics 11 (6), 565-580, 1990 | 151 | 1990 |

A family of perfect hashing methods BS Majewski, NC Wormald, G Havas, ZJ Czech The Computer Journal 39 (6), 547-554, 1996 | 150 | 1996 |

On an edge crossing problem P Eades, BD McKay, NC Wormald Proc. 9th Australian Computer Science Conference 327, 334, 1986 | 132 | 1986 |

Random regular graphs of high degree M Krivelevich, B Sudakov, VH Vu, NC Wormald Random Structures & Algorithms 18 (4), 346-363, 2001 | 131 | 2001 |

Birth control for giants J Spencer, N Wormald Combinatorica 27, 587-628, 2007 | 130 | 2007 |

Short cycles in random regular graphs BD McKay, NC Wormald, B Wysocka the electronic journal of combinatorics, R66-R66, 2004 | 125 | 2004 |

Geometric separator theorems and applications WD Smith, NC Wormald Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998 | 120 | 1998 |