Fiona Skerman

36 papers A 2B 1C 5Journal 27Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Note on edge expansion and modularity in preferential attachment graphs.
CoRR
Colin McDiarmid, Katarzyna Rybarczyk, Fiona Skerman, Malgorzata Sulkowska
2025 — conf
Approximating Temporal Modularity on Graphs of Small Underlying Treewidth.
ALGOWIN
Vilhelm Agdur, Jessica A. Enright, Laura Larios-Jones, Kitty Meeks, Fiona Skerman, Ella Yates
2025 J jnl
Approximating temporal modularity on graphs of small underlying treewidth.
CoRR
Vilhelm Agdur, Jessica A. Enright, Laura Larios-Jones, Kitty Meeks, Fiona Skerman, Ella Yates
2025 J jnl
Logical Limit Laws for Mallows Random Permutations.
Electron. J. Comb.
Tobias Müller, Fiona Skerman, Teun W. Verstraaten
2025 J jnl
Modularity and random graphs.
CoRR
Colin McDiarmid, Fiona Skerman
2024 J jnl
Fast and Accurate Algorithms to Calculate Expected Modularity in Probabilistic Networks.
CoRR
Xin Shen, Matteo Magnani, Christian Rohner, Fiona Skerman
2024 A conf
Modularity and Graph Expansion.
ITCS
Baptiste Louf, Colin McDiarmid, Fiona Skerman
2023 J jnl
Finding Large Expanders in Graphs: from Topological Minors to Induced Subgraphs.
Electron. J. Comb.
Baptiste Louf, Fiona Skerman
2023 A conf
Is It Easier to Count Communities Than Find Them?
ITCS
Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang
2023 J jnl
Modularity of very dense graphs.
CoRR
Colin McDiarmid, Fiona Skerman
2023 J jnl
No additional tournaments are quasirandom-forcing.
Eur. J. Comb.
Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec
2023 J jnl
Universal lower bound for community structure of sparse graphs.
CoRR
Vilhelm Agdur, Nina Kamcev, Fiona Skerman
2022 J jnl
Is it easier to count communities than find them?
CoRR
Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang
2021 J jnl
Assigning times to minimise reachability in temporal graphs.
J. Comput. Syst. Sci.
Jessica A. Enright, Kitty Meeks, Fiona Skerman
2021 J jnl
Modularity and edge sampling.
CoRR
Colin McDiarmid, Fiona Skerman
2021 C conf
Survival for a Galton-Watson tree with cousin mergers.
LAGOS
Laura Eslava, Sarah Penington, Fiona Skerman
2021 J jnl
The modularity of random graphs on the hyperbolic plane.
J. Complex Networks
Jordan Chellig, Nikolaos Fountoulakis, Fiona Skerman
2020 J jnl
Embedding Small Digraphs and Permutations in Binary Trees and Split Trees.
Algorithmica
Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman
2020 J jnl
Modularity of Erdős-Rényi random graphs.
Random Struct. Algorithms
Colin McDiarmid, Fiona Skerman
2020 J jnl
Random tree recursions: Which fixed points correspond to tangible sets of trees?
Random Struct. Algorithms
Tobias Johnson, Moumanti Podder, Fiona Skerman
2020 J jnl
The Parameterised Complexity of Computing the Maximum Modularity of a Graph.
Algorithmica
Kitty Meeks, Fiona Skerman
2019 J jnl
Inversions in Split Trees and Conditional Galton-Watson Trees.
Comb. Probab. Comput.
Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman
2019 J jnl
No additional tournaments are quasirandom-forcing.
CoRR
Robert Hancock, Adam Kabela, Daniel Král, Taísa L. Martins, Roberto Parente, Fiona Skerman, Jan Volec
2019 C conf
k -cuts on a Path.
CIAC
Xing Shi Cai, Luc Devroye, Cecilia Holmgren, Fiona Skerman
2018 C conf
Inversions in Split Trees and Conditional Galton-Watson Trees.
AofA
Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman
2018 C conf
Modularity of Erdös-Rényi Random Graphs.
AofA
Colin McDiarmid, Fiona Skerman
2018 J jnl
Modularity of Erdős-Rényi random graphs.
CoRR
Colin McDiarmid, Fiona Skerman
2018 J jnl
Modularity of regular and treelike graphs.
J. Complex Networks
Colin McDiarmid, Fiona Skerman
2018 C conf
Permutations in Binary Trees and Split Trees.
AofA
Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman
2018 B conf
The Parameterised Complexity of Computing the Maximum Modularity of a Graph.
IPEC
Kitty Meeks, Fiona Skerman
2018 J jnl
The parameterised complexity of computing the maximum modularity of a graph.
CoRR
Kitty Meeks, Fiona Skerman
2017 J jnl
Guessing Numbers of Odd Cycles.
Electron. J. Comb.
Ross Atkins, M. Puck Rombach, Fiona Skerman
2016 J jnl
Guessing Numbers of Odd Cycles.
CoRR
Ross Atkins, M. Puck Rombach, Fiona Skerman
2016 J jnl
Modularity of tree-like and random regular graphs.
CoRR
Colin McDiarmid, Fiona Skerman
2015 J jnl
Avoider-Enforcer star games.
Discret. Math. Theor. Comput. Sci.
Andrzej Grzesik, Mirjana Mikalacki, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman
2013 J jnl
Modularity in random regular graphs and lattices.
Electron. Notes Discret. Math.
Colin McDiarmid, Fiona Skerman