Get started
Author

Fiona Skerman

Observed names: FIONA SKERMAN, Skerman, Fiona
Institution: Uppsala University
ORCID: 0000-0003-4141-7059
Observed ORCID: 0000-0003-4141-7059
OpenAlex ID: A5037558079
Assigning times to minimise reachability in temporal graphs
2020 · Jessica Enright, Kitty Meeks, et al. · Journal of Computer and System Sciences · 26
PDF
Modularity of Erdős‐Rényi random graphs
2020 · Colin McDiarmid, Fiona Skerman · Random Structures and Algorithms · 25
Modularity of regular and treelike graphs
2018 · Skerman, Fiona, McDiarmid, Colin · Explore Bristol Research · 22
Modularity in random regular graphs and lattices
2013 · Colin McDiarmid, Fiona Skerman · Electronic Notes in Discrete Mathematics · 12
No additional tournaments are quasirandom-forcing
2022 · Robert Hancock, Adam Kabela, et al. · European Journal of Combinatorics · 10
Degree sequences of random digraphs and bipartite graphs
2015 · Brendan D. McKay, Fiona Skerman · Journal of Combinatorics · 9
PDF
$k$-cut on paths and some trees
2019 · Xing Shi Cai, Cecilia Holmgren, et al. · Electronic Journal of Probability · 8
The modularity of random graphs on the hyperbolic plane
2021 · Jordan Chellig, Nikolaos Fountoulakis, et al. · Journal of Complex Networks · 6
PDF
Random tree recursions: Which fixed points correspond to tangible sets of trees?
2019 · Tobias Johnson, Moumanti Podder, et al. · Random Structures and Algorithms · 5
Inversions in Split Trees and Conditional Galton–Watson Trees
2018 · XING SHI CAI, CECILIA HOLMGREN, et al. · Combinatorics Probability Computing · 5
PDF
Modularity of tree-like and random regular graphs
2017 · Colin McDiarmid, Fiona Skerman · arXiv (Cornell University) · 5
Modularity of Erdös-Rényi Random Graphs
2018 · McDiarmid, Colin, Skerman, Fiona · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 4
PDF
Modularity of regular and treelike graphs
2017 · Colin McDiarmid, Fiona Skerman · Journal of Complex Networks · 4
PDF
Modularity of networks
2015 · Skerman, Fiona · Oxford University Research Archive (ORA) (University of Oxford) · 4
Finding Large Expanders in Graphs: from Topological Minors to Induced Subgraphs
2023 · Baptiste Louf, Fiona Skerman · The Electronic Journal of Combinatorics · 2
PDF
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
2019 · Kitty Meeks, Fiona Skerman · Algorithmica · 2
PDF
Permutations in Binary Trees and Split Trees
2018 · Albert, Michael, Holmgren, Cecilia, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2
PDF
Guessing Numbers of Odd Cycles
2017 · Ross Atkins, Puck Rombach, et al. · The Electronic Journal of Combinatorics · 2
From flip processes to dynamical systems on graphons
2024 · Frederik Garbe, Jan Hladký, et al. · Annales de l Institut Henri Poincaré Probabilités et Statistiques · 1
PDF
Modularity and partially observed graphs
2021 · McDiarmid, Colin, Skerman, Fiona · arXiv (Cornell University) · 1
PDF
$$k$$-cuts on a Path
2019 · Xing Shi Cai, Luc Devroye, et al. · Lecture notes in computer science · 1
Cutting resilient networks
2018 · Xing Shi Cai, Luc Devroye, et al. · arXiv (Cornell University) · 1
Avoider-enforcer star games
2015 · Andrzej Grzesik, Mirjana Mikalački, et al. · Discrete Mathematics & Theoretical Computer Science · 1
PDF
Approximating temporal modularity on graphs of small underlying treewidth
2026 · Vilhelm Agdur, Jessica Enright, et al. · Theoretical Computer Science
On Graphs with Modularity Zero or Near-Zero
2026 · Colin McDiarmid, Fiona Skerman · The Electronic Journal of Combinatorics
PDF
Works count: 47
Citation count: 158
H-index: 7
I10-index: 5
Year
Topic
Type