| Publication | Date of Publication | Type |
|---|
From flip processes to dynamical systems on graphons
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2025-01-15 | Paper |
Is it easier to count communities than find them?
| 2024-09-25 | Paper |
A branching process with deletions and mergers that matches the threshold for hypercube percolation
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2024-09-02 | Paper |
Modularity and Graph Expansion
| 2023-12-12 | Paper |
Modularity of nearly complete graphs and bipartite graphs
| 2023-11-12 | Paper |
Universal lower bound for community structure of sparse graphs
| 2023-07-14 | Paper |
Logical limit laws for Mallows random permutations
| 2023-02-20 | Paper |
Finding large expanders in graphs: from topological minors to induced subgraphs
The Electronic Journal of Combinatorics | 2023-02-17 | Paper |
Is it easier to count communities than find them?
| 2022-12-21 | Paper |
No additional tournaments are quasirandom-forcing
European Journal of Combinatorics | 2022-12-01 | Paper |
The modularity of random graphs on the hyperbolic plane
Journal of Complex Networks | 2022-03-01 | Paper |
From flip processes to dynamical systems on graphons
| 2022-01-28 | Paper |
scientific article; zbMATH DE number 7378595 (Why is no real title available?)
| 2021-08-04 | Paper |
Modularity of Erdős-Rényi random graphs
| 2021-06-15 | Paper |
Permutations in binary trees and split trees
| 2021-06-15 | Paper |
Inversions in split trees and conditional Galton-Watson trees
| 2021-06-15 | Paper |
Modularity of regular and treelike graphs
Journal of Complex Networks | 2021-05-07 | Paper |
A branching process with deletions and mergers that matches the threshold for hypercube percolation
| 2021-04-09 | Paper |
Finding large expanders in graphs: from topological minors to induced subgraphs
| 2020-12-31 | Paper |
Assigning times to minimise reachability in temporal graphs
Journal of Computer and System Sciences | 2020-10-23 | Paper |
Modularity of Erdős-Rényi random graphs
Random Structures \& Algorithms | 2020-09-16 | Paper |
The parameterised complexity of computing the maximum modularity of a graph
Algorithmica | 2020-08-12 | Paper |
Random tree recursions: Which fixed points correspond to tangible sets of trees?
Random Structures \& Algorithms | 2020-06-19 | Paper |
Inversions in split trees and conditional Galton-Watson trees
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Embedding small digraphs and permutations in binary trees and split trees
Algorithmica | 2020-02-06 | Paper |
\(k\)-cuts on a path
| 2020-02-06 | Paper |
\(k\)-cut on paths and some trees
Electronic Journal of Probability | 2019-06-20 | Paper |
The parameterised complexity of computing the maximum modularity of a graph
| 2018-07-18 | Paper |
Guessing numbers of odd cycles
The Electronic Journal of Combinatorics | 2017-04-10 | Paper |
Degree sequences of random digraphs and bipartite graphs
Journal of Combinatorics | 2016-02-19 | Paper |
Avoider-enforcer star games
| 2015-04-30 | Paper |
scientific article; zbMATH DE number 6303015 (Why is no real title available?)
| 2014-06-11 | Paper |
Modularity and partially observed graphs
| N/A | Paper |
