I agree that this site is using cookies. You can find further informations here.
X
Wormald, Nicholas
175  results:
Search for persons X
?
1

Component Games on Random Graphs:

Hod, Rani ; Krivelevich, Michael ; Müller, Tobias..
Combinatorica.  42 (2022)  S1 - p. 1189-1229 , 2022
Link: https://doi.org/10.1007/..
 
?
2

Fast uniform generation of random graphs with given degree ..:

Arman, Andrii ; Gao, Pu ; Wormald, Nicholas
Random Structures & Algorithms.  59 (2021)  3 - p. 291-314 , 2021
Link: https://doi.org/10.1002/..
 
?
3

Meyniel's conjecture holds for random d‐regular graphs:

Prałat, Paweł ; Wormald, Nicholas
Random Structures & Algorithms.  55 (2019)  3 - p. 719-741 , 2019
Link: https://doi.org/10.1002/..
 
?
4

Fast Uniform Generation of Random Graphs with Given Degree ..:

, In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS),
Arman, Andrii ; Gao, Pu ; Wormald, Nicholas - p. 1371-1379 , 2019
Link: https://doi.org/10.1109/..
 
?
5

Uniform generation of random graphs with power-law degree s..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Gao, Pu ; Wormald, Nicholas - p. 1741-1758 , 2018
Link: https://doi.org/10.1137/..
 
?
6

Uniform generation of random graphs with power-law degree s..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Gao, Pu ; Wormald, Nicholas - p. 1741-1758 , 2018
Link: https://dl.acm.org/doi/1..
 
?
7

Local Algorithms, Regular Graphs of Large Girth, and Random..:

Hoppen, Carlos ; Wormald, Nicholas
Combinatorica.  38 (2018)  3 - p. 619-664 , 2018
Link: https://doi.org/10.1007/..
 
?
8

Uniform Generation of Random Regular Graphs:

Gao, Pu ; Wormald, Nicholas
SIAM Journal on Computing.  46 (2017)  4 - p. 1395-1427 , 2017
Link: https://doi.org/10.1137/..
 
?
9

Minimum Power Dominating Sets of Random Cubic Graphs:

Kang, Liying ; Wormald, Nicholas
Journal of Graph Theory.  85 (2016)  1 - p. 152-171 , 2016
Link: https://doi.org/10.1002/..
 
?
10

Properties of regular graphs with large girth via local alg..:

Hoppen, Carlos ; Wormald, Nicholas
Journal of Combinatorial Theory, Series B.  121 (2016)  - p. 367-397 , 2016
Link: https://doi.org/10.1016/..
 
?
11

Enumeration of graphs with a heavy-tailed degree sequence:

Gao, Pu ; Wormald, Nicholas
Advances in Mathematics.  287 (2016)  - p. 412-450 , 2016
Link: https://doi.org/10.1016/..
 
?
12

Meyniel's conjecture holds for random graphs:

Prałat, Paweł ; Wormald, Nicholas
Random Structures & Algorithms.  48 (2015)  2 - p. 396-421 , 2015
Link: https://doi.org/10.1002/..
 
?
13

Cycle Factors and Renewal Theory:

Kahn, Jeff ; Lubetzky, Eyal ; Wormald, Nicholas
Communications on Pure and Applied Mathematics.  70 (2015)  2 - p. 289-339 , 2015
Link: https://doi.org/10.1002/..
 
?
14

The threshold for combs in random graphs:

Kahn, Jeff ; Lubetzky, Eyal ; Wormald, Nicholas
Random Structures & Algorithms.  48 (2015)  4 - p. 794-802 , 2015
Link: https://doi.org/10.1002/..
 
?
15

Orientability Thresholds for Random Hypergraphs:

GAO, PU ; WORMALD, NICHOLAS
Combinatorics, Probability and Computing.  24 (2015)  5 - p. 774-824 , 2015
Link: https://doi.org/10.1017/..
 
1-15