Nicholas C. Wormald

According to our database1, Nicholas C. Wormald
  • authored at least 173 papers between 1977 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
On the Push&Pull Protocol for Rumor Spreading.
SIAM J. Discrete Math., 2017

Uniform Generation of Random Regular Graphs.
SIAM J. Comput., 2017

Minimum Power Dominating Sets of Random Cubic Graphs.
Journal of Graph Theory, 2017

Uniform generation of random graphs with power-law degree sequences.
CoRR, 2017

2016
Meyniel's conjecture holds for random graphs.
Random Struct. Algorithms, 2016

The threshold for combs in random graphs.
Random Struct. Algorithms, 2016

Properties of regular graphs with large girth via local algorithms.
J. Comb. Theory, Ser. B, 2016

Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees.
J. Applied Probability, 2016

The number of satisfying assignments of random regular k-SAT formulas.
CoRR, 2016

It's a Small World for Random Surfers.
Algorithmica, 2016

2015
Orientability Thresholds for Random Hypergraphs.
Combinatorics, Probability & Computing, 2015

Uniform generation of random regular graphs.
CoRR, 2015

On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract].
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Uniform Generation of Random Regular Graphs.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs.
SIAM J. Discrete Math., 2014

On longest paths and diameter in random apollonian network.
Random Struct. Algorithms, 2014

The mixing time of the giant component of a random graph.
Random Struct. Algorithms, 2014

It's a Small World for Random Surfers.
CoRR, 2014

On the push&pull protocol for rumour spreading.
CoRR, 2014

It's a Small World for Random Surfers.
Proceedings of the Approximation, 2014

2013
An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph.
SIAM J. Discrete Math., 2013

Asymptotic enumeration of strongly connected digraphs by vertices and edges.
Random Struct. Algorithms, 2013

Asymptotic enumeration of sparse 2-connected graphs.
Random Struct. Algorithms, 2013

On the Longest Paths and the Diameter in Random Apollonian Networks.
Electronic Notes in Discrete Mathematics, 2013

On the Stretch Factor of Randomly Embedded Random Graphs.
Discrete & Computational Geometry, 2013

2012
Gradient-Constrained Minimum Networks. III. Fixed Topology.
J. Optimization Theory and Applications, 2012

Cores of random r-partite hypergraphs.
Inf. Process. Lett., 2012

Induced subgraphs in sparse random graphs with given degree sequences.
Eur. J. Comb., 2012

On the Stretch Factor of Randomly Embedded Random Graphs
CoRR, 2012

2011
Regular induced subgraphs of a random Graph.
Random Struct. Algorithms, 2011

Disjoint Hamilton cycles in the random geometric graph.
Journal of Graph Theory, 2011

Geodesics and almost geodesic cycles in random regular graphs.
Journal of Graph Theory, 2011

Pegging Graphs Yields a Small Diameter.
Combinatorics, Probability & Computing, 2011

On the threshold for k-regular subgraphs of random graphs.
Combinatorica, 2011

2010
The Diameter of Sparse Random Graphs.
Combinatorics, Probability & Computing, 2010

Orientability thresholds for random hypergraphs
CoRR, 2010

Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs.
Electr. J. Comb., 2010

Asymptotics of Some Convolutional Recurrences.
Electr. J. Comb., 2010

Load balancing and orientability thresholds for random hypergraphs.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009
Short cycle distribution in random regular graphs recursively generated by pegging.
Random Struct. Algorithms, 2009

On the chromatic number of a random 5-regular graph.
Journal of Graph Theory, 2009

Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging.
Electr. J. Comb., 2009

Representing Small Group Evolution.
Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, 2009

2008
Walkers on the Cycle and the Grid.
SIAM J. Discrete Math., 2008

Cleaning Regular Graphs with Brushes.
SIAM J. Discrete Math., 2008

Distribution of subgraphs of random regular graphs.
Random Struct. Algorithms, 2008

Corrigendum to "Counting connected graphs inside-out" [J. Combin. Theory Ser. B 93 (2005) 127-172].
J. Comb. Theory, Ser. B, 2008

Expansion properties of a random regular graph after random vertex deletions.
Eur. J. Comb., 2008

Large forbidden trade volumes and edge packings of random graphs.
Discrete Mathematics, 2008

Induced Forests in Regular Graphs with Large Girth.
Combinatorics, Probability & Computing, 2008

2007
Bounds on the bisection width for random d -regular graphs.
Theor. Comput. Sci., 2007

Hamiltonicity of random graphs produced by 2-processes.
Random Struct. Algorithms, 2007

Rainbow Hamilton cycles in random regular graphs.
Random Struct. Algorithms, 2007

Large independent sets in regular graphs of large girth.
J. Comb. Theory, Ser. B, 2007

Network modelling of underground mine layout: two case studies.
ITOR, 2007

Growing Protean Graphs.
Internet Mathematics, 2007

Colouring Random Regular Graphs.
Combinatorics, Probability & Computing, 2007

Colouring Random 4-Regular Graphs.
Combinatorics, Probability & Computing, 2007

Birth control for giants.
Combinatorica, 2007

Constrained Path Optimisation for Underground Mine Layout.
Proceedings of the World Congress on Engineering, 2007

The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006
The generalized acyclic edge chromatic number of random regular graphs.
Journal of Graph Theory, 2006

Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees.
J. Global Optimization, 2006

3-star factors in random d-regular graphs.
Eur. J. Comb., 2006

On the Independent Domination Number of Random Regular Graphs.
Combinatorics, Probability & Computing, 2006

Encores on Cores.
Electr. J. Comb., 2006

Analysis of Algorithms on the Cores of Random Graphs.
Proceedings of the Approximation, 2006

2005
The acyclic edge chromatic number of a random d-regular graph is d + 1.
Journal of Graph Theory, 2005

Counting connected graphs inside-out.
J. Comb. Theory, Ser. B, 2005

Random k-Sat: A Tight Threshold For Moderately Growing k.
Combinatorica, 2005

Connectivity for Wireless Agents Moving on a Cycle or Grid.
Proceedings of the STACS 2005, 2005

2004
Avoidance of a giant component in half the edge set of a random graph.
Random Struct. Algorithms, 2004

Hamiltonian decompositions of random bipartite regular graphs.
J. Comb. Theory, Ser. B, 2004

To Adrian Bondy and U. S. R. Murty.
J. Comb. Theory, Ser. B, 2004

Random Hypergraph Processes with Degree Restrictions.
Graphs and Combinatorics, 2004

Short Cycles in Random Regular Graphs.
Electr. J. Comb., 2004

Computation of the Bisection Width for Random d-Regular Graphs.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
Bounds on the max and min bisection of random cubic and random 4-regular graphs.
Theor. Comput. Sci., 2003

On the probability of independent sets in random graphs.
Random Struct. Algorithms, 2003

A PTAS for the sparsest 2-spanner of 4-connected planar triangulations.
J. Discrete Algorithms, 2003

Asymptotic enumeration of sparse graphs with a minimum degree constraint.
J. Comb. Theory, Ser. A, 2003

Enumeration of P 4-Free Chordal Graphs.
Graphs and Combinatorics, 2003

Analysis of greedy algorithms on graphs with bounded degrees.
Discrete Mathematics, 2003

Connectedness Of The Degree Bounded Star Process.
Combinatorics, Probability & Computing, 2003

Sharp Concentration of the Number of Submaps in Random Planar Triangulations.
Combinatorica, 2003

2002
Minimum independent dominating sets of random cubic graphs.
Random Struct. Algorithms, 2002

Decycling numbers of random regular graphs.
Random Struct. Algorithms, 2002

Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree.
Combinatorics, Probability & Computing, 2002

Permutation Pseudographs And Contiguity.
Combinatorics, Probability & Computing, 2002

The Number of Labeled 2-Connected Planar Graphs.
Electr. J. Comb., 2002

Bisection of Random Cubic Graphs.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

2001
Hamilton cycles containing randomly selected edges in random regular graphs.
Random Struct. Algorithms, 2001

Random regular graphs of high degree.
Random Struct. Algorithms, 2001

A polynomial algorithm for a constrained traveling salesman problem.
Networks, 2001

Counting 5-connected planar triangulations.
Journal of Graph Theory, 2001

Gradient-constrained minimum networks. I. Fundamentals.
J. Global Optimization, 2001

Regular Graphs with No Homomorphisms onto Cycles.
J. Comb. Theory, Ser. B, 2001

Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs.
J. Comb. Theory, Ser. B, 2001

Linear Arboricity and Linear k-Arboricity of Regular Graphs.
Graphs and Combinatorics, 2001

2000
The Distribution of the Maximum Vertex Degree in Random Planar Maps.
J. Comb. Theory, Ser. A, 2000

The asymptotic number of graphs with a restriction on the maximum degree.
Electronic Notes in Discrete Mathematics, 2000

The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees.
Discrete Applied Mathematics, 2000

Random Star Processes.
Combinatorics, Probability & Computing, 2000

Covering regular graphs with forests of small trees.
Australasian J. Combinatorics, 2000

Maximum Induced Matchings of Random Cubic Graphs.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
The Size of the Largest Components in Random Planar Maps.
SIAM J. Discrete Math., 1999

Generating Random Regular Graphs Quickly.
Combinatorics, Probability & Computing, 1999

The Asymptotic Number of Set Partitions with Unequal Block Sizes.
Electr. J. Comb., 1999

1998
Factorisation of regular graphs into forests of short paths.
Discrete Mathematics, 1998

More on the linear k-arboricity of regular graphs.
Australasian J. Combinatorics, 1998

A Tree-Based Mergesort.
Acta Inf., 1998

Geometric Separator Theorems & Applications.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Steiner Trees for Terminals Constrained to Curves.
SIAM J. Discrete Math., 1997

1-Factorizations of random regular graphs.
Random Struct. Algorithms, 1997

The degree sequence of a random graph. I. The models.
Random Struct. Algorithms, 1997

Asymptotic Enumeration of Convex Polygons.
J. Comb. Theory, Ser. A, 1997

Full Minimal Steiner Trees on Lattice Sets.
J. Comb. Theory, Ser. A, 1997

Minimal Steiner Trees for Rectangular Arrays of Lattice Points.
J. Comb. Theory, Ser. A, 1997

Shortest networks on spheres.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1996
The perturbation method and triangle-free random graphs.
Random Struct. Algorithms, 1996

Sudden Emergence of a Giantk-Core in a Random Graph.
J. Comb. Theory, Ser. B, 1996

Minimal Steiner Trees for 2k×2k Square Lattices.
J. Comb. Theory, Ser. A, 1996

Generating and Counting Hamilton Cycles in Random Regular Graphs.
J. Algorithms, 1996

On the linear k-arboricity of cubic graphs.
Discrete Mathematics, 1996

Reconstruction of Rooted Trees From Subtrees.
Discrete Applied Mathematics, 1996

A Family of Perfect Hashing Methods.
Comput. J., 1996

1995
Largest 4-Connected Components of 3-Connected Planar Triangulations.
Random Struct. Algorithms, 1995

Almost All Maps Are Asymmetric.
J. Comb. Theory, Ser. B, 1995

Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs.
J. Comb. Theory, Ser. B, 1995

1994
Almost All Regular Graphs Are Hamiltonian.
Random Struct. Algorithms, 1994

Spanning eulerian subgraphs of bounded degree in triangulations.
Graphs and Combinatorics, 1994

Edge Crossings in Drawings of Bipartite Graphs.
Algorithmica, 1994

1993
Infinite highly arc transitive digraphs and universal covering digraphs.
Combinatorica, 1993

Performance Guarantees for Motion Planning with Temporal Uncertainty.
Australian Computer Journal, 1993

Graphs, Hypergraphs and Hashing.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992
Almost All Cubic Graphs Are Hamiltonian.
Random Struct. Algorithms, 1992

Enumeration of Almost-Convex Polygons on the Square Lattice.
Random Struct. Algorithms, 1992

Longest cycles in 3-connected planar graphs.
J. Comb. Theory, Ser. B, 1992

Random Graph Processes with Degree Restrictions.
Combinatorics, Probability & Computing, 1992

Sorting and/by Merging Finger Trees.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991
Asymptotic enumeration by degree sequence of graphs with degress o(n1/2).
Combinatorica, 1991

1990
On the Distribution of Lengths of Evolutionary Trees.
SIAM J. Discrete Math., 1990

Cycles containing matchings and pairwise compatible euler tours.
Journal of Graph Theory, 1990

Removable edges in 3-connected graphs.
Journal of Graph Theory, 1990

Uniform Generation of Random Regular Graphs of Moderate Degree.
J. Algorithms, 1990

Asymptotic Enumeration by Degree Sequence of Graphs of High Degree.
Eur. J. Comb., 1990

Fixed edge-length graph drawing is NP-hard.
Discrete Applied Mathematics, 1990

k-walks of graphs.
Australasian J. Combinatorics, 1990

1989
Bounds on the measurable chromatic number of Rn.
Discrete Mathematics, 1989

1988
The asymptotic number of rooted nonseparable maps on a surface.
J. Comb. Theory, Ser. A, 1988

Random Triangulations of the Plane.
Eur. J. Comb., 1988

1987
Generating Random Unlabelled Graphs.
SIAM J. Comput., 1987

Ménage numbers, bijections and P-recursiveness.
Discrete Mathematics, 1987

Optimal Worst Case Trees.
Acta Inf., 1987

1986
Extremal clique coverings of complementary graphs.
Combinatorica, 1986

The asymptotic number of acyclic diagraphs I.
Combinatorica, 1986

1985
Enumeration of cyclically 4-connected cubic graphs.
Journal of Graph Theory, 1985

Cataloguing the graphs on 10 vertices.
Journal of Graph Theory, 1985

Regular factors of regular graphs.
Journal of Graph Theory, 1985

Counting labelled chordal graphs.
Graphs and Combinatorics, 1985

The number of loopless planar maps.
Discrete Mathematics, 1985

1984
Isomorphic factorizations VII. Regular graphs and tournaments.
Journal of Graph Theory, 1984

Generating Random Regular Graphs.
J. Algorithms, 1984

Automorphisms of random graphs with specified vertices.
Combinatorica, 1984

1983
Numbers of cubic graphs.
Journal of Graph Theory, 1983

1981
Counting the 10-point graphs by partition.
Journal of Graph Theory, 1981

Counting unrooted planar maps.
Discrete Mathematics, 1981

1980
Number of labeled 4-regular graphs.
Journal of Graph Theory, 1980

1979
The exponential generating function of labelled blocks.
Discrete Mathematics, 1979

1978
Achiral plane trees.
Journal of Graph Theory, 1978

1977
Counting labelled 3-connected graphs.
Journal of Graph Theory, 1977

The divisibility theorem for isomorphic factorizations of complete graphs.
Journal of Graph Theory, 1977


  Loading...