Search the dblp DataBase
Nicholas C. Wormald :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Nicholas C. Wormald Analysis of Algorithms on the Cores of Random Graphs. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2006, pp:2- [Conf ] William Duckworth , Nicholas C. Wormald , Michele Zito Maximum Induced Matchings of Random Cubic Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:34-43 [Conf ] Warren D. Smith , Nicholas C. Wormald Geometric Separator Theorems & Applications. [Citation Graph (0, 0)][DBLP ] FOCS, 1998, pp:232-243 [Conf ] Alistair Moffat , Ola Petersson , Nicholas C. Wormald Sorting and/by Merging Finger Trees. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:499-508 [Conf ] Josep Díaz , Maria J. Serna , Nicholas C. Wormald Computation of the Bisection Width for Random d-Regular Graphs. [Citation Graph (0, 0)][DBLP ] LATIN, 2004, pp:49-58 [Conf ] Josep Díaz , Norman Do , Maria J. Serna , Nicholas C. Wormald Bisection of Random Cubic Graphs. [Citation Graph (0, 0)][DBLP ] RANDOM, 2002, pp:114-125 [Conf ] Josep Díaz , Xavier Pérez , Maria J. Serna , Nicholas C. Wormald Connectivity for Wireless Agents Moving on a Cycle or Grid. [Citation Graph (0, 0)][DBLP ] STACS, 2005, pp:353-364 [Conf ] George Havas , Bohdan S. Majewski , Nicholas C. Wormald , Zbigniew J. Czech Graphs, Hypergraphs and Hashing. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:153-165 [Conf ] Peter Eades , Xuemin Lin , Nicholas C. Wormald Performance Guarantees for Motion Planning with Temporal Uncertainty. [Citation Graph (0, 0)][DBLP ] Australian Computer Journal, 1993, v:25, n:1, pp:21-28 [Journal ] Edward A. Bender , Cheryl E. Praeger , Nicholas C. Wormald Optimal Worst Case Trees. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1987, v:24, n:4, pp:475-489 [Journal ] Alistair Moffat , Ola Petersson , Nicholas C. Wormald A Tree-Based Mergesort. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1998, v:35, n:9, pp:775-793 [Journal ] Peter Eades , Nicholas C. Wormald Edge Crossings in Drawings of Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1994, v:11, n:4, pp:379-403 [Journal ] Bohdan S. Majewski , Nicholas C. Wormald , George Havas , Zbigniew J. Czech A Family of Perfect Hashing Methods. [Citation Graph (0, 0)][DBLP ] Comput. J., 1996, v:39, n:6, pp:547-554 [Journal ] Edward A. Bender , L. Bruce Richmond , Robert W. Robinson , Nicholas C. Wormald The asymptotic number of acyclic diagraphs I. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1986, v:6, n:1, pp:15-22 [Journal ] D. de Caen , Paul Erdös , N. J. Pullmann , Nicholas C. Wormald Extremal clique coverings of complementary graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1986, v:6, n:4, pp:309-314 [Journal ] Peter J. Cameron , Cheryl E. Praeger , Nicholas C. Wormald Infinite highly arc transitive digraphs and universal covering digraphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1993, v:13, n:4, pp:377-396 [Journal ] Alan M. Frieze , Nicholas C. Wormald Random k -Sat: A Tight Threshold For Moderately Growing k . [Citation Graph (0, 0)][DBLP ] Combinatorica, 2005, v:25, n:3, pp:297-305 [Journal ] Zhicheng Gao , Nicholas C. Wormald Sharp Concentration of the Number of Submaps in Random Planar Triangulations. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2003, v:23, n:3, pp:467-486 [Journal ] Brendan D. McKay , Nicholas C. Wormald Automorphisms of random graphs with specified vertices. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1984, v:4, n:4, pp:325-338 [Journal ] Brendan D. McKay , Nicholas C. Wormald Asymptotic enumeration by degree sequence of graphs with degress o(n1/2 ). [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:4, pp:369-382 [Journal ] Edward A. Bender , Zhicheng Gao , Nicholas C. Wormald The Number of Labeled 2-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal ] Brendan D. McKay , Nicholas C. Wormald , Beata Wysocka Short Cycles in Random Regular Graphs. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 1999, v:6, n:, pp:- [Journal ] Catherine S. Greenhill , Svante Janson , Jeong Han Kim , Nicholas C. Wormald Permutation Pseudographs And Contiguity. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2002, v:11, n:3, pp:- [Journal ] Catherine S. Greenhill , Andrzej Rucinski , Nicholas C. Wormald Connectedness Of The Degree Bounded Star Process. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal ] Brendan D. McKay , Ian M. Wanless , Nicholas C. Wormald Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal ] Hanna D. Robalewska , Nicholas C. Wormald Random Star Processes. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2000, v:9, n:1, pp:- [Journal ] Andrzej Rucinski , Nicholas C. Wormald Random Graph Processes with Degree Restrictions. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1992, v:1, n:, pp:169-180 [Journal ] Angelika Steger , Nicholas C. Wormald Generating Random Regular Graphs Quickly. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1999, v:8, n:4, pp:- [Journal ] Meei Pyng Ng , Nicholas C. Wormald Reconstruction of Rooted Trees From Subtrees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1996, v:69, n:1-2, pp:19-31 [Journal ] Meei Pyng Ng , Mike A. Steel , Nicholas C. Wormald The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2000, v:98, n:3, pp:227-235 [Journal ] Nicholas C. Wormald Analysis of greedy algorithms on graphs with bounded degrees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:273, n:1-3, pp:235-260 [Journal ] Hilda Assiyatun , Nicholas C. Wormald 3-star factors in random d -regular graphs. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2006, v:27, n:8, pp:1249-1262 [Journal ] Noga Alon , Vanessa Teague , Nicholas C. Wormald Linear Arboricity and Linear k-Arboricity of Regular Graphs. [Citation Graph (0, 0)][DBLP ] Graphs and Combinatorics, 2001, v:17, n:1, pp:11-16 [Journal ] Catherine S. Greenhill , Andrzej Rucinski , Nicholas C. Wormald Random Hypergraph Processes with Degree Restrictions. [Citation Graph (0, 0)][DBLP ] Graphs and Combinatorics, 2004, v:20, n:3, pp:319-332 [Journal ] Robert Castelo , Nicholas C. Wormald Enumeration of P 4 -Free Chordal Graphs. [Citation Graph (0, 0)][DBLP ] Graphs and Combinatorics, 2003, v:19, n:4, pp:467-474 [Journal ] Alan M. Frieze , Mark Jerrum , Michael Molloy , Robert W. Robinson , Nicholas C. Wormald Generating and Counting Hamilton Cycles in Random Regular Graphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:21, n:1, pp:176-198 [Journal ] Brendan D. McKay , Nicholas C. Wormald Uniform Generation of Random Regular Graphs of Moderate Degree. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1990, v:11, n:1, pp:52-67 [Journal ] Nicholas C. Wormald Generating Random Regular Graphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1984, v:5, n:2, pp:247-280 [Journal ] Edward A. Bender , Nicholas C. Wormald The asymptotic number of rooted nonseparable maps on a surface. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1988, v:49, n:2, pp:370-380 [Journal ] Marcus Brazil , T. Cole , J. H. Rubinstein , D. A. Thomas , J. F. Weng , Nicholas C. Wormald Minimal Steiner Trees for 2k ×2k Square Lattices. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1996, v:73, n:1, pp:91-110 [Journal ] Marcus Brazil , J. H. Rubinstein , D. A. Thomas , J. F. Weng , Nicholas C. Wormald Minimal Steiner Trees for Rectangular Arrays of Lattice Points. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1997, v:79, n:2, pp:181-208 [Journal ] Marcus Brazil , J. H. Rubinstein , D. A. Thomas , J. F. Weng , Nicholas C. Wormald Full Minimal Steiner Trees on Lattice Sets. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1997, v:78, n:1, pp:51-91 [Journal ] William H. Cunningham , Penny E. Haxell , R. Bruce Richter , Nicholas C. Wormald , Andrew Thomason To Adrian Bondy and U. S. R. Murty. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2004, v:90, n:1, pp:1- [Journal ] Zhicheng Gao , Nicholas C. Wormald The Distribution of the Maximum Vertex Degree in Random Planar Maps. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2000, v:89, n:2, pp:201-230 [Journal ] Catherine S. Greenhill , Jeong Han Kim , Nicholas C. Wormald Hamiltonian decompositions of random bipartite regular graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2004, v:90, n:2, pp:195-222 [Journal ] Bill Jackson , Nicholas C. Wormald Longest cycles in 3-connected planar graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:291-321 [Journal ] Bill Jackson , Nicholas C. Wormald Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K 1, d -Free Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1995, v:63, n:2, pp:163-169 [Journal ] Jeong Han Kim , Nicholas C. Wormald Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2001, v:81, n:1, pp:20-44 [Journal ] Boris Pittel , Joel Spencer , Nicholas C. Wormald Sudden Emergence of a Giantk -Core in a Random Graph. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1996, v:67, n:1, pp:111-151 [Journal ] Boris Pittel , Nicholas C. Wormald Asymptotic enumeration of sparse graphs with a minimum degree constraint. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2003, v:101, n:2, pp:249-263 [Journal ] Boris Pittel , Nicholas C. Wormald Counting connected graphs inside-out. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2005, v:93, n:2, pp:127-172 [Journal ] L. Bruce Richmond , Nicholas C. Wormald Almost All Maps Are Asymmetric. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:1-7 [Journal ] Dudley Stark , Nicholas C. Wormald Asymptotic Enumeration of Convex Polygons. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:196-217 [Journal ] Ian M. Wanless , Nicholas C. Wormald Regular Graphs with No Homomorphisms onto Cycles. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2001, v:82, n:1, pp:155-160 [Journal ] William Duckworth , Nicholas C. Wormald , Michele Zito A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2003, v:1, n:1, pp:67-76 [Journal ] J. H. Rubinstein , D. A. Thomas , Nicholas C. Wormald A polynomial algorithm for a constrained traveling salesman problem. [Citation Graph (0, 0)][DBLP ] Networks, 2001, v:38, n:2, pp:68-75 [Journal ] Tom Bohman , Alan M. Frieze , Nicholas C. Wormald Avoidance of a giant component in half the edge set of a random graph. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2004, v:25, n:4, pp:432-449 [Journal ] Sheng Bau , Nicholas C. Wormald , Sanming Zhou Decycling numbers of random regular graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:21, n:3-4, pp:397-413 [Journal ] Edward A. Bender , L. Bruce Richmond , Nicholas C. Wormald Largest 4-Connected Components of 3-Connected Planar Triangulations. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1995, v:7, n:4, pp:273-286 [Journal ] William Duckworth , Nicholas C. Wormald Minimum independent dominating sets of random cubic graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:21, n:2, pp:147-161 [Journal ] Ian G. Enting , Anthony J. Guttmann , L. Bruce Richmond , Nicholas C. Wormald Enumeration of Almost-Convex Polygons on the Square Lattice. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1992, v:3, n:4, pp:445-462 [Journal ] Michael Krivelevich , Benny Sudakov , Van H. Vu , Nicholas C. Wormald Random regular graphs of high degree. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2001, v:18, n:4, pp:346-363 [Journal ] Michael Krivelevich , Benny Sudakov , Van H. Vu , Nicholas C. Wormald On the probability of independent sets in random graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2003, v:22, n:1, pp:1-14 [Journal ] Brendan D. McKay , Nicholas C. Wormald The degree sequence of a random graph. I. The models. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1997, v:11, n:2, pp:97-117 [Journal ] Robert W. Robinson , Nicholas C. Wormald Hamilton cycles containing randomly selected edges in random regular graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2001, v:19, n:2, pp:128-147 [Journal ] Robert W. Robinson , Nicholas C. Wormald Almost All Cubic Graphs Are Hamiltonian. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1992, v:3, n:2, pp:117-126 [Journal ] Robert W. Robinson , Nicholas C. Wormald Almost All Regular Graphs Are Hamiltonian. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1994, v:5, n:2, pp:363-374 [Journal ] Michael S. O. Molloy , Hanna D. Robalewska , Robert W. Robinson , Nicholas C. Wormald 1-Factorizations of random regular graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1997, v:10, n:3, pp:305-321 [Journal ] Nicholas C. Wormald The perturbation method and triangle-free random graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1996, v:9, n:1-2, pp:253-269 [Journal ] Nicholas C. Wormald Generating Random Unlabelled Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1987, v:16, n:4, pp:717-727 [Journal ] M. Carter , Michael D. Hendy , David Penny , László A. Székely , Nicholas C. Wormald On the Distribution of Lengths of Evolutionary Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1990, v:3, n:1, pp:38-47 [Journal ] Zhicheng Gao , Nicholas C. Wormald The Size of the Largest Components in Random Planar Maps. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:2, pp:217-228 [Journal ] J. H. Rubinstein , D. A. Thomas , Nicholas C. Wormald Steiner Trees for Terminals Constrained to Curves. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1997, v:10, n:1, pp:1-17 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:307, n:3, pp:531-547 [Journal ] Jaroslav Nesetril , Nicholas C. Wormald The acyclic edge chromatic number of a random d -regular graph is d + 1. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2005, v:49, n:1, pp:69-74 [Journal ] Stefanie Gerke , Catherine S. Greenhill , Nicholas C. Wormald The generalized acyclic edge chromatic number of random regular graphs. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2006, v:53, n:2, pp:101-125 [Journal ] Julie Anne Cain , Peter Sanders , Nicholas C. Wormald The random graph threshold for k -orientiability and a fast algorithm for optimal multiple-choice allocation. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:469-476 [Conf ] Nicholas C. Wormald Counting unrooted planar maps. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1981, v:36, n:2, pp:205-225 [Journal ] Edward A. Bender , Nicholas C. Wormald The number of loopless planar maps. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1985, v:54, n:2, pp:235-237 [Journal ] E. Rodney Canfield , Nicholas C. Wormald Ménage numbers, bijections and P-recursiveness. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1987, v:63, n:2-3, pp:117-129 [Journal ] László A. Székely , Nicholas C. Wormald Bounds on the measurable chromatic number of Rn . [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1989, v:75, n:1-3, pp:343-372 [Journal ] Terri Lindquester , Nicholas C. Wormald Factorisation of regular graphs into forests of short paths. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:186, n:1-3, pp:217-226 [Journal ] Bill Jackson , Nicholas C. Wormald On the linear k-arboricity of cubic graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:162, n:1-3, pp:293-297 [Journal ] Joseph Lauer , Nicholas C. Wormald Large independent sets in regular graphs of large girth. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2007, v:97, n:6, pp:999-1009 [Journal ] Josep Díaz , Maria J. Serna , Nicholas C. Wormald Bounds on the bisection width for random d -regular graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:382, n:2, pp:120-130 [Journal ] Cleaning Random d -Regular Graphs with Brushes Using a Degree-Greedy Algorithm. [Citation Graph (, )][DBLP ] Load balancing and orientability thresholds for random hypergraphs. [Citation Graph (, )][DBLP ] Constrained Path Optimisation for Underground Mine Layout. [Citation Graph (, )][DBLP ] Representing Small Group Evolution. [Citation Graph (, )][DBLP ] Birth control for giants. [Citation Graph (, )][DBLP ] Encores on Cores. [Citation Graph (, )][DBLP ] Colouring Random 4-Regular Graphs. [Citation Graph (, )][DBLP ] Colouring Random Regular Graphs. [Citation Graph (, )][DBLP ] On the Independent Domination Number of Random Regular Graphs. [Citation Graph (, )][DBLP ] Induced Forests in Regular Graphs with Large Girth. [Citation Graph (, )][DBLP ] Fixed edge-length graph drawing is NP-hard. [Citation Graph (, )][DBLP ] Large forbidden trade volumes and edge packings of random graphs. [Citation Graph (, )][DBLP ] Expansion properties of a random regular graph after random vertex deletions. [Citation Graph (, )][DBLP ] Search in 0.024secs, Finished in 0.032secs