Follow
Fiona Skerman
Fiona Skerman
Verified email at math.uu.se - Homepage
Title
Cited by
Cited by
Year
Modularity of regular and treelike graphs
C McDiarmid, F Skerman
Journal of Complex Networks, 2017
22*2017
Assigning times to minimise reachability in temporal graphs
J Enright, K Meeks, F Skerman
Journal of Computer and System Sciences, 2020
212020
Modularity of Erdős‐Rényi random graphs
C McDiarmid, F Skerman
Random Structures & Algorithms 57 (1), 211-243, 2020
182020
Modularity in random regular graphs and lattices
C McDiarmid, F Skerman
Electronic Notes in Discrete Mathematics 43, 431-437, 2013
142013
Degree sequences of random digraphs and bipartite graphs
BD McKay, F Skerman
Journal of Combinatorics 7 (1), 29, 2016
112016
-cut on paths and some trees
XS Cai, C Holmgren, L Devroye, F Skerman
Electronic Journal of Probability 24, 2019
10*2019
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
72019
Guessing numbers of odd cycles
R Atkins, P Rombach, F Skerman
arXiv preprint arXiv:1602.03586, 2016
72016
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
42020
No additional tournaments are quasirandom-forcing
R Hancock, A Kabela, D Kral, T Martins, R Parente, F Skerman, J Volec
arXiv preprint arXiv:1912.04243, 2019
42019
Modularity of networks
F Skerman
University of Oxford, 2016
42016
Degree sequences of random bipartite graphs
F Skerman
Honours Thesis, The Australian National University, 2010
42010
The parameterised complexity of computing the maximum modularity of a graph
K Meeks, F Skerman
Algorithmica 82 (8), 2174-2199, 2020
32020
Permutations in binary trees and split trees
M Albert, C Holmgren, T Johansson, F Skerman
29th International Conference on Probabilistic, Combinatorial and Asymptotic …, 2018
32018
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
32015
Finding large expanders in graphs: from topological minors to induced subgraphs
B Louf, F Skerman
arXiv preprint arXiv:2012.15722, 2020
22020
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
22020
-cuts on a Path
XS Cai, L Devroye, C Holmgren, F Skerman
International Conference on Algorithms and Complexity, 112-123, 2019
22019
The modularity of random graphs on the hyperbolic plane
J Chellig, N Fountoulakis, F Skerman
Journal of Complex Networks 10 (1), cnab051, 2022
12022
From flip processes to dynamical systems on graphons
F Garbe, J Hladký, M Šileikis, F Skerman
arXiv preprint arXiv:2201.12272, 2022
12022
The system can't perform the operation now. Try again later.
Articles 1–20