| 2009 |
|---|
| 103 | EE | Pu Gao,
Nicholas C. Wormald:
Short cycle distribution in random regular graphs recursively generated by pegging.
Random Struct. Algorithms 34(1): 54-86 (2009) |
| 2008 |
|---|
| 102 | EE | Carlos Hoppen,
Nicholas C. Wormald:
Induced Forests in Regular Graphs with Large Girth.
Combinatorics, Probability & Computing 17(3): 389-410 (2008) |
| 101 | EE | Nicholas C. Wormald,
Sanming Zhou:
Large forbidden trade volumes and edge packings of random graphs.
Discrete Mathematics 308(13): 2751-2755 (2008) |
| 100 | EE | 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) |
| 99 | EE | 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) |
| 98 | EE | Zhicheng Gao,
Nicholas C. Wormald:
Distribution of subgraphs of random regular graphs.
Random Struct. Algorithms 32(1): 38-48 (2008) |
| 97 | EE | 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) |
| 2007 |
|---|
| 96 | EE | 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 |
| 95 | EE | 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 |
| 94 | | Marcus Brazil,
P. A. Grossman,
D. H. Lee,
J. H. Rubinstein,
D. A. Thomas,
Nicholas C. Wormald:
Constrained Path Optimisation for Underground Mine Layout.
World Congress on Engineering 2007: 856-861 |
| 93 | EE | Lingsheng Shi,
Nicholas C. Wormald:
Colouring Random 4-Regular Graphs.
Combinatorics, Probability & Computing 16(2): 309-344 (2007) |
| 92 | EE | Lingsheng Shi,
Nicholas C. Wormald:
Colouring Random Regular Graphs.
Combinatorics, Probability & Computing 16(3): 459-494 (2007) |
| 91 | EE | Joseph Lauer,
Nicholas C. Wormald:
Large independent sets in regular graphs of large girth.
J. Comb. Theory, Ser. B 97(6): 999-1009 (2007) |
| 90 | EE | Svante Janson,
Nicholas C. Wormald:
Rainbow Hamilton cycles in random regular graphs.
Random Struct. Algorithms 30(1-2): 35-49 (2007) |
| 89 | EE | András Telcs,
Nicholas C. Wormald,
Sanming Zhou:
Hamiltonicity of random graphs produced by 2-processes.
Random Struct. Algorithms 31(4): 450-481 (2007) |
| 88 | EE | 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) |
| 2006 |
|---|
| 87 | EE | Nicholas C. Wormald:
Analysis of Algorithms on the Cores of Random Graphs.
APPROX-RANDOM 2006: 2 |
| 86 | EE | William Duckworth,
Nicholas C. Wormald:
On the Independent Domination Number of Random Regular Graphs.
Combinatorics, Probability & Computing 15(4): 513-522 (2006) |
| 85 | EE | Julie Cain,
Nicholas C. Wormald:
Encores on Cores.
Electr. J. Comb. 13(1): (2006) |
| 84 | EE | Hilda Assiyatun,
Nicholas C. Wormald:
3-star factors in random d-regular graphs.
Eur. J. Comb. 27(8): 1249-1262 (2006) |
| 83 | EE | 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) |
| 2005 |
|---|
| 82 | EE | 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 |
| 81 | EE | Alan M. Frieze,
Nicholas C. Wormald:
Random k-Sat: A Tight Threshold For Moderately Growing k.
Combinatorica 25(3): 297-305 (2005) |
| 80 | EE | Boris Pittel,
Nicholas C. Wormald:
Counting connected graphs inside-out.
J. Comb. Theory, Ser. B 93(2): 127-172 (2005) |
| 79 | EE | 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) |
| 2004 |
|---|
| 78 | EE | Josep Díaz,
Maria J. Serna,
Nicholas C. Wormald:
Computation of the Bisection Width for Random d-Regular Graphs.
LATIN 2004: 49-58 |
| 77 | EE | Brendan D. McKay,
Nicholas C. Wormald,
Beata Wysocka:
Short Cycles in Random Regular Graphs.
Electr. J. Comb. 11(1): (2004) |
| 76 | EE | Catherine S. Greenhill,
Andrzej Rucinski,
Nicholas C. Wormald:
Random Hypergraph Processes with Degree Restrictions.
Graphs and Combinatorics 20(3): 319-332 (2004) |
| 75 | EE | 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) |
| 74 | EE | 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) |
| 73 | EE | 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) |
| 2003 |
|---|
| 72 | EE | Zhicheng Gao,
Nicholas C. Wormald:
Sharp Concentration of the Number of Submaps in Random Planar Triangulations.
Combinatorica 23(3): 467-486 (2003) |
| 71 | | Catherine S. Greenhill,
Andrzej Rucinski,
Nicholas C. Wormald:
Connectedness Of The Degree Bounded Star Process.
Combinatorics, Probability & Computing 12(3): (2003) |
| 70 | EE | Nicholas C. Wormald:
Analysis of greedy algorithms on graphs with bounded degrees.
Discrete Mathematics 273(1-3): 235-260 (2003) |
| 69 | EE | Robert Castelo,
Nicholas C. Wormald:
Enumeration of P 4-Free Chordal Graphs.
Graphs and Combinatorics 19(4): 467-474 (2003) |
| 68 | EE | 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) |
| 67 | EE | 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) |
| 66 | EE | 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) |
| 65 | EE | 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 |
|---|
| 64 | EE | Josep Díaz,
Norman Do,
Maria J. Serna,
Nicholas C. Wormald:
Bisection of Random Cubic Graphs.
RANDOM 2002: 114-125 |
| 63 | | Catherine S. Greenhill,
Svante Janson,
Jeong Han Kim,
Nicholas C. Wormald:
Permutation Pseudographs And Contiguity.
Combinatorics, Probability & Computing 11(3): (2002) |
| 62 | | 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): (2002) |
| 61 | EE | Edward A. Bender,
Zhicheng Gao,
Nicholas C. Wormald:
The Number of Labeled 2-Connected Planar Graphs.
Electr. J. Comb. 9(1): (2002) |
| 60 | EE | William Duckworth,
Nicholas C. Wormald:
Minimum independent dominating sets of random cubic graphs.
Random Struct. Algorithms 21(2): 147-161 (2002) |
| 59 | EE | Sheng Bau,
Nicholas C. Wormald,
Sanming Zhou:
Decycling numbers of random regular graphs.
Random Struct. Algorithms 21(3-4): 397-413 (2002) |
| 2001 |
|---|
| 58 | EE | Noga Alon,
Vanessa Teague,
Nicholas C. Wormald:
Linear Arboricity and Linear k-Arboricity of Regular Graphs.
Graphs and Combinatorics 17(1): 11-16 (2001) |
| 57 | EE | 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) |
| 56 | EE | Ian M. Wanless,
Nicholas C. Wormald:
Regular Graphs with No Homomorphisms onto Cycles.
J. Comb. Theory, Ser. B 82(1): 155-160 (2001) |
| 55 | EE | J. H. Rubinstein,
D. A. Thomas,
Nicholas C. Wormald:
A polynomial algorithm for a constrained traveling salesman problem.
Networks 38(2): 68-75 (2001) |
| 54 | | Michael Krivelevich,
Benny Sudakov,
Van H. Vu,
Nicholas C. Wormald:
Random regular graphs of high degree.
Random Struct. Algorithms 18(4): 346-363 (2001) |
| 53 | | 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 |
|---|
| 52 | EE | William Duckworth,
Nicholas C. Wormald,
Michele Zito:
Maximum Induced Matchings of Random Cubic Graphs.
COCOON 2000: 34-43 |
| 51 | | Hanna D. Robalewska,
Nicholas C. Wormald:
Random Star Processes.
Combinatorics, Probability & Computing 9(1): (2000) |
| 50 | EE | 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) |
| 49 | EE | 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) |
| 48 | EE | 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) |
| 1999 |
|---|
| 47 | | Angelika Steger,
Nicholas C. Wormald:
Generating Random Regular Graphs Quickly.
Combinatorics, Probability & Computing 8(4): (1999) |
| 46 | EE | Arnold Knopfmacher,
Andrew M. Odlyzko,
Boris Pittel,
L. Bruce Richmond,
Dudley Stark,
G. Szekeres,
Nicholas C. Wormald:
The Asymptotic Number of Set Partitions with Unequal Block Sizes.
Electr. J. Comb. 6: (1999) |
| 45 | EE | 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 |
|---|
| 44 | EE | Warren D. Smith,
Nicholas C. Wormald:
Geometric Separator Theorems & Applications.
FOCS 1998: 232-243 |
| 43 | EE | Alistair Moffat,
Ola Petersson,
Nicholas C. Wormald:
A Tree-Based Mergesort.
Acta Inf. 35(9): 775-793 (1998) |
| 42 | EE | Terri Lindquester,
Nicholas C. Wormald:
Factorisation of regular graphs into forests of short paths.
Discrete Mathematics 186(1-3): 217-226 (1998) |
| 1997 |
|---|
| 41 | EE | Marcus Brazil,
J. H. Rubinstein,
D. A. Thomas,
J. F. Weng,
Nicholas C. Wormald:
Full Minimal Steiner Trees on Lattice Sets.
J. Comb. Theory, Ser. A 78(1): 51-91 (1997) |
| 40 | EE | Marcus Brazil,
J. H. Rubinstein,
D. A. Thomas,
J. F. Weng,
Nicholas C. Wormald:
Minimal Steiner Trees for Rectangular Arrays of Lattice Points.
J. Comb. Theory, Ser. A 79(2): 181-208 (1997) |
| 39 | EE | Dudley Stark,
Nicholas C. Wormald:
Asymptotic Enumeration of Convex Polygons.
J. Comb. Theory, Ser. A 80(2): 196-217 (1997) |
| 38 | | 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) |
| 37 | | Brendan D. McKay,
Nicholas C. Wormald:
The degree sequence of a random graph. I. The models.
Random Struct. Algorithms 11(2): 97-117 (1997) |
| 36 | EE | J. H. Rubinstein,
D. A. Thomas,
Nicholas C. Wormald:
Steiner Trees for Terminals Constrained to Curves.
SIAM J. Discrete Math. 10(1): 1-17 (1997) |
| 1996 |
|---|
| 35 | | Bohdan S. Majewski,
Nicholas C. Wormald,
George Havas,
Zbigniew J. Czech:
A Family of Perfect Hashing Methods.
Comput. J. 39(6): 547-554 (1996) |
| 34 | EE | Meei Pyng Ng,
Nicholas C. Wormald:
Reconstruction of Rooted Trees From Subtrees.
Discrete Applied Mathematics 69(1-2): 19-31 (1996) |
| 33 | EE | Bill Jackson,
Nicholas C. Wormald:
On the linear k-arboricity of cubic graphs.
Discrete Mathematics 162(1-3): 293-297 (1996) |
| 32 | | 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) |
| 31 | EE | Marcus Brazil,
T. Cole,
J. H. Rubinstein,
D. A. Thomas,
J. F. Weng,
Nicholas C. Wormald:
Minimal Steiner Trees for 2k×2k Square Lattices.
J. Comb. Theory, Ser. A 73(1): 91-110 (1996) |
| 30 | EE | 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) |
| 29 | | Nicholas C. Wormald:
The perturbation method and triangle-free random graphs.
Random Struct. Algorithms 9(1-2): 253-269 (1996) |
| 1995 |
|---|
| 28 | EE | L. Bruce Richmond,
Nicholas C. Wormald:
Almost All Maps Are Asymmetric.
J. Comb. Theory, Ser. B 63(1): 1-7 (1995) |
| 27 | EE | 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) |
| 26 | | 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 |
|---|
| 25 | | Peter Eades,
Nicholas C. Wormald:
Edge Crossings in Drawings of Bipartite Graphs.
Algorithmica 11(4): 379-403 (1994) |
| 24 | | Robert W. Robinson,
Nicholas C. Wormald:
Almost All Regular Graphs Are Hamiltonian.
Random Struct. Algorithms 5(2): 363-374 (1994) |
| 1993 |
|---|
| 23 | | George Havas,
Bohdan S. Majewski,
Nicholas C. Wormald,
Zbigniew J. Czech:
Graphs, Hypergraphs and Hashing.
WG 1993: 153-165 |
| 22 | | Peter Eades,
Xuemin Lin,
Nicholas C. Wormald:
Performance Guarantees for Motion Planning with Temporal Uncertainty.
Australian Computer Journal 25(1): 21-28 (1993) |
| 21 | | Peter J. Cameron,
Cheryl E. Praeger,
Nicholas C. Wormald:
Infinite highly arc transitive digraphs and universal covering digraphs.
Combinatorica 13(4): 377-396 (1993) |
| 1992 |
|---|
| 20 | | Alistair Moffat,
Ola Petersson,
Nicholas C. Wormald:
Sorting and/by Merging Finger Trees.
ISAAC 1992: 499-508 |
| 19 | | Andrzej Rucinski,
Nicholas C. Wormald:
Random Graph Processes with Degree Restrictions.
Combinatorics, Probability & Computing 1: 169-180 (1992) |
| 18 | EE | Bill Jackson,
Nicholas C. Wormald:
Longest cycles in 3-connected planar graphs.
J. Comb. Theory, Ser. B 54(2): 291-321 (1992) |
| 17 | | Robert W. Robinson,
Nicholas C. Wormald:
Almost All Cubic Graphs Are Hamiltonian.
Random Struct. Algorithms 3(2): 117-126 (1992) |
| 16 | | 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) |
| 1991 |
|---|
| 15 | | 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 |
|---|
| 14 | EE | Peter Eades,
Nicholas C. Wormald:
Fixed edge-length graph drawing is NP-hard.
Discrete Applied Mathematics 28(2): 111-134 (1990) |
| 13 | | Brendan D. McKay,
Nicholas C. Wormald:
Uniform Generation of Random Regular Graphs of Moderate Degree.
J. Algorithms 11(1): 52-67 (1990) |
| 12 | | 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) |
| 1989 |
|---|
| 11 | EE | 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 |
|---|
| 10 | EE | 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 |
|---|
| 9 | | Edward A. Bender,
Cheryl E. Praeger,
Nicholas C. Wormald:
Optimal Worst Case Trees.
Acta Inf. 24(4): 475-489 (1987) |
| 8 | EE | E. Rodney Canfield,
Nicholas C. Wormald:
Ménage numbers, bijections and P-recursiveness.
Discrete Mathematics 63(2-3): 117-129 (1987) |
| 7 | | Nicholas C. Wormald:
Generating Random Unlabelled Graphs.
SIAM J. Comput. 16(4): 717-727 (1987) |
| 1986 |
|---|
| 6 | | 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) |
| 5 | | D. de Caen,
Paul Erdös,
N. J. Pullmann,
Nicholas C. Wormald:
Extremal clique coverings of complementary graphs.
Combinatorica 6(4): 309-314 (1986) |
| 1985 |
|---|
| 4 | EE | Edward A. Bender,
Nicholas C. Wormald:
The number of loopless planar maps.
Discrete Mathematics 54(2): 235-237 (1985) |
| 1984 |
|---|
| 3 | | Brendan D. McKay,
Nicholas C. Wormald:
Automorphisms of random graphs with specified vertices.
Combinatorica 4(4): 325-338 (1984) |
| 2 | | Nicholas C. Wormald:
Generating Random Regular Graphs.
J. Algorithms 5(2): 247-280 (1984) |
| 1981 |
|---|
| 1 | EE | Nicholas C. Wormald:
Counting unrooted planar maps.
Discrete Mathematics 36(2): 205-225 (1981) |
