Get started
Author

Nick Wormald

Observed names: NICK WORMALD, Wormald, Nick
Institution: Monash University
OpenAlex ID: A5114032336
The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation
2007 · J Cain, Peter Sanders, et al. · 57
Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
2023 · Anita Liebenau, Nick Wormald · Journal of the European Mathematical Society · 31
On the Push&Pull Protocol for Rumor Spreading
2017 · Hüseyin Acan, Andrea Collevecchio, et al. · SIAM Journal on Discrete Mathematics · 16
The Number of Satisfying Assignments of Random Regulark-SAT Formulas
2018 · AMIN COJA-OGHLAN, NICK WORMALD · Combinatorics Probability Computing · 15
PDF
Meyniel's conjecture holds for random graphs
2013 · Pralat, Pawel, Wormald, Nick · arXiv (Cornell University) · 14
PDF
Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs
2014 · Brett Kolesnik, Nick Wormald · SIAM Journal on Discrete Mathematics · 13
PDF
A Weight-based Information Filtration Algorithm for Stock-correlation Networks
2020 · Seyed Soheil Hosseini, Nick Wormald, et al. · Physica A Statistical Mechanics and its Applications · 12
PDF
On the Push&Pull Protocol for Rumour Spreading
2015 · Huseyin Acan, Andrea Collevecchio, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 11
On longest paths and diameter in random apollonian networks
2014 · Ehsan Ebrahimzadeh, Linda Farczadi, et al. · Random Structures and Algorithms · 10
Geodesics and almost geodesic cycles in random regular graphs
2010 · Itai Benjamini, Carlos Hoppen, et al. · Journal of Graph Theory · 10
PDF
Enumeration of P 4 -Free Chordal Graphs
2003 · Robert Castelo, Nick Wormald · Graphs and Combinatorics · 10
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
2022 · Anita Liebenau, Nick Wormald · Random Structures and Algorithms · 9
PDF
The number of satisfying assignments of random regular k-SAT formulas
2016 · Coja-Oghlan, Amin, Wormald, Nick · arXiv (Cornell University) · 8
PDF
On the Longest Paths and the Diameter in Random Apollonian Networks
2013 · Ebrahimzadeh, Ehsan, Farczadi, Linda, et al. · arXiv (Cornell University) · 8
PDF
On the push&pull protocol for rumour spreading
2014 · Acan, Huseyin, Collevecchio, Andrea, et al. · arXiv (Cornell University) · 7
PDF
On the Longest Paths and the Diameter in Random Apollonian Networks
2013 · Ehsan Ebrahimzadeh, Linda Farczadi, et al. · Electronic Notes in Discrete Mathematics · 7
The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph
2018 · DUDLEY STARK, NICK WORMALD · Combinatorics Probability Computing · 6
PDF
Almost all 5‐regular graphs have a 3‐flow
2019 · Paweł Prałat, Nick Wormald · Journal of Graph Theory · 5
On the Push&Pull Protocol for Rumour Spreading
2017 · Hüseyin Acan, Andrea Collevecchio, et al. · Trends in mathematics · 5
On the stretch factor of randomly embedded random graphs
2016 · Abbas Mehrabian, Nick Wormald · 5
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence
2022 · Daniel Allendorf, Ulrich Meyer, et al. · Society for Industrial and Applied Mathematics eBooks · 3
PDF
Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees
2016 · Andrea Collevecchio, Abbas Mehrabian, et al. · Journal of Applied Probability · 3
Asymptotic enumeration of sparse connected 3-uniform hypergraphs
2014 · Sato, Cristiane M., Wormald, Nick · arXiv (Cornell University) · 3
PDF
Multivariate asymptotic normality determined by high moments
2024 · Paweł Hitczenko, Nick Wormald · Proceedings of the American Mathematical Society · 2
PDF
The height of depth‐weighted random recursive trees
2020 · Kevin Leckey, Dieter Mitsche, et al. · Random Structures and Algorithms · 2
Works count: 48
Citation count: 278
H-index: 10
I10-index: 11
Year
Topic
Type