Personal information

No personal information available

Activities

Employment (6)

Uppsala University: Uppsala, SE

2020-04-01 to present
Employment
Source: Self-asserted source
Fiona Skerman

University of Bristol: Bristol, GB

2019-11-01 to 2020-03-31 | Heilbronn Fellow (Department of Mathematics)
Employment
Source: Self-asserted source
Fiona Skerman

Masaryk University: Brno, CZ

2019-04 to 2019-10-31 | Postdoctoral Researcher
Employment
Source: Self-asserted source
Fiona Skerman

Uppsala Universitet: Uppsala, SE

2017-09 to 2019-03 | Postdoctoral researcher (Mathematics)
Employment
Source: Self-asserted source
Fiona Skerman

University of Bristol: Bristol, Bristol, GB

2015-11-01 to 2017-08-31 | Heilbronn Research Fellow
Employment
Source: Self-asserted source
Fiona Skerman

Uppsala Universitet: Uppsala, SE

2017-01-01 to 2017-03-27
Employment
Source: Self-asserted source
Fiona Skerman

Education and qualifications (1)

University of Oxford: Oxford, Oxfordshire, GB

2011-09-01 to 2016 | DPhil (Statistics)
Education
Source: Self-asserted source
Fiona Skerman

Works (17)

Assigning times to minimise reachability in temporal graphs

Journal of Computer and System Sciences
2021-02 | Journal article
Part of ISSN: 0022-0000
Contributors: Fiona Skerman
Source: Self-asserted source
Fiona Skerman
grade
Preferred source (of 2)‎

Modularity of Erdős-Rényi random graphs

Random Structures and Algorithms
2020-03 | Journal article | Author
SOURCE-WORK-ID:

ef2ebda7-c3bd-420d-84c5-a22f1af14f96

Contributors: Fiona Skerman; Colin McDiarmid
Source: check_circle
University of Bristol - PURE

$$k$$-cuts on a Path

2019 | Book chapter
Contributors: Xing Shi Cai; Luc Devroye; Cecilia Holmgren; Fiona Skerman
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

K-cut on paths and some trees

Electronic Journal of Probability
2019 | Journal article
EID:

2-s2.0-85070078270

Contributors: Cai, X.S.; Holmgren, C.; Devroye, L.; Skerman, F.
Source: Self-asserted source
Fiona Skerman via Scopus - Elsevier
grade
Preferred source (of 3)‎

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

Random Structures and Algorithms
2019 | Journal article
EID:

2-s2.0-85075200102

Contributors: Johnson, T.; Podder, M.; Skerman, F.
Source: Self-asserted source
Fiona Skerman via Scopus - Elsevier
grade
Preferred source (of 3)‎

The Parameterised Complexity of Computing the Maximum Modularity of a Graph

Algorithmica
2019 | Journal article
EID:

2-s2.0-85074838010

Contributors: Meeks, K.; Skerman, F.
Source: Self-asserted source
Fiona Skerman via Scopus - Elsevier
grade
Preferred source (of 2)‎

Embedding small digraphs and permutations in binary trees and split trees

2019-01-08 | Preprint
EID:

2-s2.0-85077558535

Source: Self-asserted source
Fiona Skerman
grade
Preferred source (of 2)‎

Inversions in split trees and conditional Galton-Watson trees

Leibniz International Proceedings in Informatics, LIPIcs
2018 | Conference paper
Contributors: Cai, X.S.; Holmgren, C.; Janson, S.; Johansson, T.; Skerman, F.
Source: Self-asserted source
Fiona Skerman via ResearcherID
grade
Preferred source (of 3)‎

Modularity of Erdos-Rényi random graphs

Leibniz International Proceedings in Informatics, LIPIcs
2018 | Conference paper
EID:

2-s2.0-85049068101

Contributors: McDiarmid, C.; Skerman, F.
Source: Self-asserted source
Fiona Skerman via Scopus - Elsevier
grade
Preferred source (of 2)‎

Modularity of regular and treelike graphs

Journal of Complex Networks
2018 | Journal article
EID:

2-s2.0-85049080723

Contributors: McDiarmid, C.; Skerman, F.
Source: Self-asserted source
Fiona Skerman via Scopus - Elsevier

Permutations in binary trees and split trees

Leibniz International Proceedings in Informatics, LIPIcs
2018 | Conference paper
EID:

2-s2.0-85049118560

Contributors: Albert, M.; Holmgren, C.; Johansson, T.; Skerman, F.
Source: Self-asserted source
Fiona Skerman via Scopus - Elsevier
grade
Preferred source (of 2)‎

Modularity of Erdős-Rényi random graphs

2018-08-07 | Preprint
Source: Self-asserted source
Fiona Skerman

Guessing numbers of odd cycles

Electronic Journal of Combinatorics
2017 | Journal article
EID:

2-s2.0-85014629072

Contributors: Atkins, R.; Rombach, P.; Skerman, F.
Source: Self-asserted source
Fiona Skerman via Scopus - Elsevier

Degree sequences of random digraphs and bipartite graphs

Journal of Combinatorics
2016 | Journal article
Part of ISSN: 2156-3527
Contributors: Brendan D. McKay; Fiona Skerman
Source: Self-asserted source
Fiona Skerman via Crossref Metadata Search

Avoider-Enforcer star games

Discrete Mathematics and Theoretical Computer Science
2015 | Journal article
EID:

2-s2.0-84938543524

Contributors: Grzesik, A.; Mikalački, M.; Nagy, Z.L.; Naor, A.; Patkós, B.; Skerman, F.
Source: Self-asserted source
Fiona Skerman via Scopus - Elsevier
grade
Preferred source (of 3)‎

Avoider-enforcer star games

Discrete Mathematics & Theoretical Computer Science
2015-03-26 | Journal article
Contributors: Andrzej Grzesik; Mirjana Mikalački; Zoltán Lóránt Nagy; Alon Naor; Balázs Patkós; Fiona Skerman
Source: check_circle
Crossref

Modularity in random regular graphs and lattices

Electronic Notes in Discrete Mathematics
2013 | Journal article
EID:

2-s2.0-84883377955

Contributors: McDiarmid, C.; Skerman, F.
Source: Self-asserted source
Fiona Skerman via Scopus - Elsevier
grade
Preferred source (of 2)‎