Fiona Skerman

According to our database, Fiona Skerman authored at least 23 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Fast and Accurate Algorithms to Calculate Expected Modularity in Probabilistic Networks.

Xin Shen, Matteo Magnani, Christian Rohner, Fiona Skerman

CoRR, 2024

Modularity and Graph Expansion.

Baptiste Louf, Colin McDiarmid, Fiona Skerman

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

No additional tournaments are quasirandom-forcing.

Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec

Eur. J. Comb., 2023

Modularity of very dense graphs.

Colin McDiarmid, Fiona Skerman

CoRR, 2023

Universal lower bound for community structure of sparse graphs.

Vilhelm Agdur, Nina Kamcev, Fiona Skerman

CoRR, 2023

Finding Large Expanders in Graphs: from Topological Minors to Induced Subgraphs.

Baptiste Louf, Fiona Skerman

Electron. J. Comb., 2023

Is It Easier to Count Communities Than Find Them?

Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2021

Assigning times to minimise reachability in temporal graphs.

Jessica A. Enright, Kitty Meeks, Fiona Skerman

J. Comput. Syst. Sci., 2021

Modularity and edge sampling.

Colin McDiarmid, Fiona Skerman

CoRR, 2021

The modularity of random graphs on the hyperbolic plane.

Jordan Chellig, Nikolaos Fountoulakis, Fiona Skerman

J. Complex Networks, 2021

Survival for a Galton-Watson tree with cousin mergers.

Laura Eslava, Sarah Penington, Fiona Skerman

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Modularity of Erdős-Rényi random graphs.

Colin McDiarmid, Fiona Skerman

Random Struct. Algorithms, 2020

Random tree recursions: Which fixed points correspond to tangible sets of trees?

Tobias Johnson, Moumanti Podder, Fiona Skerman

Random Struct. Algorithms, 2020

The Parameterised Complexity of Computing the Maximum Modularity of a Graph.

Kitty Meeks, Fiona Skerman

Algorithmica, 2020

Embedding Small Digraphs and Permutations in Binary Trees and Split Trees.

Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman

Algorithmica, 2020

2019

Inversions in Split Trees and Conditional Galton-Watson Trees.

Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman

Comb. Probab. Comput., 2019

k -cuts on a Path.

Xing Shi Cai, Luc Devroye, Cecilia Holmgren, Fiona Skerman

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Modularity of regular and treelike graphs.

Colin McDiarmid, Fiona Skerman

J. Complex Networks, 2018

Permutations in Binary Trees and Split Trees.

Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

Guessing Numbers of Odd Cycles.

Ross Atkins, M. Puck Rombach, Fiona Skerman

Electron. J. Comb., 2017

2016

Modularity of tree-like and random regular graphs.

Colin McDiarmid, Fiona Skerman

CoRR, 2016

2015

Avoider-Enforcer star games.

Andrzej Grzesik, Mirjana Mikalacki, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman

Discret. Math. Theor. Comput. Sci., 2015

2013

Modularity in random regular graphs and lattices.

Colin McDiarmid, Fiona Skerman

Electron. Notes Discret. Math., 2013