Fiona Skerman

Cited by

	All	Since 2020
Citations	302	251
h-index	10	9
i10-index	10	9

201520162017201820192020202120222023202420252 14 6 8 17 30 28 45 72 52 19

Public access

View all

10 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Kitty MeeksUniversity of GlasgowVerified email at glasgow.ac.uk
Xing Shi CaiAssistant Professor at Mathematics Department, Duke Kunshan University, ChinaVerified email at dukekunshan.edu.cn
Jessica EnrightUniversity of GlasgowVerified email at glasgow.ac.uk
Taísa Lopes MartinsUniversidade Federal FluminenseVerified email at id.uff.br
Roberto Freitas ParenteAdjunct Professor, Institute of Computing, Federal University of Bahia ( IC - UFBA)Verified email at ufba.br
Jan VolecCzech Technical University in PragueVerified email at ucw.cz
Tony JohanssonGothenburg UniversityVerified email at chalmers.se
Luc DevroyeMcGill UniversityVerified email at cs.mcgill.ca
Robert HancockUniversity of OxfordVerified email at maths.ox.ac.uk
Balázs PatkósRényi InstituteVerified email at renyi.hu
Andrzej GrzesikJagiellonian UniversityVerified email at uj.edu.pl
Mirjana MikalačkiAssociate Professor, University of Novi Sad, Faculty of SciencesVerified email at dmi.uns.ac.rs
Nikolaos FountoulakisReader in Mathematics, University of BirminghamVerified email at bham.ac.uk
Brendan McKayProfessor of Computer Science, Australian National UniversityVerified email at anu.edu.au
Zoltán Lóránt NagyEötvös University, ELTE Linear hypergraphs research groupVerified email at cs.elte.hu
Michael AlbertProfessor of Computer Science, Otago UniversityVerified email at cs.otago.ac.nz
Cynthia RushColumbia UniversityVerified email at columbia.edu
Alexander S. WeinUC DavisVerified email at ucdavis.edu
Dana YangAssistant Professor, Cornell UniversityVerified email at cornell.edu
Puck RombachUniversity of VermontVerified email at uvm.edu

Fiona Skerman

Uppsala University

Verified email at math.uu.se - Homepage

Random Graphs


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Modularity of Erdős‐Rényi random graphs C McDiarmid, F Skerman Random Structures & Algorithms 57 (1), 211-243, 2020	48	2020
Assigning times to minimise reachability in temporal graphs J Enright, K Meeks, F Skerman Journal of Computer and System Sciences, 2020	42*	2020
Modularity of regular and treelike graphs C McDiarmid, F Skerman Journal of Complex Networks, 2017	37*	2017
The modularity of random graphs on the hyperbolic plane J Chellig, N Fountoulakis, F Skerman Journal of Complex Networks 10 (1), cnab051, 2022	22	2022
Modularity in random regular graphs and lattices C McDiarmid, F Skerman Electronic Notes in Discrete Mathematics 43, 431-437, 2013	21	2013
Degree sequences of random digraphs and bipartite graphs BD McKay, F Skerman Journal of Combinatorics 7 (1), 29, 2016	15	2016
No additional tournaments are quasirandom-forcing R Hancock, A Kabela, T Martins, R Parente, F Skerman, J Volec European Journal of Combinatorics 108, 103632, 2023	14	2023
The parameterised complexity of computing the maximum modularity of a graph K Meeks, F Skerman Algorithmica 82 (8), 2174-2199, 2020	13	2020
-cut on paths and some trees XS Cai, C Holmgren, L Devroye, F Skerman Electronic Journal of Probability 24, 2019	13*	2019
Is it easier to count communities than find them? C Rush, F Skerman, AS Wein, D Yang arXiv preprint arXiv:2212.10872, 2022	11	2022
Modularity of networks F Skerman University of Oxford, 2016	9	2016
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	7	2019
Guessing numbers of odd cycles R Atkins, P Rombach, F Skerman arXiv preprint arXiv:1602.03586, 2016	7	2016
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	6*	2020
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	6	2015
Degree sequences of random bipartite graphs F Skerman Honours Thesis, The Australian National University, 2010	6	2010
From flip processes to dynamical systems on graphons F Garbe, J Hladký, M Šileikis, F Skerman Annales de l'Institut Henri Poincare (B) Probabilites et statistiques 60 (4 …, 2024	5	2024
Modularity and partially observed graphs C McDiarmid, F Skerman arXiv preprint arXiv:2112.13190, 2021	5*	2021
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	5	2020
Finding large expanders in graphs: from topological minors to induced subgraphs B Louf, F Skerman arXiv preprint arXiv:2012.15722, 2020	4	2020

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors