Follow
Nicholas Wormald
Nicholas Wormald
Professor of Mathematics, Monash University
Verified email at monash.edu
Title
Cited by
Cited by
Year
Models of random regular graphs
NC Wormald
London Mathematical Society Lecture Note Series, 239-298, 1999
8271999
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
5051996
Differential equations for random processes and random graphs
NC Wormald
The annals of applied probability, 1217-1235, 1995
4681995
Edge crossings in drawings of bipartite graphs
P Eades, NC Wormald
Algorithmica 11, 379-403, 1994
4201994
The differential equation method for random graph processes and greedy algorithms
NC Wormald
Lectures on approximation and randomized algorithms, 73-155, 1999
3231999
Generating random regular graphs quickly
A Steger, NC Wormald
Combinatorics, Probability and Computing 8 (4), 377-396, 1999
3141999
Almost all regular graphs are Hamiltonian
RW Robinson, NC Wormald
Random Structures and Algorithms 5 (2), 363-374, 1994
2731994
Asymptotic enumeration by degree sequence of graphs with degreeso (n 1/2)
BD McKay, NC Wormald
Combinatorica 11 (4), 369-382, 1991
2501991
Uniform generation of random regular graphs of moderate degree
BD McKay, NC Wormald
Journal of Algorithms 11 (1), 52-67, 1990
2051990
Almost all cubic graphs are Hamiltonian
RW Robinson, NC Wormald
Random Structures & Algorithms 3 (2), 117-125, 1992
1981992
The asymptotic distribution of short cycles in random regular graphs
NC Wormald
Journal of Combinatorial Theory, Series B 31 (2), 168-182, 1981
1811981
Some problems in the enumeration of labelled graphs
NC Wormald
Bulletin of the Australian Mathematical Society 21 (1), 159-160, 1980
1761980
The asymptotic connectivity of labelled regular graphs
NC Wormald
Journal of Combinatorial Theory, Series B 31 (2), 156-167, 1981
1681981
Asymptotic enumeration by degree sequence of graphs of high degree
BD McKay, NC Wormald
European Journal of Combinatorics 11 (6), 565-580, 1990
1461990
A family of perfect hashing methods
BS Majewski, NC Wormald, G Havas, ZJ Czech
The Computer Journal 39 (6), 547-554, 1996
1391996
Random regular graphs of high degree
M Krivelevich, B Sudakov, VH Vu, NC Wormald
Random Structures and Algorithms 18 (4), 346-363, 2001
1272001
On an edge crossing problem
P Eades, BD McKay, NC Wormald
Proc. 9th Australian Computer Science Conference 327, 334, 1986
1251986
Birth control for giants
J Spencer, N Wormald
Combinatorica 27, 587-628, 2007
1242007
Short cycles in random regular graphs
BD McKay, NC Wormald, B Wysocka
the electronic journal of combinatorics 11 (1), R66, 2004
1192004
Random graph processes with degree restrictions
A Rucinski, NC Wormald
Combinatorics, Probability & Computing 1, 169-180, 1992
1171992
The system can't perform the operation now. Try again later.
Articles 1–20