Nicholas C. Wormald

Publication Activity (10 Years)

Years Active: 1977-2022
Publications (10 Years): 14

Top Venues

Random Struct. Algorithms

CoRR

Comb.

FOCS

Publications

Rani Hod, Michael Krivelevich, Tobias Müller, Alon Naor, Nicholas C. Wormald
Component Games on Random Graphs. Comb. 42 (6) (2022)
Andrii Arman, Pu Gao, Nicholas C. Wormald
Fast uniform generation of random graphs with given degree sequences. Random Struct. Algorithms 59 (3) (2021)
Andrii Arman, Pu Gao, Nicholas C. Wormald
Linear-time uniform generation of random sparse contingency tables with specified marginals. CoRR (2021)
Andrii Arman, Pu Gao, Nicholas C. Wormald
Fast Uniform Generation of Random Graphs with Given Degree Sequences. FOCS (2019)
Pawel Pralat, Nicholas C. Wormald
Meyniel's conjecture holds for random d-regular graphs. Random Struct. Algorithms 55 (3) (2019)
Andrii Arman, Pu Gao, Nicholas C. Wormald
Fast uniform generation of random graphs with given degree sequences. CoRR (2019)
Carlos Hoppen, Nicholas C. Wormald
Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs. Comb. 38 (3) (2018)
Pu Gao, Nicholas C. Wormald
Uniform generation of random graphs with power-law degree sequences. SODA (2018)
Pu Gao, Nicholas C. Wormald
Uniform Generation of Random Regular Graphs. SIAM J. Comput. 46 (4) (2017)
Liying Kang, Nicholas C. Wormald
Minimum Power Dominating Sets of Random Cubic Graphs. J. Graph Theory 85 (1) (2017)
Pu Gao, Nicholas C. Wormald
Uniform generation of random graphs with power-law degree sequences. CoRR (2017)
Pawel Pralat, Nicholas C. Wormald
Meyniel's conjecture holds for random graphs. Random Struct. Algorithms 48 (2) (2016)
Carlos Hoppen, Nicholas C. Wormald
Properties of regular graphs with large girth via local algorithms. J. Comb. Theory, Ser. B 121 (2016)
Jeff Kahn, Eyal Lubetzky, Nicholas C. Wormald
The threshold for combs in random graphs. Random Struct. Algorithms 48 (4) (2016)
Pu Gao, Nicholas C. Wormald
Orientability Thresholds for Random Hypergraphs. Comb. Probab. Comput. 24 (5) (2015)
Pu Gao, Nicholas C. Wormald
Uniform Generation of Random Regular Graphs. FOCS (2015)
Pu Gao, Nicholas C. Wormald
Uniform generation of random regular graphs. CoRR (2015)
Itai Benjamini, Gady Kozma, Nicholas C. Wormald
The mixing time of the giant component of a random graph. Random Struct. Algorithms 45 (3) (2014)
Whitman Richards, Nicholas C. Wormald
The evolution and structure of social networks. Netw. Sci. 2 (3) (2014)
Graeme Kemkes, Cristiane M. Sato, Nicholas C. Wormald
Asymptotic enumeration of sparse 2-connected graphs. Random Struct. Algorithms 43 (3) (2013)
Xavier Pérez-Giménez, Nicholas C. Wormald
Asymptotic enumeration of strongly connected digraphs by vertices and edges. Random Struct. Algorithms 43 (1) (2013)
Graeme Kemkes, Nicholas C. Wormald
An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph. SIAM J. Discret. Math. 27 (1) (2013)
Pu Gao, Yi Su, Nicholas C. Wormald
Induced subgraphs in sparse random graphs with given degree sequences. Eur. J. Comb. 33 (6) (2012)
Fabiano C. Botelho, Nicholas C. Wormald, Nivio Ziviani
Cores of random r-partite hypergraphs. Inf. Process. Lett. 112 (8-9) (2012)
Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald
Gradient-Constrained Minimum Networks. III. Fixed Topology. J. Optim. Theory Appl. 155 (1) (2012)
Itai Benjamini, Carlos Hoppen, Eran Ofek, Pawel Pralat, Nicholas C. Wormald
Geodesics and almost geodesic cycles in random regular graphs. J. Graph Theory 66 (2) (2011)
Pawel Pralat, Jacques Verstraëte, Nicholas C. Wormald
On the threshold for k-regular subgraphs of random graphs. Comb. 31 (5) (2011)
Stefanie Gerke, Angelika Steger, Nicholas C. Wormald
Pegging Graphs Yields a Small Diameter. Comb. Probab. Comput. 20 (2) (2011)
Tobias Müller, Xavier Pérez-Giménez, Nicholas C. Wormald
Disjoint Hamilton cycles in the random geometric graph. J. Graph Theory 68 (4) (2011)
Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald
Regular induced subgraphs of a random Graph. Random Struct. Algorithms 38 (3) (2011)
Pu Gao, Nicholas C. Wormald
Orientability thresholds for random hypergraphs CoRR (2010)
Pu Gao, Nicholas C. Wormald
Load balancing and orientability thresholds for random hypergraphs. STOC (2010)
Oliver Riordan, Nicholas C. Wormald
The Diameter of Sparse Random Graphs. Comb. Probab. Comput. 19 (5-6) (2010)
William Duckworth, Nicholas C. Wormald
Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs. Electron. J. Comb. 17 (1) (2010)
Edward A. Bender, Adri B. Olde Daalhuis, Zhicheng Gao, L. Bruce Richmond, Nicholas C. Wormald
Asymptotics of Some Convolutional Recurrences. Electron. J. Comb. 17 (1) (2010)
Pu Gao, Nicholas C. Wormald
Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging. Electron. J. Comb. 16 (1) (2009)
Whitman Richards, Nicholas C. Wormald
Representing Small Group Evolution. CSE (4) (2009)
Pu Gao, Nicholas C. Wormald
Short cycle distribution in random regular graphs recursively generated by pegging. Random Struct. Algorithms 34 (1) (2009)
Josep Díaz, Alexis C. Kaporis, G. D. Kemkes, Lefteris M. Kirousis, Xavier Pérez, Nicholas C. Wormald
On the chromatic number of a random 5-regular graph. J. Graph Theory 61 (3) (2009)
Noga Alon, Pawel Pralat, Nicholas C. Wormald
Cleaning Regular Graphs with Brushes. SIAM J. Discret. Math. 23 (1) (2008)
Zhicheng Gao, Nicholas C. Wormald
Distribution of subgraphs of random regular graphs. Random Struct. Algorithms 32 (1) (2008)
Boris G. Pittel, Nicholas C. Wormald
Corrigendum to "Counting connected graphs inside-out" [J. Combin. Theory Ser. B 93 (2005) 127-172]. J. Comb. Theory, Ser. B 98 (4) (2008)
Nicholas C. Wormald, Sanming Zhou
Large forbidden trade volumes and edge packings of random graphs. Discret. Math. 308 (13) (2008)
Catherine S. Greenhill, Fred B. Holt, Nicholas C. Wormald
Expansion properties of a random regular graph after random vertex deletions. Eur. J. Comb. 29 (5) (2008)
Carlos Hoppen, Nicholas C. Wormald
Induced Forests in Regular Graphs with Large Girth. Comb. Probab. Comput. 17 (3) (2008)
Josep Díaz, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald
Walkers on the Cycle and the Grid. SIAM J. Discret. Math. 22 (2) (2008)
Marcus Brazil, Peter Alexander Grossman, David H. Lee, J. Hyam Rubinstein, Doreen A. Thomas, Nicholas C. Wormald
Constrained Path Optimisation for Underground Mine Layout. World Congress on Engineering (2007)
Pawel Pralat, Nicholas C. Wormald
Growing Protean Graphs. Internet Math. 4 (1) (2007)
András Telcs, Nicholas C. Wormald, Sanming Zhou
Hamiltonicity of random graphs produced by 2-processes. Random Struct. Algorithms 31 (4) (2007)
Svante Janson, Nicholas C. Wormald
Rainbow Hamilton cycles in random regular graphs. Random Struct. Algorithms 30 (1-2) (2007)
Joseph Lauer, Nicholas C. Wormald
Large independent sets in regular graphs of large girth. J. Comb. Theory, Ser. B 97 (6) (2007)
Lingsheng Shi, Nicholas C. Wormald
Colouring Random Regular Graphs. Comb. Probab. Comput. 16 (3) (2007)
Josep Díaz, Maria J. Serna, Nicholas C. Wormald
Bounds on the bisection width for random d -regular graphs. Theor. Comput. Sci. 382 (2) (2007)
Julie Anne Cain, Peter Sanders, Nicholas C. Wormald
-orientiability and a fast algorithm for optimal multiple-choice allocation. SODA (2007)
Margaret-Ellen Messinger, Pawel Pralat, Richard J. Nowakowski, Nicholas C. Wormald
-Regular Graphs with Brushes Using a Degree-Greedy Algorithm. CAAN (2007)
Doreen A. Thomas, Marcus Brazil, David H. Lee, Nicholas C. Wormald
Network modelling of underground mine layout: two case studies. Int. Trans. Oper. Res. 14 (2) (2007)
Lingsheng Shi, Nicholas C. Wormald
Colouring Random 4-Regular Graphs. Comb. Probab. Comput. 16 (2) (2007)
Joel H. Spencer, Nicholas C. Wormald
Birth control for giants. Comb. 27 (5) (2007)
Julie Cain, Nicholas C. Wormald
Encores on Cores. Electron. J. Comb. 13 (1) (2006)
Hilda Assiyatun, Nicholas C. Wormald
-regular graphs. Eur. J. Comb. 27 (8) (2006)
William Duckworth, Nicholas C. Wormald
On the Independent Domination Number of Random Regular Graphs. Comb. Probab. Comput. 15 (4) (2006)
J. Hyam Rubinstein, Jia F. Weng, Nicholas C. Wormald
Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees. J. Glob. Optim. 35 (4) (2006)
Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald
The generalized acyclic edge chromatic number of random regular graphs. J. Graph Theory 53 (2) (2006)
Nicholas C. Wormald
Analysis of Algorithms on the Cores of Random Graphs. APPROX-RANDOM (2006)
Boris G. Pittel, Nicholas C. Wormald
Counting connected graphs inside-out. J. Comb. Theory, Ser. B 93 (2) (2005)
Jaroslav Nesetril, Nicholas C. Wormald
+ 1. J. Graph Theory 49 (1) (2005)
Josep Díaz, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald
Connectivity for Wireless Agents Moving on a Cycle or Grid. STACS (2005)
Alan M. Frieze, Nicholas C. Wormald
. Comb. 25 (3) (2005)
Tom Bohman, Alan M. Frieze, Nicholas C. Wormald
Avoidance of a giant component in half the edge set of a random graph. Random Struct. Algorithms 25 (4) (2004)
Brendan D. McKay, Nicholas C. Wormald, Beata Wysocka
Short Cycles in Random Regular Graphs. Electron. J. Comb. 11 (1) (2004)
William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason
To Adrian Bondy and U. S. R. Murty. J. Comb. Theory, Ser. B 90 (1) (2004)
Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
Random Hypergraph Processes with Degree Restrictions. Graphs Comb. 20 (3) (2004)
Josep Díaz, Maria J. Serna, Nicholas C. Wormald
Computation of the Bisection Width for Random d-Regular Graphs. LATIN (2004)
Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald
Hamiltonian decompositions of random bipartite regular graphs. J. Comb. Theory, Ser. B 90 (2) (2004)
Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
On the probability of independent sets in random graphs. Random Struct. Algorithms 22 (1) (2003)
Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
Connectedness Of The Degree Bounded Star Process. Comb. Probab. Comput. 12 (3) (2003)
Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald
Bounds on the max and min bisection of random cubic and random 4-regular graphs. Theor. Comput. Sci. 307 (3) (2003)
William Duckworth, Nicholas C. Wormald, Michele Zito
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. J. Discrete Algorithms 1 (1) (2003)
Robert Castelo, Nicholas C. Wormald
-Free Chordal Graphs. Graphs Comb. 19 (4) (2003)
Nicholas C. Wormald
Analysis of greedy algorithms on graphs with bounded degrees. Discret. Math. 273 (1-3) (2003)
Boris G. Pittel, Nicholas C. Wormald
Asymptotic enumeration of sparse graphs with a minimum degree constraint. J. Comb. Theory, Ser. A 101 (2) (2003)
Zhicheng Gao, Nicholas C. Wormald
Sharp Concentration of the Number of Submaps in Random Planar Triangulations. Comb. 23 (3) (2003)
Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald
Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. Comb. Probab. Comput. 11 (4) (2002)
Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald
Bisection of Random Cubic Graphs. RANDOM (2002)
Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald
Permutation Pseudographs And Contiguity. Comb. Probab. Comput. 11 (3) (2002)
Edward A. Bender, Zhicheng Gao, Nicholas C. Wormald
The Number of Labeled 2-Connected Planar Graphs. Electron. J. Comb. 9 (1) (2002)
William Duckworth, Nicholas C. Wormald
Minimum independent dominating sets of random cubic graphs. Random Struct. Algorithms 21 (2) (2002)
Sheng Bau, Nicholas C. Wormald, Sanming Zhou
Decycling numbers of random regular graphs. Random Struct. Algorithms 21 (3-4) (2002)
Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald
Gradient-constrained minimum networks. I. Fundamentals. J. Glob. Optim. 21 (2) (2001)
Zhicheng Gao, Ian M. Wanless, Nicholas C. Wormald
Counting 5-connected planar triangulations. J. Graph Theory 38 (1) (2001)
Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
Random regular graphs of high degree. Random Struct. Algorithms 18 (4) (2001)
Robert W. Robinson, Nicholas C. Wormald
Hamilton cycles containing randomly selected edges in random regular graphs. Random Struct. Algorithms 19 (2) (2001)
J. Hyam Rubinstein, Doreen A. Thomas, Nicholas C. Wormald
A polynomial algorithm for a constrained traveling salesman problem. Networks 38 (2) (2001)
Ian M. Wanless, Nicholas C. Wormald
Regular Graphs with No Homomorphisms onto Cycles. J. Comb. Theory, Ser. B 82 (1) (2001)
Jeong Han Kim, Nicholas C. Wormald
Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs. J. Comb. Theory, Ser. B 81 (1) (2001)
Noga Alon, Vanessa Teague, Nicholas C. Wormald
Linear Arboricity and Linear k-Arboricity of Regular Graphs. Graphs Comb. 17 (1) (2001)
Zhicheng Gao, Nicholas C. Wormald
The Distribution of the Maximum Vertex Degree in Random Planar Maps. J. Comb. Theory, Ser. A 89 (2) (2000)
William Duckworth, Nicholas C. Wormald, Michele Zito
Maximum Induced Matchings of Random Cubic Graphs. COCOON (2000)
Hilda Assiyatun, Nicholas C. Wormald
Covering regular graphs with forests of small trees. Australas. J Comb. 22 (2000)
Hanna D. Robalewska, Nicholas C. Wormald
Random Star Processes. Comb. Probab. Comput. 9 (1) (2000)

Nicholas C. Wormald.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nicholas C. Wormald