Load balancing and orientability thresholds for random hypergraphs P Gao, NC Wormald Proceedings of the forty-second ACM symposium on Theory of computing, 97-104, 2010 | 28 | 2010 |

Uniform generation of random regular graphs P Gao, N Wormald SIAM Journal on Computing 46 (4), 1395-1427, 2017 | 19 | 2017 |

Enumeration of graphs with a heavy-tailed degree sequence P Gao, N Wormald Advances in Mathematics 287, 412-450, 2016 | 19 | 2016 |

Arboricity and spanning-tree packing in random graphs with an application to load balancing P Gao, X Pérez-Giménez, CM Sato Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014 | 19* | 2014 |

On the longest paths and the diameter in random Apollonian networks E Ebrahimzadeh, L Farczadi, P Gao, A Mehrabian, CM Sato, N Wormald, ... Electronic Notes in Discrete Mathematics 43, 355-365, 2013 | 14 | 2013 |

The satisfiability threshold for random linear equations P Ayre, A Coja-Oghlan, P Gao, N Müller Combinatorica 40 (2), 179-235, 2020 | 11 | 2020 |

Uniform generation of random graphs with power-law degree sequences P Gao, N Wormald Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 10 | 2018 |

Orientability thresholds for random hypergraphs P Gao, N Wormald Combinatorics, Probability and Computing 24 (5), 774-824, 2015 | 10 | 2015 |

On the geometric Ramsey number of outerplanar graphs J Cibulka, P Gao, M Krčál, T Valla, P Valtr Discrete & Computational Geometry 53 (1), 64-79, 2015 | 10 | 2015 |

On longest paths and diameter in random Apollonian networks E Ebrahimzadeh, L Farczadi, P Gao, A Mehrabian, CM Sato, N Wormald, ... Random structures & algorithms 45 (4), 703-725, 2014 | 10 | 2014 |

The stripping process can be slow: part I P Gao, M Molloy Random Structures & Algorithms 53 (1), 76-139, 2018 | 8 | 2018 |

Full rainbow matchings in graphs and hypergraphs P Gao, R Ramadurai, I Wanless, N Wormald arXiv preprint arXiv:1709.02665, 2017 | 8 | 2017 |

Induced subgraphs in sparse random graphs with given degree sequences P Gao, Y Su, N Wormald European Journal of Combinatorics 33 (6), 1142-1166, 2012 | 8 | 2012 |

Short cycle distribution in random regular graphs recursively generated by pegging P Gao, N Wormald Random Structures & Algorithms 34 (1), 54-86, 2009 | 8 | 2009 |

Sandwiching random regular graphs between binomial random graphs P Gao, M Isaev, BD McKay Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 7 | 2020 |

Counting triangles in power-law uniform random graphs P Gao, R van der Hofstad, A Southwell, C Stegehuis arXiv preprint arXiv:1812.04289, 2018 | 7 | 2018 |

Distributions of sparse spanning subgraphs in random graphs P Gao SIAM Journal on Discrete Mathematics 27 (1), 386-401, 2013 | 7* | 2013 |

Uniform Generation of *d*-Factors in Dense Host GraphsP Gao Graphs and Combinatorics 30 (3), 581-589, 2014 | 5 | 2014 |

Analysis of the parallel peeling algorithm: a short proof P Gao arXiv preprint arXiv:1402.7326, 2014 | 5 | 2014 |

Connectivity of random regular graphs generated by the pegging algorithm P Gao Journal of Graph Theory 65 (3), 185-197, 2010 | 5 | 2010 |