default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFiona Skerman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Baptiste Louf, Colin McDiarmid, Fiona Skerman:
Modularity and Graph Expansion. ITCS 2024: 78:1-78:21- [i10]Xin Shen, Matteo Magnani, Christian Rohner, Fiona Skerman:
Fast and Accurate Algorithms to Calculate Expected Modularity in Probabilistic Networks. CoRR abs/2408.07161 (2024) - 2023
- [j13]Baptiste Louf, Fiona Skerman:
Finding Large Expanders in Graphs: from Topological Minors to Induced Subgraphs. Electron. J. Comb. 30(1) (2023) - [j12]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: 103632 (2023) - [c7]Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang:
Is It Easier to Count Communities Than Find Them? ITCS 2023: 94:1-94:23 - [i9]Vilhelm Agdur, Nina Kamcev, Fiona Skerman:
Universal lower bound for community structure of sparse graphs. CoRR abs/2307.07271 (2023) - [i8]Colin McDiarmid, Fiona Skerman:
Modularity of very dense graphs. CoRR abs/2311.06875 (2023) - 2022
- [i7]Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang:
Is it easier to count communities than find them? CoRR abs/2212.10872 (2022) - 2021
- [j11]Jordan Chellig, Nikolaos Fountoulakis, Fiona Skerman:
The modularity of random graphs on the hyperbolic plane. J. Complex Networks 10(1) (2021) - [j10]Jessica A. Enright, Kitty Meeks, Fiona Skerman:
Assigning times to minimise reachability in temporal graphs. J. Comput. Syst. Sci. 115: 169-186 (2021) - [c6]Laura Eslava, Sarah Penington, Fiona Skerman:
Survival for a Galton-Watson tree with cousin mergers. LAGOS 2021: 445-452 - [i6]Colin McDiarmid, Fiona Skerman:
Modularity and edge sampling. CoRR abs/2112.13190 (2021) - 2020
- [j9]Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman:
Embedding Small Digraphs and Permutations in Binary Trees and Split Trees. Algorithmica 82(3): 589-615 (2020) - [j8]Kitty Meeks, Fiona Skerman:
The Parameterised Complexity of Computing the Maximum Modularity of a Graph. Algorithmica 82(8): 2174-2199 (2020) - [j7]Tobias Johnson, Moumanti Podder, Fiona Skerman:
Random tree recursions: Which fixed points correspond to tangible sets of trees? Random Struct. Algorithms 56(3): 796-837 (2020) - [j6]Colin McDiarmid, Fiona Skerman:
Modularity of Erdős-Rényi random graphs. Random Struct. Algorithms 57(1): 211-243 (2020)
2010 – 2019
- 2019
- [j5]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): 335-364 (2019) - [c5]Xing Shi Cai, Luc Devroye, Cecilia Holmgren, Fiona Skerman:
k -cuts on a Path. CIAC 2019: 112-123 - [i5]Robert Hancock, Adam Kabela, Daniel Král, Taísa L. Martins, Roberto Parente, Fiona Skerman, Jan Volec:
No additional tournaments are quasirandom-forcing. CoRR abs/1912.04243 (2019) - 2018
- [j4]Colin McDiarmid, Fiona Skerman:
Modularity of regular and treelike graphs. J. Complex Networks 6(4): 596-619 (2018) - [c4]Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman:
Permutations in Binary Trees and Split Trees. AofA 2018: 9:1-9:12 - [c3]Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman:
Inversions in Split Trees and Conditional Galton-Watson Trees. AofA 2018: 15:1-15:12 - [c2]Colin McDiarmid, Fiona Skerman:
Modularity of Erdös-Rényi Random Graphs. AofA 2018: 31:1-31:13 - [c1]Kitty Meeks, Fiona Skerman:
The Parameterised Complexity of Computing the Maximum Modularity of a Graph. IPEC 2018: 9:1-9:14 - [i4]Kitty Meeks, Fiona Skerman:
The parameterised complexity of computing the maximum modularity of a graph. CoRR abs/1807.06965 (2018) - [i3]Colin McDiarmid, Fiona Skerman:
Modularity of Erdős-Rényi random graphs. CoRR abs/1808.02243 (2018) - 2017
- [j3]Ross Atkins, M. Puck Rombach, Fiona Skerman:
Guessing Numbers of Odd Cycles. Electron. J. Comb. 24(1): 1 (2017) - 2016
- [i2]Ross Atkins, M. Puck Rombach, Fiona Skerman:
Guessing Numbers of Odd Cycles. CoRR abs/1602.03586 (2016) - [i1]Colin McDiarmid, Fiona Skerman:
Modularity of tree-like and random regular graphs. CoRR abs/1606.09101 (2016) - 2015
- [j2]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): 145-160 (2015) - 2013
- [j1]Colin McDiarmid, Fiona Skerman:
Modularity in random regular graphs and lattices. Electron. Notes Discret. Math. 43: 431-437 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
