Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDNicholas C. Wormald
Nick Wormald
Person information
- affiliation: Monash University, Department of Mathematical Sciences
- affiliation: University of Waterloo, Department of Mathematics, Canada
- award (2006): Euler Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j160]Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast uniform generation of random graphs with given degree sequences. Random Struct. Algorithms 59(3): 291-314 (2021)- 2020
- [j159]Pawel Pralat, Nick Wormald:
Almost all 5-regular graphs have a 3-flow. J. Graph Theory 93(2): 147-156 (2020) - [j158]Kevin Leckey, Dieter Mitsche, Nick Wormald:
The height of depth-weighted random recursive trees. Random Struct. Algorithms 56(3): 851-866 (2020) - [c20]Seyed Soheil Hosseini, Nick Wormald, Tianhai Tian:
On Finding the Optimal Tree of a Complete Weighted Graph. FedCSIS 2020: 271-275 - [i9]Anita Liebenau, Nick Wormald:
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence. CoRR abs/2006.15797 (2020)
2010 – 2019
- 2019
- [j157]Kevin Leckey, Nick Wormald:
A Limit Theorem for the Six-length of Random Functional Graphs with a Fixed Degree Sequence. Electron. J. Comb. 26(4): P4.35 (2019) - [j156]Pawel Pralat, Nicholas C. Wormald:
Meyniel's conjecture holds for random d-regular graphs. Random Struct. Algorithms 55(3): 719-741 (2019) - [c19]Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast Uniform Generation of Random Graphs with Given Degree Sequences. FOCS 2019: 1371-1379 - [i8]Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast uniform generation of random graphs with given degree sequences. CoRR abs/1905.03446 (2019) - 2018
- [j155]Carlos Hoppen
, Nicholas C. Wormald:
Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs. Comb. 38(3): 619-664 (2018) - [j154]Amin Coja-Oghlan, Nick Wormald:
The Number of Satisfying Assignments of Random Regular k-SAT Formulas. Comb. Probab. Comput. 27(4): 496-530 (2018) - [j153]Dudley Stark, Nick Wormald:
The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph. Comb. Probab. Comput. 27(4): 672-715 (2018) - [c18]Pu Gao, Nicholas C. Wormald:
Uniform generation of random graphs with power-law degree sequences. SODA 2018: 1741-1758 - 2017
- [j152]Liying Kang, Nicholas C. Wormald:
Minimum Power Dominating Sets of Random Cubic Graphs. J. Graph Theory 85(1): 152-171 (2017) - [j151]Pu Gao, Nicholas C. Wormald:
Uniform Generation of Random Regular Graphs. SIAM J. Comput. 46(4): 1395-1427 (2017) - [j150]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the Push&Pull Protocol for Rumor Spreading. SIAM J. Discret. Math. 31(2): 647-668 (2017) - [i7]Pu Gao, Nicholas C. Wormald:
Uniform generation of random graphs with power-law degree sequences. CoRR abs/1709.02674 (2017) - 2016
- [j149]Abbas Mehrabian, Nick Wormald:
It's a Small World for Random Surfers. Algorithmica 76(2): 344-380 (2016) - [j148]Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees. J. Appl. Probab. 53(3): 846-856 (2016) - [j147]Carlos Hoppen, Nicholas C. Wormald:
Properties of regular graphs with large girth via local algorithms. J. Comb. Theory, Ser. B 121: 367-397 (2016) - [j146]Pawel Pralat, Nicholas C. Wormald:
Meyniel's conjecture holds for random graphs. Random Struct. Algorithms 48(2): 396-421 (2016) - [j145]Jeff Kahn, Eyal Lubetzky, Nicholas C. Wormald:
The threshold for combs in random graphs. Random Struct. Algorithms 48(4): 794-802 (2016) - [i6]Amin Coja-Oghlan, Nick Wormald:
The number of satisfying assignments of random regular k-SAT formulas. CoRR abs/1611.03236 (2016) - 2015
- [j144]Pu Gao, Nicholas C. Wormald:
Orientability Thresholds for Random Hypergraphs. Comb. Probab. Comput. 24(5): 774-824 (2015) - [c17]Pu Gao, Nicholas C. Wormald:
Uniform Generation of Random Regular Graphs. FOCS 2015: 1218-1230 - [c16]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract]. PODC 2015: 405-412 - [i5]Pu Gao, Nicholas C. Wormald:
Uniform generation of random regular graphs. CoRR abs/1511.01175 (2015) - 2014
- [j143]Whitman Richards, Nicholas C. Wormald:
The evolution and structure of social networks. Netw. Sci. 2(3): 326-340 (2014) - [j142]Itai Benjamini, Gady Kozma, Nicholas C. Wormald:
The mixing time of the giant component of a random graph. Random Struct. Algorithms 45(3): 383-407 (2014) - [j141]Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung:
On longest paths and diameter in random apollonian network. Random Struct. Algorithms 45(4): 703-725 (2014) - [j140]Brett Kolesnik, Nick Wormald:
Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs. SIAM J. Discret. Math. 28(1): 553-575 (2014) - [c15]Abbas Mehrabian, Nick Wormald:
It's a Small World for Random Surfers. APPROX-RANDOM 2014: 857-871 - [i4]Abbas Mehrabian, Nick Wormald:
It's a Small World for Random Surfers. CoRR abs/1404.7189 (2014) - [i3]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the push&pull protocol for rumour spreading. CoRR abs/1411.0948 (2014) - 2013
- [j139]Abbas Mehrabian, Nick Wormald:
On the Stretch Factor of Randomly Embedded Random Graphs. Discret. Comput. Geom. 49(3): 647-658 (2013) - [j138]Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung:
On the Longest Paths and the Diameter in Random Apollonian Networks. Electron. Notes Discret. Math. 43: 355-365 (2013) - [j137]Xavier Pérez-Giménez, Nicholas C. Wormald:
Asymptotic enumeration of strongly connected digraphs by vertices and edges. Random Struct. Algorithms 43(1): 80-114 (2013) - [j136]Graeme Kemkes, Cristiane M. Sato, Nicholas C. Wormald:
Asymptotic enumeration of sparse 2-connected graphs. Random Struct. Algorithms 43(3): 354-376 (2013) - [j135]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): 342-362 (2013) - 2012
- [j134]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) - [j133]Fabiano C. Botelho, Nicholas C. Wormald, Nivio Ziviani:
Cores of random r-partite hypergraphs. Inf. Process. Lett. 112(8-9): 314-319 (2012) - [j132]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): 336-354 (2012) - [i2]Abbas Mehrabian, Nick Wormald:
On the Stretch Factor of Randomly Embedded Random Graphs. CoRR abs/1205.6252 (2012) - 2011
- [j131]Pawel Pralat, Jacques Verstraëte, Nicholas C. Wormald:
On the threshold for k-regular subgraphs of random graphs. Comb. 31(5): 565-581 (2011) - [j130]Stefanie Gerke, Angelika Steger, Nicholas C. Wormald:
Pegging Graphs Yields a Small Diameter. Comb. Probab. Comput. 20(2): 239-248 (2011) - [j129]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): 115-136 (2011) - [j128]Tobias Müller, Xavier Pérez-Giménez, Nicholas C. Wormald:
Disjoint Hamilton cycles in the random geometric graph. J. Graph Theory 68(4): 299-322 (2011) - [j127]Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald:
Regular induced subgraphs of a random Graph. Random Struct. Algorithms 38(3): 235-250 (2011) - 2010
- [j126]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) - [j125]William Duckworth, Nicholas C. Wormald:
Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs. Electron. J. Comb. 17(1) (2010) - [j124]Oliver Riordan, Nicholas C. Wormald:
The Diameter of Sparse Random Graphs. Comb. Probab. Comput. 19(5-6): 835-926 (2010) - [c14]Pu Gao, Nicholas C. Wormald:
Load balancing and orientability thresholds for random hypergraphs. STOC 2010: 97-104 - [i1]Pu Gao, Nicholas C. Wormald:
Orientability thresholds for random hypergraphs. CoRR abs/1009.5489 (2010)
2000 – 2009
- 2009
- [j123]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) - [j122]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): 157-191 (2009) - [j121]Pu Gao, Nicholas C. Wormald:
Short cycle distribution in random regular graphs recursively generated by pegging. Random Struct. Algorithms 34(1): 54-86 (2009) - [c13]Whitman Richards, Nicholas C. Wormald:
Representing Small Group Evolution. CSE (4) 2009: 159-165 - 2008
- [j120]Carlos Hoppen, Nicholas C. Wormald:
Induced Forests in Regular Graphs with Large Girth. Comb. Probab. Comput. 17(3): 389-410 (2008) - [j119]Nicholas C. Wormald, Sanming Zhou:
Large forbidden trade volumes and edge packings of random graphs. Discret. Math. 308(13): 2751-2755 (2008) - [j118]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) - [j117]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): 835-837 (2008) - [j116]Zhicheng Gao, Nicholas C. Wormald:
Distribution of subgraphs of random regular graphs. Random Struct. Algorithms 32(1): 38-48 (2008) - [j115]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): 747-775 (2008) - [j114]Noga Alon, Pawel Pralat, Nicholas C. Wormald:
Cleaning Regular Graphs with Brushes. SIAM J. Discret. Math. 23(1): 233-250 (2008) - 2007
- [j113]Joel H. Spencer, Nicholas C. Wormald:
Birth control for giants. Comb. 27(5): 587-628 (2007) - [j112]Lingsheng Shi, Nicholas C. Wormald:
Colouring Random 4-Regular Graphs. Comb. Probab. Comput. 16(2): 309-344 (2007) - [j111]Lingsheng Shi, Nicholas C. Wormald:
Colouring Random Regular Graphs. Comb. Probab. Comput. 16(3): 459-494 (2007) - [j110]Pawel Pralat, Nicholas C. Wormald:
Growing Protean Graphs. Internet Math. 4(1): 1-16 (2007) - [j109]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): 143-158 (2007) - [j108]Joseph Lauer, Nicholas C. Wormald:
Large independent sets in regular graphs of large girth. J. Comb. Theory, Ser. B 97(6): 999-1009 (2007) - [j107]Svante Janson, Nicholas C. Wormald:
Rainbow Hamilton cycles in random regular graphs. Random Struct. Algorithms 30(1-2): 35-49 (2007) - [j106]András Telcs, Nicholas C. Wormald, Sanming Zhou:
Hamiltonicity of random graphs produced by 2-processes. Random Struct. Algorithms 31(4): 450-481 (2007) - [j105]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) - [c12]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 - [c11]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 - [c10]Marcus Brazil, Peter A. 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: 856-861 - 2006
- [j104]Julie Cain, Nicholas C. Wormald:
Encores on Cores. Electron. J. Comb. 13(1) (2006) - [j103]William Duckworth, Nicholas C. Wormald:
On the Independent Domination Number of Random Regular Graphs. Comb. Probab. Comput. 15(4): 513-522 (2006) - [j102]Hilda Assiyatun, Nicholas C. Wormald:
3-star factors in random d-regular graphs. Eur. J. Comb. 27(8): 1249-1262 (2006) - [j101]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): 573-592 (2006) - [j100]Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald:
The generalized acyclic edge chromatic number of random regular graphs. J. Graph Theory 53(2): 101-125 (2006) - [c9]Nicholas C. Wormald:
Analysis of Algorithms on the Cores of Random Graphs. APPROX-RANDOM 2006: 2 - 2005
- [j99]Alan M. Frieze, Nicholas C. Wormald:
Random k-Sat: A Tight Threshold For Moderately Growing k. Comb. 25(3): 297-305 (2005) - [j98]Boris G. Pittel, Nicholas C. Wormald:
Counting connected graphs inside-out. J. Comb. Theory, Ser. B 93(2): 127-172 (2005) - [j97]Jaroslav Nesetril, Nicholas C. Wormald:
The acyclic edge chromatic number of a random d-regular graph is d + 1. J. Graph Theory 49(1): 69-74 (2005) - [c8]Josep Díaz, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald:
Connectivity for Wireless Agents Moving on a Cycle or Grid. STACS 2005: 353-364 - 2004
- [j96]Brendan D. McKay, Nicholas C. Wormald, Beata Wysocka:
Short Cycles in Random Regular Graphs. Electron. J. Comb. 11(1) (2004) - [j95]Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald:
Random Hypergraph Processes with Degree Restrictions. Graphs Comb. 20(3): 319-332 (2004) - [j94]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) - [j93]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) - [j92]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) - [c7]Josep Díaz, Maria J. Serna, Nicholas C. Wormald:
Computation of the Bisection Width for Random d-Regular Graphs. LATIN 2004: 49-58 - 2003
- [j91]Zhicheng Gao, Nicholas C. Wormald:
Sharp Concentration of the Number of Submaps in Random Planar Triangulations. Comb. 23(3): 467-486 (2003) - [j90]Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald:
Connectedness Of The Degree Bounded Star Process. Comb. Probab. Comput. 12(3): 269-283 (2003) - [j89]Nicholas C. Wormald:
Analysis of greedy algorithms on graphs with bounded degrees. Discret. Math. 273(1-3): 235-260 (2003) - [j88]Robert Castelo, Nicholas C. Wormald:
Enumeration of P 4-Free Chordal Graphs. Graphs Comb. 19(4): 467-474 (2003) - [j87]Boris G. Pittel, Nicholas C. Wormald:
Asymptotic enumeration of sparse graphs with a minimum degree constraint. J. Comb. Theory, Ser. A 101(2): 249-263 (2003) - [j86]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) - [j85]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) - [j84]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) - [p1]Béla Bollobás, Vladimir Nikiforov, Nicholas C. Wormald, Ralph J. Faudree, Alan M. Frieze:
Analytic Graph Theory. Handbook of Graph Theory 2003: 787-871 - 2002
- [j83]Edward A. Bender, Zhicheng Gao, Nicholas C. Wormald:
The Number of Labeled 2-Connected Planar Graphs. Electron. J. Comb. 9(1) (2002) - [j82]Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald:
Permutation Pseudographs And Contiguity. Comb. Probab. Comput. 11(3): 273-298 (2002) - [j81]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): 373-392 (2002) - [j80]William Duckworth, Nicholas C. Wormald:
Minimum independent dominating sets of random cubic graphs. Random Struct. Algorithms 21(2): 147-161 (2002) - [j79]Sheng Bau, Nicholas C. Wormald, Sanming Zhou:
Decycling numbers of random regular graphs. Random Struct. Algorithms 21(3-4): 397-413 (2002) - [c6]Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald:
Bisection of Random Cubic Graphs. RANDOM 2002: 114-125 - 2001
- [j78]Noga Alon, Vanessa Teague, Nicholas C. Wormald:
Linear Arboricity and Linear k-Arboricity of Regular Graphs. Graphs Comb. 17(1): 11-16 (2001) - [j77]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) - [j76]Ian M. Wanless, Nicholas C. Wormald:
Regular Graphs with No Homomorphisms onto Cycles. J. Comb. Theory, Ser. B 82(1): 155-160 (2001) - [j75]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): 139-155 (2001) - [j74]Zhicheng Gao, Ian M. Wanless, Nicholas C. Wormald:
Counting 5-connected planar triangulations. J. Graph Theory 38(1): 18-35 (2001) - [j73]J. Hyam Rubinstein, Doreen A. Thomas, Nicholas C. Wormald:
A polynomial algorithm for a constrained traveling salesman problem. Networks 38(2): 68-75 (2001) - [j72]Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald:
Random regular graphs of high degree. Random Struct. Algorithms 18(4): 346-363 (2001) - [j71]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
- [j70]Hilda Assiyatun, Nicholas C. Wormald:
Covering regular graphs with forests of small trees. Australas. J Comb. 22: 219-226 (2000) - [j69]Hanna D. Robalewska, Nicholas C. Wormald:
Random Star Processes. Comb. Probab. Comput. 9(1): 33-43 (2000) - [j68]Meei Pyng Ng, Mike A. Steel, Nicholas C. Wormald:
The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees. Discret. Appl. Math. 98(3): 227-235 (2000) - [j67]Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald:
The asymptotic number of graphs with a restriction on the maximum degree. Electron. Notes Discret. Math. 5: 228-230 (2000) - [j66]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) - [c5]William Duckworth, Nicholas C. Wormald, Michele Zito:
Maximum Induced Matchings of Random Cubic Graphs. COCOON 2000: 34-43
1990 – 1999
- 1999
- [j65]Arnold Knopfmacher, Andrew M. Odlyzko, Boris G. Pittel, L. Bruce Richmond, Dudley Stark, George Szekeres, Nicholas C. Wormald:
The Asymptotic Number of Set Partitions with Unequal Block Sizes. Electron. J. Comb. 6 (1999) - [j64]Angelika Steger, Nicholas C. Wormald:
Generating Random Regular Graphs Quickly. Comb. Probab. Comput. 8(4): 377-396 (1999) - [j63]Zhicheng Gao, Nicholas C. Wormald:
The Size of the Largest Components in Random Planar Maps. SIAM J. Discret. Math. 12(2): 217-228 (1999) - 1998
- [j62]Alistair Moffat, Ola Petersson, Nicholas C. Wormald:
A Tree-Based Mergesort. Acta Informatica 35(9): 775-793 (1998) - [j61]Robert E. L. Aldred, Nicholas C. Wormald:
More on the linear k-arboricity of regular graphs. Australas. J Comb. 18: 97-104 (1998) - [j60]Terri Lindquester, Nicholas C. Wormald:
Factorisation of regular graphs into forests of short paths. Discret. Math. 186(1-3): 217-226 (1998) - [c4]Warren D. Smith, Nicholas C. Wormald:
Geometric Separator Theorems & Applications. FOCS 1998: 232-243 - 1997
- [j59]Marcus Brazil, J. Hyam 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) - [j58]Marcus Brazil, J. Hyam 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) - [j57]Dudley Stark, Nicholas C. Wormald:
Asymptotic Enumeration of Convex Polygons. J. Comb. Theory, Ser. A 80(2): 196-217 (1997) - [j56]