Modularity of Erdős‐Rényi random graphs C McDiarmid, F Skerman Random Structures & Algorithms 57 (1), 211-243, 2020 | 41 | 2020 |
Assigning times to minimise reachability in temporal graphs J Enright, K Meeks, F Skerman Journal of Computer and System Sciences, 2020 | 37* | 2020 |
Modularity of regular and treelike graphs C McDiarmid, F Skerman Journal of Complex Networks, 2017 | 33* | 2017 |
Modularity in random regular graphs and lattices C McDiarmid, F Skerman Electronic Notes in Discrete Mathematics 43, 431-437, 2013 | 17 | 2013 |
Degree sequences of random digraphs and bipartite graphs BD McKay, F Skerman Journal of Combinatorics 7 (1), 29, 2016 | 14 | 2016 |
The modularity of random graphs on the hyperbolic plane J Chellig, N Fountoulakis, F Skerman Journal of Complex Networks 10 (1), cnab051, 2022 | 13 | 2022 |
No additional tournaments are quasirandom-forcing R Hancock, A Kabela, T Martins, R Parente, F Skerman, J Volec European Journal of Combinatorics 108, 103632, 2023 | 11 | 2023 |
The parameterised complexity of computing the maximum modularity of a graph K Meeks, F Skerman Algorithmica 82 (8), 2174-2199, 2020 | 11 | 2020 |
-cut on paths and some trees XS Cai, C Holmgren, L Devroye, F Skerman Electronic Journal of Probability 24, 2019 | 11* | 2019 |
Is it easier to count communities than find them? C Rush, F Skerman, AS Wein, D Yang arXiv preprint arXiv:2212.10872, 2022 | 8 | 2022 |
Inversions in split trees and conditional Galton–Watson trees XS Cai, C Holmgren, S Janson, T Johansson, F Skerman Combinatorics, Probability and Computing 28 (3), 335-364, 2019 | 7 | 2019 |
Guessing numbers of odd cycles R Atkins, P Rombach, F Skerman arXiv preprint arXiv:1602.03586, 2016 | 7 | 2016 |
Modularity of networks F Skerman University of Oxford, 2016 | 7 | 2016 |
Embedding small digraphs and permutations in binary trees and split trees M Albert, C Holmgren, T Johansson, F Skerman Algorithmica 82 (3), 589-615, 2020 | 6* | 2020 |
Avoider-Enforcer star games A Grzesik, M Mikalački, ZL Nagy, A Naor, B Patkós, F Skerman Discrete Mathematics & Theoretical Computer Science 17 (1), 2015 | 6 | 2015 |
Random tree recursions: Which fixed points correspond to tangible sets of trees? T Johnson, M Podder, F Skerman Random Structures & Algorithms 56 (3), 796-837, 2020 | 5 | 2020 |
Degree sequences of random bipartite graphs F Skerman Honours Thesis, The Australian National University, 2010 | 5 | 2010 |
From flip processes to dynamical systems on graphons F Garbe, J Hladký, M Šileikis, F Skerman arXiv preprint arXiv:2201.12272, 2022 | 4 | 2022 |
Modularity and edge sampling C McDiarmid, F Skerman arXiv preprint arXiv:2112.13190, 2021 | 4 | 2021 |
Finding large expanders in graphs: from topological minors to induced subgraphs B Louf, F Skerman arXiv preprint arXiv:2012.15722, 2020 | 4 | 2020 |