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

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 | 34 | 2010 |

Fast uniform generation of random graphs with given degree sequences A Arman, P Gao, N Wormald Random Structures & Algorithms 59 (3), 291-314, 2021 | 30 | 2021 |

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

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

Uniform generation of random graphs with power-law degree sequences P Gao, N Wormald arXiv preprint arXiv:1709.02674, 2017 | 24 | 2017 |

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 | 21* | 2014 |

Full rainbow matchings in graphs and hypergraphs P Gao, R Ramadurai, IM Wanless, N Wormald Combinatorics, Probability and Computing 30 (5), 762-780, 2021 | 20 | 2021 |

The rank of sparse random matrices A Coja-Oghlan, AA Ergür, P Gao, S Hetterich, M Rolvien Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 19 | 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 | 18 | 2018 |

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 | 16 | 2020 |

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 | 16 | 2013 |

Mixing time of the switch Markov chain and stable degree sequences P Gao, C Greenhill Discrete Applied Mathematics 291, 143-162, 2021 | 15 | 2021 |

Perfect matchings in the semirandom graph process P Gao, C MacRury, P Prałat SIAM Journal on Discrete Mathematics 36 (2), 1274-1290, 2022 | 14 | 2022 |

Hamilton cycles in the semi-random graph process P Gao, B Kamiński, C MacRury, P Prałat European Journal of Combinatorics 99, 103423, 2022 | 14 | 2022 |

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 | 13 | 2014 |

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

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

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 | 10 | 2012 |

Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity P Gao, Y Ohapkin Random Structures & Algorithms 62 (4), 911-934, 2023 | 9 | 2023 |