Artigos com autorizações de acesso público - Fiona SkermanSaiba mais
10 artigos disponíveis publicamente
Assigning times to minimise reachability in temporal graphs
J Enright, K Meeks, F Skerman
Journal of Computer and System Sciences, 2020
Autorizações: Swedish Research Council, UK Engineering and Physical Sciences Research Council
The modularity of random graphs on the hyperbolic plane
J Chellig, N Fountoulakis, F Skerman
Journal of Complex Networks 10 (1), cnab051, 2022
Autorizações: UK Engineering and Physical Sciences Research Council
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
Autorizações: European Commission
-cut on paths and some trees
XS Cai, C Holmgren, L Devroye, F Skerman
Electronic Journal of Probability 24, 2019
Autorizações: Knut and Alice Wallenberg Foundation, Swedish Research Council
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
Autorizações: Knut and Alice Wallenberg Foundation, Swedish Research Council
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
Autorizações: Knut and Alice Wallenberg Foundation, Swedish Research Council
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
Autorizações: Magyar Tudományos Akadémia, Hungarian Scientific Research Fund
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
Autorizações: European Commission
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
Autorizações: US National Science Foundation
A branching process with deletions and mergers that matches the threshold for hypercube percolation
L Eslava, S Penington, F Skerman
Annales de l'Institut Henri Poincare (B) Probabilites et statistiques 60 (2 …, 2024
Autorizações: Knut and Alice Wallenberg Foundation
As informações de publicação e financiamento são determinadas automaticamente por um programa de computador