Nick Wormald

Q: What Schools Are Affiliated With Nick Wormald

Nick Wormald is affiliated with the following schools: University of Waterloo, University of Newcastle , University of Melbourne, University of Auckland, Monash University

Nick Wormald's AcademicInfluence.com Rankings

Nick Wormald

Mathematics

#4162

World Rank

#5970

Historical Rank

Combinatorics

#57

World Rank

#64

Historical Rank

Graph Theory

#64

World Rank

#71

Historical Rank

Measure Theory

#1347

World Rank

#1695

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Nick Wormald Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Nicholas Charles Wormald is an Australian mathematician and professor of mathematics at Monash University. He specializes in probabilistic combinatorics, graph theory, graph algorithms, Steiner trees, web graphss, mine optimization, and other areas in combinatorics.

(See a Problem?)

Nick Wormald's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Surveys in Combinatorics, 1999: Models of Random Regular Graphs (1999) (474)
Models of random regular graphs (2010) (444)
Differential Equations for Random Processes and Random Graphs (1995) (412)
Sudden Emergence of a Giantk-Core in a Random Graph (1996) (408)
The differential equation method for random graph processes and greedy algorithms (1999) (291)
Edge crossings in drawings of bipartite graphs (1994) (233)
Generating Random Regular Graphs Quickly (1999) (229)
Almost All Regular Graphs Are Hamiltonian (1994) (223)
Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) (1991) (213)
Uniform Generation of Random Regular Graphs of Moderate Degree (1990) (165)
Almost All Cubic Graphs Are Hamiltonian (1992) (163)
Some problems in the enumeration of labelled graphs (1980) (146)
The asymptotic distribution of short cycles in random regular graphs (1981) (145)
Asymptotic Enumeration by Degree Sequence of Graphs of High Degree (1990) (130)
Short Cycles in Random Regular Graphs (2004) (118)
Random regular graphs of high degree (2001) (117)
The asymptotic connectivity of labelled regular graphs (1981) (114)
Birth control for giants (2007) (106)
A Family of Perfect Hashing Methods (1996) (105)
Random Graph Processes with Degree Restrictions (1992) (101)
Counting connected graphs inside-out (2005) (101)
Reconstruction of Rooted Trees From Subtrees (1996) (93)
On an edge crossing problem (1986) (87)
Geometric separator theorems and applications (1998) (86)
K-walks of Graphs (1990) (82)
On the hardness of sampling independent sets beyond the tree threshold (2007) (82)
The Number of Labeled 2-Connected Planar Graphs (2002) (79)
The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation (2007) (70)
Branching and tree indexed random walks on fractals (1999) (70)
Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs (2001) (69)
The mixing time of the giant component of a random graph (2006) (68)
Almost All Maps Are Asymmetric (1995) (61)
Generating and Counting Hamilton Cycles in Random Regular Graphs (1996) (60)
Infinite highly arc transitive digraphs and universal covering digraphs (1993) (60)
Fixed edge-length graph drawing is NP-hard (1990) (59)
Random k-Sat: A Tight Threshold For Moderately Growing k (2005) (59)
Avoidance of a giant component in half the edge set of a random graph (2004) (56)
Isomorphic factorisations. I. Complete graphs (1978) (53)
The Distribution of the Maximum Vertex Degree in Random Planar Maps (2000) (49)
The degree sequence of a random graph. I. The models (1997) (48)
Analysis of greedy algorithms on graphs with bounded degrees (2003) (48)
1-Factorizations of random regular graphs (1997) (48)
A 4-chromatic graph with a special plane drawing (1979) (47)
Encores on Cores (2006) (46)
On the Distribution of Lengths of Evolutionary Trees (1990) (45)
On the Independent Domination Number of Random Regular Graphs (2006) (43)
Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph (2017) (42)
Linear Arboricity and Linear k-Arboricity of Regular Graphs (2001) (42)
Large independent sets in regular graphs of large girth (2007) (41)
The acyclic edge chromatic number of a random d‐regular graph is d + 1 (2005) (41)
The asymptotic number of acyclic digraphs. I (1986) (40)
On the number of spiral self-avoiding walks (1984) (40)
Decycling numbers of random regular graphs (2002) (38)
Cleaning Regular Graphs with Brushes (2008) (38)
The exponent set of symmetric primitive (0, 1) matrices with zero trace (1990) (37)
Regular factors of regular graphs (1985) (36)
Optimising declines in underground mines (2003) (35)
The Size of the Largest Components in Random Planar Maps (1999) (35)
Uniform Generation of Random Regular Graphs (2015) (35)
Asymptotic enumeration of sparse graphs with a minimum degree constraint (2003) (34)
Counting unrooted planar maps (1981) (34)
The acyclic edge chromatic number of a random d-regular graph is d + 1 (2005) (34)
Automorphisms of random graphs with specified vertices (1984) (34)
Almost all chordal graphs split (1985) (34)
Minimum independent dominating sets of random cubic graphs (2002) (34)
Load balancing and orientability thresholds for random hypergraphs (2010) (33)
Bounds on the bisection width for random d -regular graphs (2007) (33)
Generating Random Regular Graphs (1984) (32)
Classifying K-connected cubic graphs (1979) (31)
Permutation Pseudographs and Contiguity (2002) (31)
More on the linear k-arboricity of regular graphs (1998) (31)
Longest cycles in 3-connected planar graphs (1992) (30)
Gradient-constrained minimum networks. I. Fundamentals (2001) (30)
On the Push&Pull Protocol for Rumor Spreading (2017) (29)
Bounds on the measurable chromatic number of Rn (1989) (29)
Removable edges in 3-connected graphs (1990) (29)
Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs (2013) (28)
Numbers of cubic graphs (1983) (28)
Asymptotic normality determined by high moments, and submap counts of random maps (2004) (28)
Colouring Random 4-Regular Graphs (2007) (27)
Counting labelled chordal graphs (1985) (27)
The asymptotic number of rooted nonseparable maps on a surface (1988) (27)
Enumeration of graphs with a heavy-tailed degree sequence (2014) (26)
Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity (1979) (25)
Steiner Trees for Terminals Constrained to Curves (1997) (25)
Graphs, Hypergraphs and Hashing (1993) (25)
Bounds on the max and min bisection of random cubic and random 4-regular graphs (2003) (24)
Generating Random Unlabelled Graphs (1987) (24)
Random graphs and asymptotics (2004) (24)
Generating functions for the Frobenius Problem with 2 and 3 generators (1986) (24)
Connectedness of graphs generated by a random d-process (2002) (23)
Cataloguing the graphs on 10 vertices (1985) (23)
Random Triangulations of the Plane (1988) (23)
Embedding oriented n-trees in tournaments (1984) (23)
On the linear k-arboricity of cubic graphs (1996) (23)
Rainbow Hamilton cycles in random regular graphs (2005) (23)
On the Tumber of Planar Maps (1981) (23)
Meyniel's conjecture holds for random graphs (2013) (23)
Network optimisation of underground mine design (2001) (23)
The number of loopless planar maps (1985) (22)
Performance Guarantees for Motion Planning with Temporal Uncertainty (1993) (22)
Small hypohamiltonian graphs (1997) (22)
Isomorphic factorisations III: Complete multipartite graphs (1978) (21)
On the probability of independent sets in random graphs (2003) (21)
Existence of long cycles in random cubic graphs (1984) (21)
The Number of Rooted Convex Polyhedra (1988) (21)
THE ASYMPTOTIC NUMBER OF CONVEX POLYHEDRA (1982) (21)
Enumeration of Rooted Cubic Planar Maps (2002) (21)
Growing Protean Graphs (2007) (20)
Sharp Concentration of the Number of Submaps in Random Planar Triangulations (2003) (19)
Minimal Steiner Trees for Rectangular Arrays of Lattice Points (1997) (19)
Distribution of subgraphs of random regular graphs (2008) (19)
Fast Uniform Generation of Random Graphs with Given Degree Sequences (2019) (19)
Disjoint Hamilton cycles in the random geometric graph (2009) (19)
Almost all Convex Polyhedra are Asymmetric (1985) (19)
On the chromatic number of random d-regular graphs (2008) (19)
ASYMPTOTIC ENUMERATION OF GRAPHS WITH GIVEN DEGREE SEQUENCE (2019) (18)
Subtrees of large tournaments (1983) (18)
Largest 4-Connected Components of 3-Connected Planar Triangulations (1995) (18)
Number of labeled 4-regular graphs (1980) (18)
Optimisation in the design of underground mine access (2004) (18)
Regular Graphs with No Homomorphisms onto Cycles (2001) (18)
RANDOM GRAPH PROCESSES WITH MAXIMUM DEGREE 2 (1997) (18)
High Degree Graphs Contain Large-Star Factors (2008) (17)
Minimal Steiner Trees for 2k×2k Square Lattices (1996) (17)
Constrained Path Optimisation for Underground Mine Layout (2007) (17)
Hamiltonicity of random graphs produced by 2‐processes (2007) (17)
Uniform generation of random graphs with power-law degree sequences (2017) (17)
Enumeration of Labelled Graphs I: 3-Connected Graphs (1979) (16)
The threshold for combs in random graphs (2014) (16)
The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees (2000) (16)
Geometric Separator Theorems & Applications (1998) (16)
A network model to optimise cost in underground mine design (2002) (16)
Cycles containing matchings and pairwise compatible euler tours (1990) (16)
On Hamilton Cycles in 3-Connected Cubic Maps (1985) (15)
Representing Small Group Evolution (2009) (15)
Maximum Induced Matchings of Random Cubic Graphs (2000) (15)
The perturbation method and triangle-free random graphs (1996) (14)
Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs (2013) (14)
The Number of Satisfying Assignments of Random Regular k-SAT Formulas (2016) (14)
Induced Forests in Regular Graphs with Large Girth (2007) (14)
On the threshold for k-regular subgraphs of random graphs (2007) (14)
Full Minimal Steiner Trees on Lattice Sets (1997) (14)
Cores of random r-partite hypergraphs (2012) (14)
Geodesics and almost geodesic cycles in random regular graphs (2006) (13)
Asymptotic properties of rooted 3-connected maps on surfaces (1996) (13)
Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs (1988) (13)
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm (2007) (13)
3-star Factors in Random D-regular Graphs (2006) (13)
Expansion properties of a random regular graph after random vertex deletions (2007) (13)
Colouring Random Regular Graphs (2007) (13)
Isomorphic factorisations V: Directed graphs (1978) (13)
Computation of the Bisection Width for Random d-Regular Graphs (2004) (13)
Hamilton cycles containing randomly selected edges in random regular graphs (2001) (12)
Asymptotic enumeration of strongly connected digraphs by vertices and edges (2010) (12)
On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract] (2014) (12)
Random Star Processes (2000) (12)
Network modelling of underground mine layout: two case studies (2007) (12)
Properties of regular graphs with large girth via local algorithms (2016) (11)
Isomorphic factorizations VII. Regular graphs and tournaments (1984) (11)
The generalized acyclic edge chromatic number of random regular graphs (2006) (11)
Walkers on the Cycle and the Grid (2008) (11)
Extremal clique coverings of complementary graphs (1986) (11)
Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs (2010) (11)
The Asymptotic Number of Set Partitions with Unequal Block Sizes (1998) (11)
A Tree-based Mergesort (1998) (11)
Uniform generation of random Latin rectangles (1991) (11)
Full rainbow matchings in graphs and hypergraphs (2017) (11)
On the frequency of 3-connected subgraphs of planar graphs (1986) (11)
The exponential generating function of labelled blocks (1979) (10)
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations (2003) (10)
On the chromatic number of a random 5‐regular graph (2009) (10)
Random Hypergraph Processes with Degree Restrictions (2004) (10)
On longest paths and diameter in random apollonian networks (2014) (10)
Tournaments with many Hamilton cycles (10)
Enumeration of Almost-Convex Polygons on the Square Lattice (1992) (10)
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence (2020) (9)
Spanning eulerian subgraphs of bounded degree in triangulations (1994) (9)
The Diameter of Sparse Random Graphs (2008) (9)
An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph (2009) (9)
Sorting and/by Merging Finger Trees (1992) (9)
On the Longest Paths and the Diameter in Random Apollonian Networks (2013) (9)
On the number of automorphisms of a regular graph (1979) (8)
Longest cycles in 3-connected graphs of bounded maximum degree (1992) (8)
Enumeration of P4-Free Chordal Graphs (2003) (8)
Random trees in random graphs (1988) (8)
Regular induced subgraphs of a random Graph (2008) (8)
Ménage numbers, bijections and P-recursiveness (1987) (8)
A correspondence for rooted planar maps (1980) (8)
Hamiltonian decompositions of random bipartite regular graphs (2004) (8)
Counting 5‐connected planar triangulations (2001) (8)
Cycle Factors and Renewal Theory (2014) (7)
A remark on the construction of designs for two-way elimination of heterogeneity (1976) (7)
Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees (2006) (7)
Corrigendum to "Counting connected graphs inside-out" [J. Combin. Theory Ser. B 93 (2005) 127-172] (2008) (7)
A simpler proof of the asymptotic formula for the number of unlabelled $r$-regular graphs (1986) (7)
Hamilton-like indices of graphs (1983) (7)
Asymptotics of Some Convolutional Recurrences (2010) (7)
A Weight-based Information Filtration Algorithm for Stock-correlation Networks (2019) (7)
Short cycle distribution in random regular graphs recursively generated by pegging (2009) (6)
ON THE NUMBER OF PLANAR MAPS (2007) (6)
On the Stretch Factor of Randomly Embedded Random Graphs (2012) (6)
Approximation algorithms for finding sparse 2-Spanners of 4-Connected planar triangulations (1999) (6)
Enumeration of cyclically 4-connected cubic graphs (1985) (6)
Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees (2014) (6)
It’s a Small World for Random Surfers (2014) (6)
Shortest networks on spheres (1997) (6)
Access Optimisation Tools in Underground Mine Design (2009) (6)
ON THE NUMBER OF PLANAR MAPS (2007) (6)
Further analysis of an adaptive sorting algorithm (1992) (6)
Enumeration of Unrooted Odd-Valent Regular Planar Maps (2009) (5)
Orientability Thresholds for Random Hypergraphs (2010) (5)
Counting the 10-point graphs by partition (1981) (5)
Bisection of Random Cubic Graphs (2002) (5)
Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree (2002) (5)
Nonexistence of certain supplementary difference sets (1975) (5)
Meyniel's conjecture holds for random d‐regular graphs (2015) (5)
Connectivity for Wireless Agents Moving on a Cycle or Grid (2005) (5)
Minimum Power Dominating Sets of Random Cubic Graphs (2017) (5)
Triangles in labelled cubic graphs (1978) (5)
Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs (1995) (5)
The divisibility theorem for isomorphic factorizations of complete graphs (1977) (5)
Induced subgraphs in sparse random graphs with given degree sequences (2010) (5)
The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph (2016) (5)
Regular graphs with prescribed odd girth (1983) (4)
On the degree distribution of a growing network model (2014) (3)
Factorisation of regular graphs into forests of short paths (1998) (3)
Almost all 5‐regular graphs have a 3‐flow (2015) (3)
A polynomial algorithm for a constrained traveling salesman problem (2001) (3)
The number of labelled cubic graphs with no triangles (1981) (3)
Hamiltonicity of random graphs produced by 2-processes (2007) (3)
Asymptotic enumeration of sparse connected 3-uniform hypergraphs (2014) (3)
Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging (2009) (3)
Connectedness of the Degree Bounded Star Process (2003) (3)
Counting 5-connected planar triangulations (2001) (2)
Gradient-Constrained Minimum Networks. III. Fixed Topology (2012) (2)
To Adrian Bondy and U. S. R. Murty (2004) (2)
Almost all quadrangular dissections of the disc are asymmetrical (1990) (2)
A note on asymptotic existence results for orthogonal designs (1977) (2)
The evolution and structure of social networks (2014) (2)
Asymptotic enumeration of sparse 2‐connected graphs (2010) (2)
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence (2021) (2)
The height of depth‐weighted random recursive trees (2020) (2)
Submaps of maps IV: Degree restricted nonplanar maps (1993) (1)
Pegging Graphs Yields a Small Diameter (2010) (1)
Covering regular graphs with forests of small trees (2000) (1)
Bounds on the Measurable Chromatic Number of Rn: “Sight may distinguish of colours; but suddenly To nominate them all, 's impossible.” -W. Shakespeare, King Henry VZ, Part ZZ. (1989) (1)
Erratum: On the number of spiral self-avoiding walks (J. Phys. A: Math. Gen. (1984) 17 (L271-4)) (1984) (1)
Achiral plane trees (1978) (1)
Avoiding a Giant Component II (2002) (1)
Asymptotic Enumeration of Hypergraphs by Degree Sequence (2020) (1)
Asymptotic Enumeration of Convex Polygons (1997) (1)
Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs (2017) (1)
Component Games on Random Graphs (2020) (0)
Bridge and Cycle Degrees of Vertices of Graphs (1984) (0)
Large Forbidden Trade Volumes of Random Graphs (2004) (0)
High degree graphs contain large-star factors Dedicated to (2010) (0)
Large induced subgraphs of random graphs with given degree sequences (2023) (0)
Erratum: "Asymptotic enumeration of sparse graphs with a minimum degree constraint" (Journal of Combinatorial Theory, Series A (2003 vol. 101 (249-263)) (2003) (0)
Almost all 5-regular graphs have an edge orientation in which every out-degree is either 1 or 4 (2015) (0)
Analysis of Algorithms on the Cores of Random Graphs (2006) (0)
Proceeding of the Annual ACM-SIAM Symposium on Discrete Algorithms: Preface (2005) (0)
Counting labelled 3-connected graphs (1977) (0)
8.2 RANDOM GRAPHS AND ASYMPTOTICS (2004) (0)
Enumeration of rooted trees with a height distribution (1985) (0)
Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs (2018) (0)
Large forbidden trade volumes and edge packings of random graphs (2008) (0)
Semi‐labeled unrooted binary tree optimization subject to nonnegativity (2022) (0)
Analytic Graph Theory (2003) (0)
Full Minimal Steiner Trees on Lattice Sets 1 M . Brazil (1997) (0)
The asymptotic number of graphs with a restriction on the maximum degree (2000) (0)
PERFORMANCE GUARANTEES FOR A PLOTTER OPTIMIZATION HEURISTIC. (1987) (0)
On Finding the Optimal Tree of a Complete Weighted Graph (2020) (0)
Optimal worst case trees (1987) (0)
A Limit Theorem for the Six-length of Random Functional Graphs with a Fixed Degree Sequence (2018) (0)

This paper list is powered by the following services:

Other Resources About Nick Wormald

en.wikipedia.org

What Schools Are Affiliated With Nick Wormald?

Nick Wormald is affiliated with the following schools:

Nick Wormald's Academic­Influence.com Rankings

Why Is Nick Wormald Influential?

Nick Wormald's Published Works

Published Works

Other Resources About Nick Wormald

What Schools Are Affiliated With Nick Wormald?

Nick Wormald's AcademicInfluence.com Rankings