Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
N. C. Wormald
Observed names:
N C Wormald,
N WORMALD,
N. C. WORMALD,
N. Wormald,
N.C Wormald,
N.C. Wormald
show all 6
Institution:
University of Waterloo
Observed institutions:
Louisiana State University,
Australian Research Council,
University of Waterloo,
University of Auckland,
The University of Melbourne,
Vanderbilt University,
Goldsmiths University of London,
Adam Mickiewicz University in Poznań,
University of Newcastle Australia
show all 9
OpenAlex ID:
A5114010170
Models of Random Regular Graphs
1999
·
N. C. Wormald
·
Cambridge University Press eBooks
·
598
Generating Random Regular Graphs Quickly
1999
·
A. STEGER
, N. C. WORMALD
·
Combinatorics Probability Computing
·
234
Almost all regular graphs are hamiltonian
1994
·
R. W. Robinson
, N. C. Wormald
·
Random Structures and Algorithms
·
203
Almost all cubic graphs are Hamiltonian
1992
·
R. W. Robinson
, N. C. Wormald
·
Random Structures and Algorithms
·
151
Geometric separator theorems and applications
2002
·
W.D. Smith
, N.C. Wormald
·
Annual Symposium on Foundations of Computer Science
·
100
Random Graph Processes with Degree Restrictions
1992
·
A. Ruciński
, N. C. Wormald
·
Combinatorics Probability Computing
·
96
Almost All Maps Are Asymmetric
1995
·
L.B. Richmond
, N.C. Wormald
·
Journal of Combinatorial Theory Series B
·
57
On the number of spiral self-avoiding walks
1984
·
A J Guttmann
, N C Wormald
·
Journal of Physics A Mathematical and General
·
51
PDF
Almost all chordal graphs split
1985
·
E. A. Bender
, L. B. Richmond
, et al.
·
Journal of the Australian Mathematical Society Series A Pure Mathematics and Statistics
·
47
PDF
Regular factors of regular graphs
1985
·
B. Bollobás
, Akira Saito
, et al.
·
Journal of Graph Theory
·
47
1‐Factorizations of random regular graphs
1997
·
M. S. O. Molloy
, H. Robalewska
, et al.
·
Random Structures and Algorithms
·
44
On the Distribution of Lengths of Evolutionary Trees
1990
·
M. Carter
, M. Hendy
, et al.
·
SIAM Journal on Discrete Mathematics
·
43
Linear Arboricity and Linear k-Arboricity of Regular Graphs
2001
·
Noga Alon
, V. J. Teague
, et al.
·
Graphs and Combinatorics
·
40
Optimising declines in underground mines
2003
·
M. Brazil
, D. H. Lee
, et al.
·
Mining Technology Transactions of the Institutions of Mining and Metallurgy
·
35
Automorphisms of random graphs with specified vertices
1984
·
B. D. McKay
, N. C. Wormald
·
COMBINATORICA
·
33
Bounds on the bisection width for random d -regular graphs
2007
·
J. Díaz
, M.J. Serna
, et al.
·
Theoretical Computer Science
·
31
PDF
Minimum independent dominating sets of random cubic graphs
2002
·
W. Duckworth
, N. C. Wormald
·
Random Structures and Algorithms
·
31
On the Independent Domination Number of Random Regular Graphs
2006
·
W. DUCKWORTH
, N. C. WORMALD
·
Combinatorics Probability Computing
·
30
Bounds on the max and min bisection of random cubic and random 4-regular graphs
2003
·
J. Dı́az
, N. Do
, et al.
·
Theoretical Computer Science
·
30
PDF
Decline design in underground mines using constrained path optimisation
2008
·
M. Brazil
, P. A. Grossman
, et al.
·
Mining Technology Transactions of the Institutions of Mining and Metallurgy
·
27
The asymptotic number of acyclic digraphs. I
1986
·
E. A. Bender
, L. B. Richmond
, et al.
·
COMBINATORICA
·
26
Gradient-constrained minimum networks. I. Fundamentals
2001
·
M. Brazil
, J.H. Rubinstein
, et al.
·
Journal of Global Optimization
·
24
Steiner Trees for Terminals Constrained to Curves
1997
·
J. H. Rubinstein
, D. A. Thomas
, et al.
·
SIAM Journal on Discrete Mathematics
·
24
Numbers of cubic graphs
1983
·
R. W. Robinson
, N. C. Wormald
·
Journal of Graph Theory
·
24
Cataloguing the graphs on 10 vertices
1985
·
R. D. Cameron
, C. J. Colbourn
, et al.
·
Journal of Graph Theory
·
20
Show more works
View as search
Works count:
60
Citation count:
2,398
H-index:
24
I10-index:
42
Year
Topic
Type
