Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Nicholas C. Wormald
2010 – today
- 2013
[j115]Graeme Kemkes, Nicholas C. Wormald: An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph. SIAM J. Discrete Math. 27(1): 342-362 (2013)- 2012
- [j114]Pu Gao, Yi Su, Nicholas C. Wormald: Induced subgraphs in sparse random graphs with given degree sequences. Eur. J. Comb. 33(6): 1142-1166 (2012)
- [j113]Fabiano C. Botelho, Nicholas C. Wormald, Nivio Ziviani: Cores of random r-partite hypergraphs. Inf. Process. Lett. 112(8-9): 314-319 (2012)
- [j112]Marcus Brazil, J. H. Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald: Gradient-Constrained Minimum Networks. III. Fixed Topology. J. Optimization Theory and Applications 155(1): 336-354 (2012)
- 2011
- [j111]Pawel Pralat, Jacques Verstraëte, Nicholas C. Wormald: On the threshold for k-regular subgraphs of random graphs. Combinatorica 31(5): 565-581 (2011)
- [j110]Stefanie Gerke, Angelika Steger, Nicholas C. Wormald: Pegging Graphs Yields a Small Diameter. Combinatorics, Probability & Computing 20(2): 239-248 (2011)
- [j109]Itai Benjamini, Carlos Hoppen, Eran Ofek, Pawel Pralat, Nicholas C. Wormald: Geodesics and almost geodesic cycles in random regular graphs. Journal of Graph Theory 66(2): 115-136 (2011)
- [j108]Tobias Müller, Xavier Pérez-Giménez, Nicholas C. Wormald: Disjoint Hamilton cycles in the random geometric graph. Journal of Graph Theory 68(4): 299-322 (2011)
- [j107]Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald: Regular induced subgraphs of a random Graph. Random Struct. Algorithms 38(3): 235-250 (2011)
- 2010
- [j106]Edward A. Bender, Adri B. Olde Daalhuis, Zhicheng Gao, L. Bruce Richmond, Nicholas C. Wormald: Asymptotics of Some Convolutional Recurrences. Electr. J. Comb. 17(1) (2010)
- [j105]William Duckworth, Nicholas C. Wormald: Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs. Electr. J. Comb. 17(1) (2010)
- [j104]Oliver Riordan, Nicholas C. Wormald: The Diameter of Sparse Random Graphs. Combinatorics, Probability & Computing 19(5-6): 835-926 (2010)
- [c13]
- [i1]Pu Gao, Nicholas C. Wormald: Orientability thresholds for random hypergraphs. CoRR abs/1009.5489 (2010)
2000 – 2009
- 2009
- [j103]Pu Gao, Nicholas C. Wormald: Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging. Electr. J. Comb. 16(1) (2009)
- [j102]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. Journal of Graph Theory 61(3): 157-191 (2009)
- [j101]Pu Gao, Nicholas C. Wormald: Short cycle distribution in random regular graphs recursively generated by pegging. Random Struct. Algorithms 34(1): 54-86 (2009)
- [c12]
- 2008
- [j100]Carlos Hoppen, Nicholas C. Wormald: Induced Forests in Regular Graphs with Large Girth. Combinatorics, Probability & Computing 17(3): 389-410 (2008)
- [j99]Nicholas C. Wormald, Sanming Zhou: Large forbidden trade volumes and edge packings of random graphs. Discrete Mathematics 308(13): 2751-2755 (2008)
- [j98]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): 1139-1150 (2008)
- [j97]Boris 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): 835-837 (2008)
- [j96]Zhicheng Gao, Nicholas C. Wormald: Distribution of subgraphs of random regular graphs. Random Struct. Algorithms 32(1): 38-48 (2008)
- [j95]Josep Díaz, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald: Walkers on the Cycle and the Grid. SIAM J. Discrete Math. 22(2): 747-775 (2008)
- [j94]Noga Alon, Pawel Pralat, Nicholas C. Wormald: Cleaning Regular Graphs with Brushes. SIAM J. Discrete Math. 23(1): 233-250 (2008)
- 2007
- [j93]
- [j92]Lingsheng Shi, Nicholas C. Wormald: Colouring Random 4-Regular Graphs. Combinatorics, Probability & Computing 16(2): 309-344 (2007)
- [j91]Lingsheng Shi, Nicholas C. Wormald: Colouring Random Regular Graphs. Combinatorics, Probability & Computing 16(3): 459-494 (2007)
- [j90]
- [j89]Joseph Lauer, Nicholas C. Wormald: Large independent sets in regular graphs of large girth. J. Comb. Theory, Ser. B 97(6): 999-1009 (2007)
- [j88]Svante Janson, Nicholas C. Wormald: Rainbow Hamilton cycles in random regular graphs. Random Struct. Algorithms 30(1-2): 35-49 (2007)
- [j87]András Telcs, Nicholas C. Wormald, Sanming Zhou: Hamiltonicity of random graphs produced by 2-processes. Random Struct. Algorithms 31(4): 450-481 (2007)
- [j86]Josep Díaz, Maria J. Serna, Nicholas C. Wormald: Bounds on the bisection width for random d -regular graphs. Theor. Comput. Sci. 382(2): 120-130 (2007)
- [c11]Margaret-Ellen Messinger, Pawel Pralat, Richard J. Nowakowski, Nicholas C. Wormald: Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm. CAAN 2007: 13-26
- [c10]Julie Anne Cain, Peter Sanders, Nicholas C. Wormald: The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation. SODA 2007: 469-476
- [c9]Marcus Brazil, P. A. Grossman, D. H. Lee, J. H. Rubinstein, Doreen A. Thomas, Nicholas C. Wormald: Constrained Path Optimisation for Underground Mine Layout. World Congress on Engineering 2007: 856-861
- 2006
- [j85]
- [j84]William Duckworth, Nicholas C. Wormald: On the Independent Domination Number of Random Regular Graphs. Combinatorics, Probability & Computing 15(4): 513-522 (2006)
- [j83]Hilda Assiyatun, Nicholas C. Wormald: 3-star factors in random d-regular graphs. Eur. J. Comb. 27(8): 1249-1262 (2006)
- [j82]J. H. Rubinstein, Jia F. Weng, Nicholas C. Wormald: Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees. J. Global Optimization 35(4): 573-592 (2006)
- [j81]Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald: The generalized acyclic edge chromatic number of random regular graphs. Journal of Graph Theory 53(2): 101-125 (2006)
- [c8]
- 2005
- [j80]Alan M. Frieze, Nicholas C. Wormald: Random k-Sat: A Tight Threshold For Moderately Growing k. Combinatorica 25(3): 297-305 (2005)
- [j79]Boris Pittel, Nicholas C. Wormald: Counting connected graphs inside-out. J. Comb. Theory, Ser. B 93(2): 127-172 (2005)
- [j78]Jaroslav Nesetril, Nicholas C. Wormald: The acyclic edge chromatic number of a random d-regular graph is d + 1. Journal of Graph Theory 49(1): 69-74 (2005)
- [c7]Josep Díaz-Giménez, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald: Connectivity for Wireless Agents Moving on a Cycle or Grid. STACS 2005: 353-364
- 2004
- [j77]Brendan D. McKay, Nicholas C. Wormald, Beata Wysocka: Short Cycles in Random Regular Graphs. Electr. J. Comb. 11(1) (2004)
- [j76]Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald: Random Hypergraph Processes with Degree Restrictions. Graphs and Combinatorics 20(3): 319-332 (2004)
- [j75]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): 1 (2004)
- [j74]Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald: Hamiltonian decompositions of random bipartite regular graphs. J. Comb. Theory, Ser. B 90(2): 195-222 (2004)
- [j73]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): 432-449 (2004)
- [c6]Josep Díaz, Maria J. Serna, Nicholas C. Wormald: Computation of the Bisection Width for Random d-Regular Graphs. LATIN 2004: 49-58
- 2003
- [j72]Zhicheng Gao, Nicholas C. Wormald: Sharp Concentration of the Number of Submaps in Random Planar Triangulations. Combinatorica 23(3): 467-486 (2003)
- [j71]Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald: Connectedness Of The Degree Bounded Star Process. Combinatorics, Probability & Computing 12(3): 269-283 (2003)
- [j70]Nicholas C. Wormald: Analysis of greedy algorithms on graphs with bounded degrees. Discrete Mathematics 273(1-3): 235-260 (2003)
- [j69]Robert Castelo, Nicholas C. Wormald: Enumeration of P 4-Free Chordal Graphs. Graphs and Combinatorics 19(4): 467-474 (2003)
- [j68]Boris Pittel, Nicholas C. Wormald: Asymptotic enumeration of sparse graphs with a minimum degree constraint. J. Comb. Theory, Ser. A 101(2): 249-263 (2003)
- [j67]William Duckworth, Nicholas C. Wormald, Michele Zito: A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. J. Discrete Algorithms 1(1): 67-76 (2003)
- [j66]Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald: On the probability of independent sets in random graphs. Random Struct. Algorithms 22(1): 1-14 (2003)
- [j65]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): 531-547 (2003)
- 2002
- [j64]Edward A. Bender, Zhicheng Gao, Nicholas C. Wormald: The Number of Labeled 2-Connected Planar Graphs. Electr. J. Comb. 9(1) (2002)
- [j63]Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald: Permutation Pseudographs And Contiguity. Combinatorics, Probability & Computing 11(3): 273-298 (2002)
- [j62]Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald: Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. Combinatorics, Probability & Computing 11(4): 373-392 (2002)
- [j61]William Duckworth, Nicholas C. Wormald: Minimum independent dominating sets of random cubic graphs. Random Struct. Algorithms 21(2): 147-161 (2002)
- [j60]Sheng Bau, Nicholas C. Wormald, Sanming Zhou: Decycling numbers of random regular graphs. Random Struct. Algorithms 21(3-4): 397-413 (2002)
- [c5]Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald: Bisection of Random Cubic Graphs. RANDOM 2002: 114-125
- 2001
- [j59]Noga Alon, Vanessa Teague, Nicholas C. Wormald: Linear Arboricity and Linear k-Arboricity of Regular Graphs. Graphs and Combinatorics 17(1): 11-16 (2001)
- [j58]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): 20-44 (2001)
- [j57]Ian M. Wanless, Nicholas C. Wormald: Regular Graphs with No Homomorphisms onto Cycles. J. Comb. Theory, Ser. B 82(1): 155-160 (2001)
- [j56]Zhicheng Gao, Ian M. Wanless, Nicholas C. Wormald: Counting 5-connected planar triangulations. Journal of Graph Theory 38(1): 18-35 (2001)
- [j55]J. H. Rubinstein, Doreen A. Thomas, Nicholas C. Wormald: A polynomial algorithm for a constrained traveling salesman problem. Networks 38(2): 68-75 (2001)
- [j54]Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald: Random regular graphs of high degree. Random Struct. Algorithms 18(4): 346-363 (2001)
- [j53]Robert W. Robinson, Nicholas C. Wormald: Hamilton cycles containing randomly selected edges in random regular graphs. Random Struct. Algorithms 19(2): 128-147 (2001)
- 2000
- [j52]Hanna D. Robalewska, Nicholas C. Wormald: Random Star Processes. Combinatorics, Probability & Computing 9(1): 33-43 (2000)
- [j51]Meei Pyng Ng, Mike A. Steel, Nicholas C. Wormald: The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees. Discrete Applied Mathematics 98(3): 227-235 (2000)
- [j50]Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald: The asymptotic number of graphs with a restriction on the maximum degree. Electronic Notes in Discrete Mathematics 5: 228-230 (2000)
- [j49]Zhicheng Gao, Nicholas C. Wormald: The Distribution of the Maximum Vertex Degree in Random Planar Maps. J. Comb. Theory, Ser. A 89(2): 201-230 (2000)
- [c4]William Duckworth, Nicholas C. Wormald, Michele Zito: Maximum Induced Matchings of Random Cubic Graphs. COCOON 2000: 34-43
1990 – 1999
- 1999
- [j48]Arnold Knopfmacher, Andrew M. Odlyzko, Boris Pittel, L. Bruce Richmond, Dudley Stark, George Szekeres, Nicholas C. Wormald: The Asymptotic Number of Set Partitions with Unequal Block Sizes. Electr. J. Comb. 6 (1999)
- [j47]Angelika Steger, Nicholas C. Wormald: Generating Random Regular Graphs Quickly. Combinatorics, Probability & Computing 8(4): 377-396 (1999)
- [j46]Zhicheng Gao, Nicholas C. Wormald: The Size of the Largest Components in Random Planar Maps. SIAM J. Discrete Math. 12(2): 217-228 (1999)
- 1998
- [j45]Alistair Moffat, Ola Petersson, Nicholas C. Wormald: A Tree-Based Mergesort. Acta Inf. 35(9): 775-793 (1998)
- [j44]Terri Lindquester, Nicholas C. Wormald: Factorisation of regular graphs into forests of short paths. Discrete Mathematics 186(1-3): 217-226 (1998)
- [c3]Warren D. Smith, Nicholas C. Wormald: Geometric Separator Theorems & Applications. FOCS 1998: 232-243
- 1997
- [j43]Marcus Brazil, J. H. Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald: Full Minimal Steiner Trees on Lattice Sets. J. Comb. Theory, Ser. A 78(1): 51-91 (1997)
- [j42]Marcus Brazil, J. H. Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald: Minimal Steiner Trees for Rectangular Arrays of Lattice Points. J. Comb. Theory, Ser. A 79(2): 181-208 (1997)
- [j41]Dudley Stark, Nicholas C. Wormald: Asymptotic Enumeration of Convex Polygons. J. Comb. Theory, Ser. A 80(2): 196-217 (1997)
- [j40]Michael S. O. Molloy, Hanna D. Robalewska, Robert W. Robinson, Nicholas C. Wormald: 1-Factorizations of random regular graphs. Random Struct. Algorithms 10(3): 305-321 (1997)
- [j39]Brendan D. McKay, Nicholas C. Wormald: The degree sequence of a random graph. I. The models. Random Struct. Algorithms 11(2): 97-117 (1997)
- [j38]J. H. Rubinstein, Doreen A. Thomas, Nicholas C. Wormald: Steiner Trees for Terminals Constrained to Curves. SIAM J. Discrete Math. 10(1): 1-17 (1997)
- 1996
- [j37]Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech: A Family of Perfect Hashing Methods. Comput. J. 39(6): 547-554 (1996)
- [j36]Meei Pyng Ng, Nicholas C. Wormald: Reconstruction of Rooted Trees From Subtrees. Discrete Applied Mathematics 69(1-2): 19-31 (1996)
- [j35]Bill Jackson, Nicholas C. Wormald: On the linear k-arboricity of cubic graphs. Discrete Mathematics 162(1-3): 293-297 (1996)
- [j34]Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald: Generating and Counting Hamilton Cycles in Random Regular Graphs. J. Algorithms 21(1): 176-198 (1996)
- [j33]Boris Pittel, Joel Spencer, Nicholas C. Wormald: Sudden Emergence of a Giantk-Core in a Random Graph. J. Comb. Theory, Ser. B 67(1): 111-151 (1996)
- [j32]Marcus Brazil, T. Cole, J. H. Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald: Minimal Steiner Trees for 2k×2k Square Lattices. J. Comb. Theory, Ser. A 73(1): 91-110 (1996)
- [j31]Nicholas C. Wormald: The perturbation method and triangle-free random graphs. Random Struct. Algorithms 9(1-2): 253-269 (1996)
- 1995
- [j30]L. Bruce Richmond, Nicholas C. Wormald: Almost All Maps Are Asymmetric. J. Comb. Theory, Ser. B 63(1): 1-7 (1995)
- [j29]Bill Jackson, Nicholas C. Wormald: Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs. J. Comb. Theory, Ser. B 63(2): 163-169 (1995)
- [j28]Edward A. Bender, L. Bruce Richmond, Nicholas C. Wormald: Largest 4-Connected Components of 3-Connected Planar Triangulations. Random Struct. Algorithms 7(4): 273-286 (1995)
- 1994
- [j27]Peter Eades, Nicholas C. Wormald: Edge Crossings in Drawings of Bipartite Graphs. Algorithmica 11(4): 379-403 (1994)
- [j26]Zhicheng Gao, Nicholas C. Wormald: Spanning eulerian subgraphs of bounded degree in triangulations. Graphs and Combinatorics 10(2-4): 123-131 (1994)
- [j25]Robert W. Robinson, Nicholas C. Wormald: Almost All Regular Graphs Are Hamiltonian. Random Struct. Algorithms 5(2): 363-374 (1994)
- 1993
- [j24]Peter Eades, Xuemin Lin, Nicholas C. Wormald: Performance Guarantees for Motion Planning with Temporal Uncertainty. Australian Computer Journal 25(1): 21-28 (1993)
- [j23]Peter J. Cameron, Cheryl E. Praeger, Nicholas C. Wormald: Infinite highly arc transitive digraphs and universal covering digraphs. Combinatorica 13(4): 377-396 (1993)
- [c2]George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech: Graphs, Hypergraphs and Hashing. WG 1993: 153-165
- 1992
- [j22]Andrzej Rucinski, Nicholas C. Wormald: Random Graph Processes with Degree Restrictions. Combinatorics, Probability & Computing 1: 169-180 (1992)
- [j21]Bill Jackson, Nicholas C. Wormald: Longest cycles in 3-connected planar graphs. J. Comb. Theory, Ser. B 54(2): 291-321 (1992)
- [j20]Robert W. Robinson, Nicholas C. Wormald: Almost All Cubic Graphs Are Hamiltonian. Random Struct. Algorithms 3(2): 117-126 (1992)
- [j19]Ian G. Enting, Anthony J. Guttmann, L. Bruce Richmond, Nicholas C. Wormald: Enumeration of Almost-Convex Polygons on the Square Lattice. Random Struct. Algorithms 3(4): 445-462 (1992)
- [c1]Alistair Moffat, Ola Petersson, Nicholas C. Wormald: Sorting and/by Merging Finger Trees. ISAAC 1992: 499-508
- 1991
- [j18]Brendan D. McKay, Nicholas C. Wormald: Asymptotic enumeration by degree sequence of graphs with degress o(n1/2). Combinatorica 11(4): 369-382 (1991)
- 1990
- [j17]Peter Eades, Nicholas C. Wormald: Fixed edge-length graph drawing is NP-hard. Discrete Applied Mathematics 28(2): 111-134 (1990)
- [j16]Brendan D. McKay, Nicholas C. Wormald: Uniform Generation of Random Regular Graphs of Moderate Degree. J. Algorithms 11(1): 52-67 (1990)
- [j15]Bill Jackson, Nicholas C. Wormald: Cycles containing matchings and pairwise compatible euler tours. Journal of Graph Theory 14(1): 127-138 (1990)
- [j14]Derek A. Holton, Bill Jackson, Akira Saito, Nicholas C. Wormald: Removable edges in 3-connected graphs. Journal of Graph Theory 14(4): 465-473 (1990)
- [j13]M. Carter, Michael D. Hendy, David Penny, László A. Székely, Nicholas C. Wormald: On the Distribution of Lengths of Evolutionary Trees. SIAM J. Discrete Math. 3(1): 38-47 (1990)
1980 – 1989
- 1989
- [j12]László A. Székely, Nicholas C. Wormald: Bounds on the measurable chromatic number of Rn. Discrete Mathematics 75(1-3): 343-372 (1989)
- 1988
- [j11]Edward A. Bender, Nicholas C. Wormald: The asymptotic number of rooted nonseparable maps on a surface. J. Comb. Theory, Ser. A 49(2): 370-380 (1988)
- 1987
- [j10]Edward A. Bender, Cheryl E. Praeger, Nicholas C. Wormald: Optimal Worst Case Trees. Acta Inf. 24(4): 475-489 (1987)
- [j9]E. Rodney Canfield, Nicholas C. Wormald: Ménage numbers, bijections and P-recursiveness. Discrete Mathematics 63(2-3): 117-129 (1987)
- [j8]
- 1986
- [j7]Edward A. Bender, L. Bruce Richmond, Robert W. Robinson, Nicholas C. Wormald: The asymptotic number of acyclic diagraphs I. Combinatorica 6(1): 15-22 (1986)
- [j6]D. de Caen, Paul Erdös, Norman J. Pullmann, Nicholas C. Wormald: Extremal clique coverings of complementary graphs. Combinatorica 6(4): 309-314 (1986)
- 1985
- [j5]Edward A. Bender, Nicholas C. Wormald: The number of loopless planar maps. Discrete Mathematics 54(2): 235-237 (1985)
- [j4]Nicholas C. Wormald: Counting labelled chordal graphs. Graphs and Combinatorics 1(1): 193-200 (1985)
- 1984
- [j3]Brendan D. McKay, Nicholas C. Wormald: Automorphisms of random graphs with specified vertices. Combinatorica 4(4): 325-338 (1984)
- [j2]
- 1981
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 09:57 CEST by the dblp team