Nicholas Wormald

5.9k total citations
145 papers, 3.0k citations indexed

About

Nicholas Wormald is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Nicholas Wormald has authored 145 papers receiving a total of 3.0k indexed citations (citations by other indexed papers that have themselves been cited), including 78 papers in Discrete Mathematics and Combinatorics, 77 papers in Computational Theory and Mathematics and 48 papers in Geometry and Topology. Recurrent topics in Nicholas Wormald's work include Limits and Structures in Graph Theory (64 papers), Advanced Graph Theory Research (60 papers) and Graph theory and applications (39 papers). Nicholas Wormald is often cited by papers focused on Limits and Structures in Graph Theory (64 papers), Advanced Graph Theory Research (60 papers) and Graph theory and applications (39 papers). Nicholas Wormald collaborates with scholars based in Australia, Canada and United States. Nicholas Wormald's co-authors include Brendan D. McKay, Boris Pittel, Joel Spencer, Peter Eades, Zhicheng Gao, Bill Jackson, Edward A. Bender, Alan Frieze, Jaroslav Nešetřil and Robert W. Robinson and has published in prestigious journals such as Transactions of the American Mathematical Society, SIAM Journal on Computing and Advances in Mathematics.

In The Last Decade

Nicholas Wormald

143 papers receiving 2.7k citations

Peers

Countries citing papers authored by Nicholas Wormald

Since Specialization

Citations

This map shows the geographic impact of Nicholas Wormald's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Nicholas Wormald with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nicholas Wormald more than expected).

Fields of papers citing papers by Nicholas Wormald

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Nicholas Wormald. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Nicholas Wormald. The network helps show where Nicholas Wormald may publish in the future.

Co-authorship network of co-authors of Nicholas Wormald

This figure shows the co-authorship network connecting the top 25 collaborators of Nicholas Wormald. A scholar is included among the top collaborators of Nicholas Wormald based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Nicholas Wormald. Nicholas Wormald is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Enumeration of graphs with a heavy-tailed degree sequence 2015 ·Advances in Mathematics ·Pu Gao, Nicholas Wormald	10
2	Induced subgraphs in sparse random graphs with given degree sequences 2012 ·European Journal of Combinatorics ·Pu Gao, Yi Su, Nicholas Wormald	2
3	Constrained Path Optimisation for Underground Mine Layout 2007 ·World Congress on Engineering ·Marcus Brazil, Peter Grossman, David H. Lee, J Rubinstein, D. A. Thomas, Nicholas Wormald	2
4	A PTAS for the sparsest 2-spanner of 4-connected planar triangulations 2003 ·Journal of Discrete Algorithms ·(unknown), Nicholas Wormald, Michele Zito	7
5	Analysis of greedy algorithms on graphs with bounded degrees 2003 ·Discrete Mathematics ·Nicholas Wormald	24
6	The Acyclic Edge Chromatic Number of a Random d-Regular Graph is d + 1 2001 ·Jaroslav Nešetřil, Nicholas Wormald	32
7	More on the linear k-arboricity of regular graphs 1998 ·The Australasian Journal of Combinatorics ·R. E. L. Aldred, Nicholas Wormald	18
8	Small hypohamiltonian graphs 1997 ·Journal of Combinatorial Mathematics and Combinatorial Computing ·R. E. L. Aldred, Brendan D. McKay, Nicholas Wormald	14
9	Reconstruction of rooted trees from subtrees 1996 ·Discrete Applied Mathematics ·(unknown), Nicholas Wormald	44
10	Performance guarantees for motion planning with temporal uncertainty 1993 ·Australian Computer Journal ·Peter Eades, Xin Lin, Nicholas Wormald	8
11	Submaps of maps IV: Degree restricted nonplanar maps 1993 ·Ars Combinatoria ·Edward A. Bender, L. Bruce Richmond, Nicholas Wormald	1
12	Uniform generation of random Latin rectangles 1991 ·Journal of Combinatorial Mathematics and Combinatorial Computing ·Brendan D. McKay, Nicholas Wormald	7
13	k-walks in graphs 1990 ·The Australasian Journal of Combinatorics ·Bill Jackson, Nicholas Wormald	36
14	Fixed edge-length graph drawing is NP-hard 1990 ·Discrete Applied Mathematics ·Peter Eades, Nicholas Wormald	17
15	Asymptotic Enumeration by Degree Sequence of Graphs of High Degree 1990 ·European Journal of Combinatorics ·Brendan D. McKay, Nicholas Wormald	83
16	Hamilton-like indices of graphs 1983 ·Ars Combinatoria ·Lane Clark, Nicholas Wormald	7
17	Regular graphs with prescribed odd girth 1983 ·Norman J. Pullman, Nicholas Wormald	5
18	A correspondence for rooted planar maps 1980 ·Ars Combinatoria ·Nicholas Wormald	7
19	On the Number of Automorphisms of a Regular Graph 1979 ·Proceedings of the American Mathematical Society ·Nicholas Wormald	2
20	On the number of automorphisms of a regular graph 1979 ·Proceedings of the American Mathematical Society ·Nicholas Wormald	3

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact