Fiona Skerman

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 28

Top Topics

Top Venues

J. Complex Networks

Publications

Baptiste Louf, Colin McDiarmid, Fiona Skerman
Modularity and Graph Expansion. ITCS (2024)
Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang
Is It Easier to Count Communities Than Find Them? ITCS (2023)
Vilhelm Agdur, Nina Kamcev, Fiona Skerman
Universal lower bound for community structure of sparse graphs. CoRR (2023)
Colin McDiarmid, Fiona Skerman
Modularity of very dense graphs. CoRR (2023)
Baptiste Louf, Fiona Skerman
Finding Large Expanders in Graphs: from Topological Minors to Induced Subgraphs. Electron. J. Comb. 30 (1) (2023)
Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec
No additional tournaments are quasirandom-forcing. Eur. J. Comb. 108 (2023)
Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang
Is it easier to count communities than find them? CoRR (2022)
Jordan Chellig, Nikolaos Fountoulakis, Fiona Skerman
The modularity of random graphs on the hyperbolic plane. J. Complex Networks 10 (1) (2021)
Laura Eslava, Sarah Penington, Fiona Skerman
Survival for a Galton-Watson tree with cousin mergers. LAGOS (2021)
Jessica A. Enright, Kitty Meeks, Fiona Skerman
Assigning times to minimise reachability in temporal graphs. J. Comput. Syst. Sci. 115 (2021)
Colin McDiarmid, Fiona Skerman
Modularity and edge sampling. CoRR (2021)
Kitty Meeks, Fiona Skerman
The Parameterised Complexity of Computing the Maximum Modularity of a Graph. Algorithmica 82 (8) (2020)
Colin McDiarmid, Fiona Skerman
Modularity of Erdős-Rényi random graphs. Random Struct. Algorithms 57 (1) (2020)
Tobias Johnson, Moumanti Podder, Fiona Skerman
Random tree recursions: Which fixed points correspond to tangible sets of trees? Random Struct. Algorithms 56 (3) (2020)
Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman
Embedding Small Digraphs and Permutations in Binary Trees and Split Trees. Algorithmica 82 (3) (2020)
Robert Hancock, Adam Kabela, Daniel Král, Taísa L. Martins, Roberto Parente, Fiona Skerman, Jan Volec
No additional tournaments are quasirandom-forcing. CoRR (2019)
Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman
Inversions in Split Trees and Conditional Galton-Watson Trees. Comb. Probab. Comput. 28 (3) (2019)
Xing Shi Cai, Luc Devroye, Cecilia Holmgren, Fiona Skerman
k -cuts on a Path. CIAC (2019)
Kitty Meeks, Fiona Skerman
The parameterised complexity of computing the maximum modularity of a graph. CoRR (2018)
Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman
Permutations in Binary Trees and Split Trees. AofA (2018)
Kitty Meeks, Fiona Skerman
The Parameterised Complexity of Computing the Maximum Modularity of a Graph. IPEC (2018)
Colin McDiarmid, Fiona Skerman
Modularity of regular and treelike graphs. J. Complex Networks 6 (4) (2018)
Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman
Inversions in Split Trees and Conditional Galton-Watson Trees. AofA (2018)
Colin McDiarmid, Fiona Skerman
Modularity of Erdős-Rényi random graphs. CoRR (2018)
Colin McDiarmid, Fiona Skerman
Modularity of Erdös-Rényi Random Graphs. AofA (2018)
Ross Atkins, M. Puck Rombach, Fiona Skerman
Guessing Numbers of Odd Cycles. Electron. J. Comb. 24 (1) (2017)
Ross Atkins, M. Puck Rombach, Fiona Skerman
Guessing Numbers of Odd Cycles. CoRR (2016)
Colin McDiarmid, Fiona Skerman
Modularity of tree-like and random regular graphs. CoRR (2016)
Andrzej Grzesik, Mirjana Mikalacki, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman
Avoider-Enforcer star games. Discret. Math. Theor. Comput. Sci. 17 (1) (2015)
Colin McDiarmid, Fiona Skerman
Modularity in random regular graphs and lattices. Electron. Notes Discret. Math. 43 (2013)