The divisibility theorem for isomorphic factorizations of complete graphs. - Frank Harary; Robert W. Robinson; Nicholas C. Wormald (J. Graph Theory, 1977)

Counting labelled 3-connected graphs. - Nicholas C. Wormald (J. Graph Theory, 1977)

Achiral plane trees. - Nicholas C. Wormald (J. Graph Theory, 1978)

The exponential generating function of labelled blocks. - Nick Wormald; Edward M. Wright (Discret. Math., 1979)

Number of labeled 4-regular graphs. - Ronald C. Read; Nicholas C. Wormald (J. Graph Theory, 1980)

Counting unrooted planar maps. - Nicholas C. Wormald (Discret. Math., 1981)

The asymptotic connectivity of labelled regular graphs. - Nicholas C. Wormald (J. Comb. Theory B, 1981)

The asymptotic distribution of short cycles in random regular graphs. - Nicholas C. Wormald (J. Comb. Theory B, 1981)

Counting the 10-point graphs by partition. - Ronald C. Read; Nicholas C. Wormald (J. Graph Theory, 1981)

Numbers of cubic graphs. - Robert W. Robinson; Nicholas C. Wormald (J. Graph Theory, 1983)

Automorphisms of random graphs with specified vertices. - Brendan D. McKay; Nicholas C. Wormald (Comb., 1984)

Generating Random Regular Graphs. - Nicholas C. Wormald (J. Algorithms, 1984)

Isomorphic factorizations VII. Regular graphs and tournaments. - Nicholas C. Wormald (J. Graph Theory, 1984)

The number of loopless planar maps. - Edward A. Bender; Nicholas C. Wormald (Discret. Math., 1985)

Counting labelled chordal graphs. - Nicholas C. Wormald (Graphs Comb., 1985)

Regular factors of regular graphs. - Béla Bollobás; Akira Saito; Nicholas C. Wormald (J. Graph Theory, 1985)

Cataloguing the graphs on 10 vertices. - R. D. Cameron; Charles J. Colbourn; Ronald C. Read; Nicholas C. Wormald (J. Graph Theory, 1985)

Enumeration of cyclically 4-connected cubic graphs. - Nicholas C. Wormald (J. Graph Theory, 1985)

The asymptotic number of acyclic diagraphs I. - Edward A. Bender; L. Bruce Richmond; Robert W. Robinson; Nicholas C. Wormald (Comb., 1986)

Extremal clique coverings of complementary graphs. - D. de Caen; Paul Erdös; Norman J. Pullmann; Nicholas C. Wormald (Comb., 1986)

Optimal Worst Case Trees. - Edward A. Bender; Cheryl E. Praeger; Nicholas C. Wormald (Acta Informatica, 1987)

Ménage numbers, bijections and P-recursiveness. - E. Rodney Canfield; Nicholas C. Wormald (Discret. Math., 1987)

Generating Random Unlabelled Graphs. - Nicholas C. Wormald (SIAM J. Comput., 1987)

Random Triangulations of the Plane. - L. Bruce Richmond; Nicholas C. Wormald (Eur. J. Comb., 1988)

The asymptotic number of rooted nonseparable maps on a surface. - Edward A. Bender; Nicholas C. Wormald (J. Comb. Theory A, 1988)

Bounds on the measurable chromatic number of Rn. - László A. Székely; Nicholas C. Wormald (Discret. Math., 1989)

k-walks of graphs. - Bill Jackson; Nicholas C. Wormald (Australas. J Comb., 1990)

Fixed edge-length graph drawing is NP-hard. - Peter Eades; Nicholas C. Wormald (Discret. Appl. Math., 1990)

Asymptotic Enumeration by Degree Sequence of Graphs of High Degree. - Brendan D. McKay; Nicholas C. Wormald (Eur. J. Comb., 1990)

Uniform Generation of Random Regular Graphs of Moderate Degree. - Brendan D. McKay; Nicholas C. Wormald (J. Algorithms, 1990)

Removable edges in 3-connected graphs. - Derek A. Holton; Bill Jackson; Akira Saito; Nicholas C. Wormald (J. Graph Theory, 1990)

Cycles containing matchings and pairwise compatible euler tours. - Bill Jackson; Nicholas C. Wormald (J. Graph Theory, 1990)

On the Distribution of Lengths of Evolutionary Trees. - M. Carter; Michael D. Hendy; David Penny; László A. Székely; Nicholas C. Wormald (SIAM J. Discret. Math., 1990)

Asymptotic enumeration by degree sequence of graphs with degress o(n1/2). - Brendan D. McKay; Nicholas C. Wormald (Comb., 1991)

Sorting and/by Merging Finger Trees. - Alistair Moffat; Ola Petersson; Nicholas C. Wormald (ISAAC, 1992)

Random Graph Processes with Degree Restrictions. - Andrzej Rucinski 001; Nicholas C. Wormald (Comb. Probab. Comput., 1992)

Longest cycles in 3-connected planar graphs. - Bill Jackson; Nicholas C. Wormald (J. Comb. Theory B, 1992)

Enumeration of Almost-Convex Polygons on the Square Lattice. - Ian G. Enting; Anthony J. Guttmann; L. Bruce Richmond; Nicholas C. Wormald (Random Struct. Algorithms, 1992)

Almost All Cubic Graphs Are Hamiltonian. - Robert W. Robinson; Nicholas C. Wormald (Random Struct. Algorithms, 1992)

Graphs, Hypergraphs and Hashing. - George Havas; Bohdan S. Majewski; Nicholas C. Wormald; Zbigniew J. Czech (WG, 1993)

Performance Guarantees for Motion Planning with Temporal Uncertainty. - Peter Eades; Xuemin Lin 001; Nicholas C. Wormald (Aust. Comput. J., 1993)

Infinite highly arc transitive digraphs and universal covering digraphs. - Peter J. Cameron; Cheryl E. Praeger; Nicholas C. Wormald (Comb., 1993)

Edge Crossings in Drawings of Bipartite Graphs. - Peter Eades; Nicholas C. Wormald (Algorithmica, 1994)

Spanning eulerian subgraphs of bounded degree in triangulations. - Zhicheng Gao; Nicholas C. Wormald (Graphs Comb., 1994)

Almost All Regular Graphs Are Hamiltonian. - Robert W. Robinson; Nicholas C. Wormald (Random Struct. Algorithms, 1994)

Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs. - Bill Jackson; Nicholas C. Wormald (J. Comb. Theory B, 1995)

Almost All Maps Are Asymmetric. - L. Bruce Richmond; Nicholas C. Wormald (J. Comb. Theory B, 1995)

Largest 4-Connected Components of 3-Connected Planar Triangulations. - Edward A. Bender; L. Bruce Richmond; Nicholas C. Wormald (Random Struct. Algorithms, 1995)

A Family of Perfect Hashing Methods. - Bohdan S. Majewski; Nicholas C. Wormald; George Havas; Zbigniew J. Czech (Comput. J., 1996)

Reconstruction of Rooted Trees From Subtrees. - Meei Pyng Ng; Nicholas C. Wormald (Discret. Appl. Math., 1996)

On the linear k-arboricity of cubic graphs. - Bill Jackson; Nicholas C. Wormald (Discret. Math., 1996)

Generating and Counting Hamilton Cycles in Random Regular Graphs. - Alan M. Frieze; Mark Jerrum; Michael Molloy 001; Robert W. Robinson; Nicholas C. Wormald (J. Algorithms, 1996)

Minimal Steiner Trees for 2k×2k Square Lattices. - Marcus Brazil; T. Cole; J. Hyam Rubinstein; Doreen A. Thomas; Jia F. Weng; Nicholas C. Wormald (J. Comb. Theory A, 1996)

Sudden Emergence of a Giantk-Core in a Random Graph. - Boris G. Pittel; Joel Spencer; Nicholas C. Wormald (J. Comb. Theory B, 1996)

The perturbation method and triangle-free random graphs. - Nicholas C. Wormald (Random Struct. Algorithms, 1996)

Shortest networks on spheres. - Marcus Brazil; J. Hyam Rubinstein; Doreen A. Thomas; Jia F. Weng; Nicholas C. Wormald (Network Design: Connectivity and Facilities Location, 1997)

Minimal Steiner Trees for Rectangular Arrays of Lattice Points. - Marcus Brazil; J. Hyam Rubinstein; Doreen A. Thomas; Jia F. Weng; Nicholas C. Wormald (J. Comb. Theory A, 1997)

Full Minimal Steiner Trees on Lattice Sets. - Marcus Brazil; J. Hyam Rubinstein; Doreen A. Thomas; Jia F. Weng; Nicholas C. Wormald (J. Comb. Theory A, 1997)

Asymptotic Enumeration of Convex Polygons. - Dudley Stark; Nicholas C. Wormald (J. Comb. Theory A, 1997)

The degree sequence of a random graph. I. The models. - Brendan D. McKay; Nicholas C. Wormald (Random Struct. Algorithms, 1997)

1-Factorizations of random regular graphs. - Michael Molloy 001; Hanna D. Robalewska; Robert W. Robinson; Nicholas C. Wormald (Random Struct. Algorithms, 1997)

Steiner Trees for Terminals Constrained to Curves. - J. Hyam Rubinstein; Doreen A. Thomas; Nicholas C. Wormald (SIAM J. Discret. Math., 1997)

Geometric Separator Theorems & Applications. - Warren D. Smith; Nicholas C. Wormald (FOCS, 1998)

A Tree-Based Mergesort. - Alistair Moffat; Ola Petersson; Nicholas C. Wormald (Acta Informatica, 1998)

More on the linear k-arboricity of regular graphs. - Robert E. L. Aldred; Nicholas C. Wormald (Australas. J Comb., 1998)

Factorisation of regular graphs into forests of short paths. - Terri Lindquester; Nicholas C. Wormald (Discret. Math., 1998)

The Asymptotic Number of Set Partitions with Unequal Block Sizes. - Arnold Knopfmacher; Andrew M. Odlyzko; Boris G. Pittel; L. Bruce Richmond; Dudley Stark; George Szekeres; Nicholas C. Wormald (Electron. J. Comb., 1999)

Generating Random Regular Graphs Quickly. - Angelika Steger; Nicholas C. Wormald (Comb. Probab. Comput., 1999)

The Size of the Largest Components in Random Planar Maps. - Zhicheng Gao; Nicholas C. Wormald (SIAM J. Discret. Math., 1999)

Maximum Induced Matchings of Random Cubic Graphs. - William Duckworth; Nicholas C. Wormald; Michele Zito 001 (COCOON, 2000)

Covering regular graphs with forests of small trees. - Hilda Assiyatun; Nicholas C. Wormald (Australas. J Comb., 2000)

Random Star Processes. - Hanna D. Robalewska; Nicholas C. Wormald (Comb. Probab. Comput., 2000)

The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees. - Meei Pyng Ng; Mike A. Steel; Nicholas C. Wormald (Discret. Appl. Math., 2000)

The asymptotic number of graphs with a restriction on the maximum degree. - Brendan D. McKay; Ian M. Wanless; Nicholas C. Wormald (Electron. Notes Discret. Math., 2000)

The Distribution of the Maximum Vertex Degree in Random Planar Maps. - Zhicheng Gao; Nicholas C. Wormald (J. Comb. Theory A, 2000)

Linear Arboricity and Linear k-Arboricity of Regular Graphs. - Noga Alon; Vanessa Teague; Nicholas C. Wormald (Graphs Comb., 2001)

Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs. - Jeong Han Kim; Nicholas C. Wormald (J. Comb. Theory B, 2001)

Regular Graphs with No Homomorphisms onto Cycles. - Ian M. Wanless; Nicholas C. Wormald (J. Comb. Theory B, 2001)

Gradient-constrained minimum networks. I. Fundamentals. - Marcus Brazil; J. Hyam Rubinstein; Doreen A. Thomas; Jia F. Weng; Nicholas C. Wormald (J. Glob. Optim., 2001)

Counting 5-connected planar triangulations. - Zhicheng Gao; Ian M. Wanless; Nicholas C. Wormald (J. Graph Theory, 2001)

A polynomial algorithm for a constrained traveling salesman problem. - J. Hyam Rubinstein; Doreen A. Thomas; Nicholas C. Wormald (Networks, 2001)

Random regular graphs of high degree. - Michael Krivelevich; Benny Sudakov; Van H. Vu; Nicholas C. Wormald (Random Struct. Algorithms, 2001)

Hamilton cycles containing randomly selected edges in random regular graphs. - Robert W. Robinson; Nicholas C. Wormald (Random Struct. Algorithms, 2001)

Bisection of Random Cubic Graphs. - Josep Díaz; Norman Do; Maria J. Serna; Nicholas C. Wormald (RANDOM, 2002)

The Number of Labeled 2-Connected Planar Graphs. - Edward A. Bender; Zhicheng Gao; Nicholas C. Wormald (Electron. J. Comb., 2002)

Permutation Pseudographs And Contiguity. - Catherine S. Greenhill; Svante Janson; Jeong Han Kim; Nicholas C. Wormald (Comb. Probab. Comput., 2002)

Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. - Brendan D. McKay; Ian M. Wanless; Nicholas C. Wormald (Comb. Probab. Comput., 2002)

Decycling numbers of random regular graphs. - Sheng Bau; Nicholas C. Wormald; Sanming Zhou (Random Struct. Algorithms, 2002)

Minimum independent dominating sets of random cubic graphs. - William Duckworth; Nicholas C. Wormald (Random Struct. Algorithms, 2002)

Analytic Graph Theory. - Béla Bollobás; Vladimir Nikiforov 001; Nicholas C. Wormald; Ralph J. Faudree; Alan M. Frieze (Handbook of Graph Theory, 2003)

Sharp Concentration of the Number of Submaps in Random Planar Triangulations. - Zhicheng Gao; Nicholas C. Wormald (Comb., 2003)

Connectedness Of The Degree Bounded Star Process. - Catherine S. Greenhill; Andrzej Rucinski 001; Nicholas C. Wormald (Comb. Probab. Comput., 2003)

Analysis of greedy algorithms on graphs with bounded degrees. - Nicholas C. Wormald (Discret. Math., 2003)

Enumeration of P 4-Free Chordal Graphs. - Robert Castelo; Nicholas C. Wormald (Graphs Comb., 2003)

Asymptotic enumeration of sparse graphs with a minimum degree constraint. - Boris G. Pittel; Nicholas C. Wormald (J. Comb. Theory A, 2003)

A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. - William Duckworth; Nicholas C. Wormald; Michele Zito 001 (J. Discrete Algorithms, 2003)

On the probability of independent sets in random graphs. - Michael Krivelevich; Benny Sudakov; Van H. Vu; Nicholas C. Wormald (Random Struct. Algorithms, 2003)

Bounds on the max and min bisection of random cubic and random 4-regular graphs. - Josep Díaz; Norman Do; Maria J. Serna; Nicholas C. Wormald (Theor. Comput. Sci., 2003)

Computation of the Bisection Width for Random d-Regular Graphs. - Josep Díaz; Maria J. Serna; Nicholas C. Wormald (LATIN, 2004)

Short Cycles in Random Regular Graphs. - Brendan D. McKay; Nicholas C. Wormald; Beata Wysocka (Electron. J. Comb., 2004)

Random Hypergraph Processes with Degree Restrictions. - Catherine S. Greenhill; Andrzej Rucinski 001; Nicholas C. Wormald (Graphs Comb., 2004)

To Adrian Bondy and U. S. R. Murty. - William H. Cunningham; Penny E. Haxell; R. Bruce Richter; Nicholas C. Wormald; Andrew Thomason 001 (J. Comb. Theory B, 2004)

Hamiltonian decompositions of random bipartite regular graphs. - Catherine S. Greenhill; Jeong Han Kim; Nicholas C. Wormald (J. Comb. Theory B, 2004)

Avoidance of a giant component in half the edge set of a random graph. - Tom Bohman; Alan M. Frieze; Nicholas C. Wormald (Random Struct. Algorithms, 2004)

Connectivity for Wireless Agents Moving on a Cycle or Grid. - Josep Díaz; Xavier Pérez-Giménez; Maria J. Serna; Nicholas C. Wormald (STACS, 2005)

Random k-Sat: A Tight Threshold For Moderately Growing k. - Alan M. Frieze; Nicholas C. Wormald (Comb., 2005)

Counting connected graphs inside-out. - Boris G. Pittel; Nicholas C. Wormald (J. Comb. Theory B, 2005)

The acyclic edge chromatic number of a random d-regular graph is d + 1. - Jaroslav Nesetril; Nicholas C. Wormald (J. Graph Theory, 2005)

Analysis of Algorithms on the Cores of Random Graphs. - Nicholas C. Wormald (APPROX-RANDOM, 2006)

Encores on Cores. - Julie Cain; Nicholas C. Wormald (Electron. J. Comb., 2006)

On the Independent Domination Number of Random Regular Graphs. - William Duckworth; Nicholas C. Wormald (Comb. Probab. Comput., 2006)

3-star factors in random d-regular graphs. - Hilda Assiyatun; Nicholas C. Wormald (Eur. J. Comb., 2006)

Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees. - J. Hyam Rubinstein; Jia F. Weng; Nicholas C. Wormald (J. Glob. Optim., 2006)

The generalized acyclic edge chromatic number of random regular graphs. - Stefanie Gerke; Catherine S. Greenhill; Nicholas C. Wormald (J. Graph Theory, 2006)

Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm. - Margaret-Ellen Messinger; Pawel Pralat; Richard J. Nowakowski; Nicholas C. Wormald (CAAN, 2007)

The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation. - Julie Anne Cain; Peter Sanders 001; Nicholas C. Wormald (SODA, 2007)

Constrained Path Optimisation for Underground Mine Layout. - Marcus Brazil; Peter Alexander Grossman; David H. Lee; J. Hyam Rubinstein; Doreen A. Thomas; Nicholas C. Wormald (World Congress on Engineering, 2007)

Birth control for giants. - Joel H. Spencer; Nicholas C. Wormald (Comb., 2007)

Colouring Random 4-Regular Graphs. - Lingsheng Shi; Nicholas C. Wormald (Comb. Probab. Comput., 2007)

Colouring Random Regular Graphs. - Lingsheng Shi; Nicholas C. Wormald (Comb. Probab. Comput., 2007)

Growing Protean Graphs. - Pawel Pralat; Nicholas C. Wormald (Internet Math., 2007)

Network modelling of underground mine layout: two case studies. - Doreen A. Thomas; Marcus Brazil; David H. Lee; Nicholas C. Wormald (Int. Trans. Oper. Res., 2007)

Large independent sets in regular graphs of large girth. - Joseph Lauer; Nicholas C. Wormald (J. Comb. Theory B, 2007)

Rainbow Hamilton cycles in random regular graphs. - Svante Janson; Nicholas C. Wormald (Random Struct. Algorithms, 2007)

Hamiltonicity of random graphs produced by 2-processes. - András Telcs; Nicholas C. Wormald; Sanming Zhou (Random Struct. Algorithms, 2007)

Bounds on the bisection width for random d -regular graphs. - Josep Díaz; Maria J. Serna; Nicholas C. Wormald (Theor. Comput. Sci., 2007)

Induced Forests in Regular Graphs with Large Girth. - Carlos Hoppen; Nicholas C. Wormald (Comb. Probab. Comput., 2008)

Large forbidden trade volumes and edge packings of random graphs. - Nicholas C. Wormald; Sanming Zhou (Discret. Math., 2008)

Expansion properties of a random regular graph after random vertex deletions. - Catherine S. Greenhill; Fred B. Holt; Nicholas C. Wormald (Eur. J. Comb., 2008)

Corrigendum to "Counting connected graphs inside-out" [J. Combin. Theory Ser. B 93 (2005) 127-172]. - Boris G. Pittel; Nicholas C. Wormald (J. Comb. Theory B, 2008)

Distribution of subgraphs of random regular graphs. - Zhicheng Gao; Nicholas C. Wormald (Random Struct. Algorithms, 2008)

Cleaning Regular Graphs with Brushes. - Noga Alon; Pawel Pralat; Nicholas C. Wormald (SIAM J. Discret. Math., 2008)

Walkers on the Cycle and the Grid. - Josep Díaz; Xavier Pérez-Giménez; Maria J. Serna; Nicholas C. Wormald (SIAM J. Discret. Math., 2008)

Representing Small Group Evolution. - Whitman Richards; Nicholas C. Wormald (CSE (4), 2009)

Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging. - Pu Gao; Nicholas C. Wormald (Electron. J. Comb., 2009)

On the chromatic number of a random 5-regular graph. - Josep Díaz; Alexis C. Kaporis; G. D. Kemkes; Lefteris M. Kirousis; Xavier Pérez-Giménez; Nicholas C. Wormald (J. Graph Theory, 2009)

Short cycle distribution in random regular graphs recursively generated by pegging. - Pu Gao; Nicholas C. Wormald (Random Struct. Algorithms, 2009)

Load balancing and orientability thresholds for random hypergraphs. - Pu Gao; Nicholas C. Wormald (STOC, 2010)

Asymptotics of Some Convolutional Recurrences. - Edward A. Bender; Adri B. Olde Daalhuis; Zhicheng Gao; L. Bruce Richmond; Nicholas C. Wormald (Electron. J. Comb., 2010)

Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs. - William Duckworth; Nicholas C. Wormald (Electron. J. Comb., 2010)

The Diameter of Sparse Random Graphs. - Oliver Riordan; Nicholas C. Wormald (Comb. Probab. Comput., 2010)

On the threshold for k-regular subgraphs of random graphs. - Pawel Pralat; Jacques Verstraëte; Nicholas C. Wormald (Comb., 2011)

Pegging Graphs Yields a Small Diameter. - Stefanie Gerke; Angelika Steger; Nicholas C. Wormald (Comb. Probab. Comput., 2011)

Geodesics and almost geodesic cycles in random regular graphs. - Itai Benjamini; Carlos Hoppen; Eran Ofek; Pawel Pralat; Nicholas C. Wormald (J. Graph Theory, 2011)

Disjoint Hamilton cycles in the random geometric graph. - Tobias Müller 001; Xavier Pérez-Giménez; Nicholas C. Wormald (J. Graph Theory, 2011)

Regular induced subgraphs of a random Graph. - Michael Krivelevich; Benny Sudakov; Nicholas C. Wormald (Random Struct. Algorithms, 2011)

Induced subgraphs in sparse random graphs with given degree sequences. - Pu Gao; Yi Su; Nicholas C. Wormald (Eur. J. Comb., 2012)

Cores of random r-partite hypergraphs. - Fabiano C. Botelho; Nicholas C. Wormald; Nivio Ziviani (Inf. Process. Lett., 2012)

Gradient-Constrained Minimum Networks. III. Fixed Topology. - Marcus Brazil; J. Hyam Rubinstein; Doreen A. Thomas; Jia F. Weng; Nicholas C. Wormald (J. Optim. Theory Appl., 2012)

On the Stretch Factor of Randomly Embedded Random Graphs. - Abbas Mehrabian; Nick Wormald (Discret. Comput. Geom., 2013)

On the Longest Paths and the Diameter in Random Apollonian Networks. - Ehsan Ebrahimzadeh; Linda Farczadi; Pu Gao; Abbas Mehrabian; Cristiane M. Sato; Nick Wormald; Jonathan Zung (Electron. Notes Discret. Math., 2013)

Asymptotic enumeration of sparse 2-connected graphs. - Graeme Kemkes; Cristiane M. Sato; Nicholas C. Wormald (Random Struct. Algorithms, 2013)

Asymptotic enumeration of strongly connected digraphs by vertices and edges. - Xavier Pérez-Giménez; Nicholas C. Wormald (Random Struct. Algorithms, 2013)

An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph. - Graeme Kemkes; Nicholas C. Wormald (SIAM J. Discret. Math., 2013)

On the push&pull protocol for rumour spreading. - Hüseyin Acan; Andrea Collevecchio; Abbas Mehrabian; Nick Wormald (CoRR, 2014)

The evolution and structure of social networks. - Whitman Richards; Nicholas C. Wormald (Netw. Sci., 2014)

The mixing time of the giant component of a random graph. - Itai Benjamini; Gady Kozma; Nicholas C. Wormald (Random Struct. Algorithms, 2014)

On longest paths and diameter in random apollonian network. - Ehsan Ebrahimzadeh; Linda Farczadi; Pu Gao; Abbas Mehrabian; Cristiane M. Sato; Nick Wormald; Jonathan Zung (Random Struct. Algorithms, 2014)

Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs. - Brett Kolesnik; Nick Wormald (SIAM J. Discret. Math., 2014)

On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract]. - Hüseyin Acan; Andrea Collevecchio; Abbas Mehrabian; Nick Wormald (PODC, 2015)

Orientability Thresholds for Random Hypergraphs. - Pu Gao; Nicholas C. Wormald (Comb. Probab. Comput., 2015)

It's a Small World for Random Surfers. - Abbas Mehrabian; Nick Wormald (Algorithmica, 2016)

Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees. - Andrea Collevecchio; Abbas Mehrabian; Nick Wormald (J. Appl. Probab., 2016)

Properties of regular graphs with large girth via local algorithms. - Carlos Hoppen; Nicholas C. Wormald (J. Comb. Theory B, 2016)

The threshold for combs in random graphs. - Jeff Kahn 001; Eyal Lubetzky; Nicholas C. Wormald (Random Struct. Algorithms, 2016)

Meyniel's conjecture holds for random graphs. - Pawel Pralat; Nicholas C. Wormald (Random Struct. Algorithms, 2016)

Minimum Power Dominating Sets of Random Cubic Graphs. - Liying Kang; Nicholas C. Wormald (J. Graph Theory, 2017)

Uniform Generation of Random Regular Graphs. - Pu Gao; Nicholas C. Wormald (SIAM J. Comput., 2017)

On the Push&Pull Protocol for Rumor Spreading. - Hüseyin Acan; Andrea Collevecchio; Abbas Mehrabian; Nick Wormald (SIAM J. Discret. Math., 2017)

Uniform generation of random graphs with power-law degree sequences. - Pu Gao; Nicholas C. Wormald (SODA, 2018)

Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs. - Carlos Hoppen; Nicholas C. Wormald (Comb., 2018)

The Number of Satisfying Assignments of Random Regular k-SAT Formulas. - Amin Coja-Oghlan; Nick Wormald (Comb. Probab. Comput., 2018)

The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph. - Dudley Stark; Nick Wormald (Comb. Probab. Comput., 2018)

A Limit Theorem for the Six-length of Random Functional Graphs with a Fixed Degree Sequence. - Kevin Leckey; Nick Wormald (Electron. J. Comb., 2019)

Meyniel's conjecture holds for random d-regular graphs. - Pawel Pralat; Nicholas C. Wormald (Random Struct. Algorithms, 2019)

On Finding the Optimal Tree of a Complete Weighted Graph. - Seyed Soheil Hosseini; Nick Wormald; Tianhai Tian (FedCSIS, 2020)

Optimal Tree of a Complete Weighted Graph. - Seyed Soheil Hosseini; Nick Wormald; Tianhai Tian (WCO@FedCSIS, 2020)

Almost all 5-regular graphs have a 3-flow. - Pawel Pralat; Nick Wormald (J. Graph Theory, 2020)

The height of depth-weighted random recursive trees. - Kevin Leckey; Dieter Mitsche; Nick Wormald (Random Struct. Algorithms, 2020)

Linear-time uniform generation of random sparse contingency tables with specified marginals. - Andrii Arman; Pu Gao; Nicholas C. Wormald (CoRR, 2021)

Full rainbow matchings in graphs and hypergraphs. - Pu Gao; Reshma Ramadurai; Ian M. Wanless; Nick Wormald (Comb. Probab. Comput., 2021)

Fast uniform generation of random graphs with given degree sequences. - Andrii Arman; Pu Gao; Nicholas C. Wormald (Random Struct. Algorithms, 2021)

Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. - Daniel Allendorf; Ulrich Meyer 001; Manuel Penschuck; Hung Tran; Nick Wormald (ALENEX, 2022)

Semi-labeled unrooted binary tree optimization subject to nonnegativity. - Seyed Soheil Hosseini; Nick Wormald (Networks, 2022)

Component Games on Random Graphs. - Rani Hod; Michael Krivelevich; Tobias Müller 001; Alon Naor; Nicholas C. Wormald (Comb., 2022)

Asymptotic enumeration of digraphs and bipartite graphs by degree sequence. - Anita Liebenau; Nick Wormald (Random Struct. Algorithms, 2023)

Large induced subgraphs of random graphs with given degree sequences. - Angus Southwell; Nick Wormald (Random Struct. Algorithms, 2025)