| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Fabiano C. Botelho, Nicholas C. Wormald, Nivio Ziviani |
Cores of random r-partite hypergraphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pu Gao, Yi Su, Nicholas C. Wormald |
Induced subgraphs in sparse random graphs with given degree sequences. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald |
Regular induced subgraphs of a random Graph. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefanie Gerke, Angelika Steger, Nicholas C. Wormald |
Pegging Graphs Yields a Small Diameter. |
Combinatorics, Probability & Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Pralat, Jacques Verstraëte, Nicholas C. Wormald |
On the threshold for k-regular subgraphs of random graphs. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Itai Benjamini, Carlos Hoppen, Eran Ofek, Pawel Pralat, Nicholas C. Wormald |
Geodesics and almost geodesic cycles in random regular graphs. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Müller, Xavier Pérez-Giménez, Nicholas C. Wormald |
Disjoint Hamilton cycles in the random geometric graph. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | William Duckworth, Nicholas C. Wormald |
Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs. |
Electr. J. Comb. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Edward A. Bender, Adri B. Olde Daalhuis, Zhicheng Gao, L. Bruce Richmond, Nicholas C. Wormald |
Asymptotics of Some Convolutional Recurrences. |
Electr. J. Comb. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oliver Riordan, Nicholas C. Wormald |
The Diameter of Sparse Random Graphs. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pu Gao, Nicholas C. Wormald |
Orientability thresholds for random hypergraphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pu Gao, Nicholas C. Wormald |
Load balancing and orientability thresholds for random hypergraphs. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pu Gao, Nicholas C. Wormald |
Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pu Gao, Nicholas C. Wormald |
Short cycle distribution in random regular graphs recursively generated by pegging. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Whitman Richards, Nicholas C. Wormald |
Representing Small Group Evolution. |
CSE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas C. Wormald, Sanming Zhou |
Large forbidden trade volumes and edge packings of random graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Catherine S. Greenhill, Fred B. Holt, Nicholas C. Wormald |
Expansion properties of a random regular graph after random vertex deletions. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhicheng Gao, Nicholas C. Wormald |
Distribution of subgraphs of random regular graphs. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Hoppen, Nicholas C. Wormald |
Induced Forests in Regular Graphs with Large Girth. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Pawel Pralat, Nicholas C. Wormald |
Cleaning Regular Graphs with Brushes. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Josep Díaz, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald |
Walkers on the Cycle and the Grid. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Lauer, Nicholas C. Wormald |
Large independent sets in regular graphs of large girth. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Josep Díaz, Maria J. Serna, Nicholas C. Wormald |
Bounds on the bisection width for random d -regular graphs. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Nicholas C. Wormald |
Rainbow Hamilton cycles in random regular graphs. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | András Telcs, Nicholas C. Wormald, Sanming Zhou |
Hamiltonicity of random graphs produced by 2-processes. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Lingsheng Shi, Nicholas C. Wormald |
Colouring Random 4-Regular Graphs. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Lingsheng Shi, Nicholas C. Wormald |
Colouring Random Regular Graphs. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joel H. Spencer, Nicholas C. Wormald |
Birth control for giants. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Pralat, Nicholas C. Wormald |
Growing Protean Graphs. |
Internet Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
cleaning process, random d-regular graphs, degree-greedy algorithm, differential equations method |
| 1 | Hilda Assiyatun, Nicholas C. Wormald |
3-star factors in random d-regular graphs. |
Eur. J. Comb. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Julie Cain, Nicholas C. Wormald |
Encores on Cores. |
Electr. J. Comb. |
2006 |
DBLP BibTeX RDF |
|
| 1 | William Duckworth, Nicholas C. Wormald |
On the Independent Domination Number of Random Regular Graphs. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald |
The generalized acyclic edge chromatic number of random regular graphs. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas C. Wormald |
Analysis of Algorithms on the Cores of Random Graphs. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Pittel, Nicholas C. Wormald |
Counting connected graphs inside-out. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Nicholas C. Wormald |
Random k-Sat: A Tight Threshold For Moderately Growing k. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05D40, 68Q25 |
| 1 | Jaroslav Nesetril, Nicholas C. Wormald |
The acyclic edge chromatic number of a random d-regular graph is d + 1. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald |
Hamiltonian decompositions of random bipartite regular graphs. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Nicholas C. Wormald, Beata Wysocka |
Short Cycles in Random Regular Graphs. |
Electr. J. Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald |
Random Hypergraph Processes with Degree Restrictions. |
Graphs and Combinatorics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Josep Díaz, Maria J. Serna, Nicholas C. Wormald |
Computation of the Bisection Width for Random d-Regular Graphs. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Pittel, Nicholas C. Wormald |
Asymptotic enumeration of sparse graphs with a minimum degree constraint. |
J. Comb. Theory, Ser. A |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas C. Wormald |
Analysis of greedy algorithms on graphs with bounded degrees. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald |
On the probability of independent sets in random graphs. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald |
Connectedness Of The Degree Bounded Star Process. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Castelo, Nicholas C. Wormald |
Enumeration of P 4-Free Chordal Graphs. |
Graphs and Combinatorics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhicheng Gao, Nicholas C. Wormald |
Sharp Concentration of the Number of Submaps in Random Planar Triangulations. |
Combinatorica |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 05C30, 05A16, 05C80 |
| 1 | William Duckworth, Nicholas C. Wormald, Michele Zito |
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. |
J. Discrete Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Edward A. Bender, Zhicheng Gao, Nicholas C. Wormald |
The Number of Labeled 2-Connected Planar Graphs. |
Electr. J. Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | William Duckworth, Nicholas C. Wormald |
Minimum independent dominating sets of random cubic graphs. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheng Bau, Nicholas C. Wormald, Sanming Zhou |
Decycling numbers of random regular graphs. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald |
Permutation Pseudographs And Contiguity. |
Combinatorics, Probability & Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald |
Bisection of Random Cubic Graphs. |
RANDOM |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ian M. Wanless, Nicholas C. Wormald |
Regular Graphs with No Homomorphisms onto Cycles. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeong Han Kim, Nicholas C. Wormald |
Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | J. H. Rubinstein, Doreen A. Thomas, Nicholas C. Wormald |
A polynomial algorithm for a constrained traveling salesman problem. |
Networks |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald |
Random regular graphs of high degree. |
Random Struct. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert W. Robinson, Nicholas C. Wormald |
Hamilton cycles containing randomly selected edges in random regular graphs. |
Random Struct. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Vanessa Teague, Nicholas C. Wormald |
Linear Arboricity and Linear k-Arboricity of Regular Graphs. |
Graphs and Combinatorics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhicheng Gao, Nicholas C. Wormald |
The Distribution of the Maximum Vertex Degree in Random Planar Maps. |
J. Comb. Theory, Ser. A |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hanna D. Robalewska, Nicholas C. Wormald |
Random Star Processes. |
Combinatorics, Probability & Computing |
2000 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | William Duckworth, Nicholas C. Wormald, Michele Zito |
Maximum Induced Matchings of Random Cubic Graphs. |
COCOON |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Angelika Steger, Nicholas C. Wormald |
Generating Random Regular Graphs Quickly. |
Combinatorics, Probability & Computing |
1999 |
DBLP BibTeX RDF |
|
| 1 | Zhicheng Gao, Nicholas C. Wormald |
The Size of the Largest Components in Random Planar Maps. |
SIAM J. Discrete Math. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Terri Lindquester, Nicholas C. Wormald |
Factorisation of regular graphs into forests of short paths. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Alistair Moffat, Ola Petersson, Nicholas C. Wormald |
A Tree-Based Mergesort. |
Acta Inf. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Warren D. Smith, Nicholas C. Wormald |
Geometric Separator Theorems & Applications. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Dudley Stark, Nicholas C. Wormald |
Asymptotic Enumeration of Convex Polygons. |
J. Comb. Theory, Ser. A |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Nicholas C. Wormald |
The degree sequence of a random graph. I. The models. |
Random Struct. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael S. O. Molloy, Hanna D. Robalewska, Robert W. Robinson, Nicholas C. Wormald |
1-Factorizations of random regular graphs. |
Random Struct. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | J. H. Rubinstein, Doreen A. Thomas, Nicholas C. Wormald |
Steiner Trees for Terminals Constrained to Curves. |
SIAM J. Discrete Math. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Pittel, Joel Spencer, Nicholas C. Wormald |
Sudden Emergence of a Giantk-Core in a Random Graph. |
J. Comb. Theory, Ser. B |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Bill Jackson, Nicholas C. Wormald |
On the linear k-arboricity of cubic graphs. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas C. Wormald |
The perturbation method and triangle-free random graphs. |
Random Struct. Algorithms |
1996 |
DBLP BibTeX RDF |
|
| 1 | Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald |
Generating and Counting Hamilton Cycles in Random Regular Graphs. |
J. Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech |
A Family of Perfect Hashing Methods. |
Comput. J. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Meei Pyng Ng, Nicholas C. Wormald |
Reconstruction of Rooted Trees From Subtrees. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Bruce Richmond, Nicholas C. Wormald |
Almost All Maps Are Asymmetric. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Edward A. Bender, L. Bruce Richmond, Nicholas C. Wormald |
Largest 4-Connected Components of 3-Connected Planar Triangulations. |
Random Struct. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Eades, Nicholas C. Wormald |
Edge Crossings in Drawings of Bipartite Graphs. |
Algorithmica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert W. Robinson, Nicholas C. Wormald |
Almost All Regular Graphs Are Hamiltonian. |
Random Struct. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhicheng Gao, Nicholas C. Wormald |
Spanning eulerian subgraphs of bounded degree in triangulations. |
Graphs and Combinatorics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter J. Cameron, Cheryl E. Praeger, Nicholas C. Wormald |
Infinite highly arc transitive digraphs and universal covering digraphs. |
Combinatorica |
1993 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")