| Publication | Date of Publication | Type |
|---|
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I
(available as arXiv preprint) | N/A | Paper |
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs
Forum of Mathematics, Sigma | 2026-02-23 | Paper |
| Nearly optimal independence oracle algorithms for edge estimation in hypergraphs | 2026-01-14 | Paper |
Instability of backoff protocols with arbitrary arrival rates
Journal of Computer and System Sciences | 2025-05-07 | Paper |
Polynomial growth in degree-dependent first passage percolation on spatial random graphs
Electronic Journal of Probability | 2024-12-20 | Paper |
| Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs II | 2023-09-21 | Paper |
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle
SIAM Journal on Computing | 2022-07-22 | Paper |
| Instability of backoff protocols with arbitrary arrival rates | 2022-03-31 | Paper |
Fine-Grained Reductions from Approximate Counting to Decision
ACM Transactions on Computation Theory | 2022-03-22 | Paper |
Penalising transmission to hubs in scale-free spatial random graphs
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2022-02-25 | Paper |
Faster exponential-time algorithms for approximately counting independent sets
Theoretical Computer Science | 2021-10-21 | Paper |
Approximately counting and sampling small witnesses using a colourful decision oracle
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Phase transitions of the Moran process and algorithmic consequences
Random Structures & Algorithms | 2020-06-19 | Paper |
Phase transitions of the Moran process and algorithmic consequences
Random Structures & Algorithms | 2020-06-19 | Paper |
| A fixed-parameter perspective on \#BIS | 2020-05-27 | Paper |
A fixed-parameter perspective on \#BIS
Algorithmica | 2019-09-10 | Paper |
Fine-grained reductions from approximate counting to decision
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Fine-grained reductions from approximate counting to decision
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Asymptotically optimal amplifiers for the Moran process
Theoretical Computer Science | 2019-01-10 | Paper |
Asymptotically optimal amplifiers for the Moran process
Theoretical Computer Science | 2019-01-10 | Paper |
Amplifiers for the Moran process
Journal of the ACM | 2018-08-02 | Paper |
Amplifiers for the Moran process
(available as arXiv preprint) | 2017-12-19 | Paper |
Approximately counting locally-optimal structures
Journal of Computer and System Sciences | 2016-06-13 | Paper |
Approximately Counting Locally-Optimal Structures
Automata, Languages, and Programming | 2015-10-27 | Paper |
On-line Ramsey numbers of paths and cycles
The Electronic Journal of Combinatorics | 2015-01-22 | Paper |
On-line Ramsey numbers of paths and cycles
The Electronic Journal of Combinatorics | 2015-01-22 | Paper |
Optimal covers with Hamilton cycles in random graphs
Combinatorica | 2015-01-07 | Paper |
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
Proceedings of the London Mathematical Society. Third Series | 2014-10-15 | Paper |
| Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments | 2014-06-11 | Paper |
Optimal packings of Hamilton cycles in graphs of high minimum degree
Combinatorics, Probability and Computing | 2013-05-13 | Paper |
