Recent papers of Nick Wormald.

Descriptions of the papers are found here.

  1. R.E.L. Aldred, B.D. McKay and N.C. Wormald, Small hypohamiltonian graphs, J. Combinatorial Mathematics and Combinatorial Computing 23 (1997), 143-152.

  2. M. Molloy, H. Robalewska, R.W. Robinson and N.C. Wormald, 1-factorisations of random regular graphs, Random Structures and Algorithms 10 (1997), 305-321.

  3. J.H. Rubinstein, D.A. Thomas and N.C. Wormald, Steiner trees for terminals constrained to curves, SIAM J. Discrete Math. 10 (1997), 1-17.

  4. B.D. McKay and N.C. Wormald, The degree sequence of a random graph. I. The models, Random Structures and Algorithms 11 (1997), 97-117.

  5. M. Brazil, J.H. Rubinstein, D.A. Thomas, J.F. Weng and N.C. Wormald, Full minimal Steiner trees on lattice sets, J. Combinatorial Theory, Series A 78 (1997), 51-91.

  6. M. Brazil, J.H. Rubinstein, D.A. Thomas, J.F. Weng and N.C. Wormald, Minimal Steiner trees for rectangular arrays of lattice points, J. Combinatorial Theory, Series A 79 (1997), 181-208.

  7. A. Rucinski and N.C. Wormald, Random graph processes with maximum degree 2, Annals of Applied Probability 7 (1997), 183-199.

  8. D. Stark and N.C. Wormald, The asymptotic number of d-dimensional convex polygons, J. Combinatorial Theory, Series A 80 (1997), 196-217.

  9. M. Brazil, J.H. Rubinstein, D.A. Thomas, J.F. Weng and N.C. Wormald, Shortest networks on spheres, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 40 (1998), 453-461.

  10. T. Lindquester and N.C. Wormald, Factorisation of regular graphs into forests of paths, Discrete Mathematics 186 (1998), 217-226.

  11. R.E.L. Aldred and N.C. Wormald, Linear k-arboricity of regular graphs, Australasian Journal of Combinatorics 18 (1998), 97-104.

  12. A. Moffat, O. Petersson and N.C. Wormald, A tree-based mergesort, Acta Informatica 35 (1998), 775--793.

  13. W.D. Smith and N.C. Wormald, Geometric separator theorems and applications. (Draft manuscript, 50 pages. ps.gz)

  14. W.D. Smith and N.C. Wormald, Geometric separator theorems and applications. In 39th Annual Symposium on Foundations of Computer Science -- FOCS '98, pages 232--243, Palo Alto, CA, 1998. ( ps.gz)

  15. A. Knopfmacher, A.M. Odlyzko, B. Pittel, L.B. Richmond, D. Stark, G. Szekeres and N. C. Wormald, The asymptotic number of set partitions with unequal block sizes, Electronic J. Combinatorics 6 (1999), R2 (36 pp). ps.gz

  16. N.C. Wormald, Models of random regular graphs. Surveys in Combinatorics, 1999, J.D. Lamb and D.A. Preece, eds. London Mathematical Society Lecture Note Series, vol 276, pp. 239--298. Cambridge University Press, Cambridge, 1999. A list of corrections and addenda may be found here.

  17. N.C. Wormald, The differential equation method for random graph processes and greedy algorithms, in Lectures on Approximation and Randomized Algorithms (M. Karonski and H.J. Proemel, eds), pp. 73--155. PWN, Warsaw, 1999. A list of corrections and addenda may be found here.

  18. Z. Gao and N.C. Wormald, The size of the largest components in random planar maps, SIAM J. Discrete Math. 12 (1999), 217--228.

  19. A. Steger and N.C. Wormald, Generating random regular graphs quickly. Combinatorics, Probab. and Comput. 8 (1999), 377--396.

  20. W. Duckworth, N.C. Wormald and M. Zito, Approximation algorithms for finding sparse 2-Spanners of 4-Connected planar triangulations, in Proc. Tenth Australasian Workshop on Combinatorial Algorithms, R.J. Simpson and R. Raman eds., Curtin University, Perth, pp. 63--75 (1999). ps.gz

  21. A. Telcs and N.C. Wormald, Branching and tree indexed random walks on fractals, J. Applied Probab. 36 (1999), 999--1011.

  22. M. Ng, M. Steel and N.C. Wormald, The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees, Discrete Applied Mathematics 98 (2000), 227--235.

  23. Z. Gao and N.C. Wormald, The distribution of the maximum vertex degree in random planar maps, J. Combinatorial Theory, Series A 89 (2000), 201--230.

  24. H.D. Robalewska and N.C. Wormald, Random star processes, Combinatorics, Probability and Computing 9 (2000), 33--43.

  25. J.H. Rubinstein, D.A. Thomas and N. C. Wormald, A polynomial algorithm for a constrained travelling salesman problem, Networks (in press). ps.gz

  26. N. Alon, V.J. Teague and N.C. Wormald, Linear arboricity and linear k-arboricity of regular graphs, Graphs and Combinatorics (in press). ps.gz

  27. Z. Gao and N.C. Wormald, Enumeration of rooted cubic planar maps, Annals of Combinatorics (in press). ps.gz

  28. W. Duckworth, N.C. Wormald and M. Zito, Maximum induced matchings of random cubic graphs, Sixth Annual International Computing and Combinatorics Conference (COCOON 2000) (in press). ps.gz

  29. J.H. Kim and N.C. Wormald, Random matchings which induce Hamilton cycles, and hamiltonian decompositions of random regular graphs, J. Combinatorial Theory, Series B (in press). ps.gz

  30. W. Duckworth, N.C. Wormald and M. Zito, A polynomial time approximation scheme for approximating a sparse 2-spanners of a 4-connected planar triangulation, preprint.

  31. A. Rucinski and N.C. Wormald, Connectedness of graphs generated by a random d-process, (preprint).

  32. E.A. Bender, Z. Gao and N.C. Wormald, The number of labeled 2-connected planar graphs, preprint.

  33. I.M. Wanless and N.C. Wormald, Regular graphs with no homomorphisms onto cycles, preprint. ps.gz

  34. Z. Gao and N.C. Wormald, Sharp concentration of the number of submaps in random planar triangulations, preprint.

  35. M. Brazil, D. Lee, J.H. Rubinstein, D.A. Thomas, J.F. Weng and N.C. Wormald, Network optimisation of underground mine designs, preprint.

  36. R.W. Robinson and N.C. Wormald, Hamilton cycles containing randomly selected edges in random cubic graphs, preprint. ps.gz

  37. W. Duckworth and N.C. Wormald, Minimum independent dominating sets of random cubic graphs, preprint.

  38. Z. Gao, I.M. Wanless and N.C. Wormald, Counting 5-connected planar triangulations, preprint.

  39. H. Assiyatun and N.C. Wormald, Covering regular graphs with forests of small trees, preprint.

  40. M. Krivelevich, B. Sudakov, V. Vu and N.C. Wormald, Random regular graphs of high degree, preprint.

  41. W. Duckworth, N.C. Wormald and M. Zito, Maximum induced matchings of random cubic graphs, preprint. ps.gz

  42. B.D. McKay, I.M. Wanless and N.C. Wormald, Asymptotic enumeration of graphs with a given upper bound on the maximum degree, preprint. ps.gz

  43. M. Krivelevich, B. Sudakov, V. Vu and N.C. Wormald, On the probability of independent sets in random graphs, preprint. ps.gz

This page, its contents and style, are the responsibility of the author and do not represent the views, policies or opinions of The University of Melbourne. Last updated by Nick Wormald 22/06/00.