| Publication | Date of Publication | Type |
|---|
| Multiple random walks on graphs: mixing few to cover many | 2026-05-12 | Paper |
| Symmetric-difference (degeneracy) and signed tree models | 2026-05-12 | Paper |
Capturing an invisible robber using separators
Theoretical Computer Science | 2026-05-08 | Paper |
Cops and robbers on multi-layer graphs
Discrete Applied Mathematics | 2026-03-19 | Paper |
| Tight bounds on adjacency labels for monotone graph classes | 2026-01-14 | Paper |
| Rumors with changing credibility | 2025-11-04 | Paper |
Tangled paths: a random graph model from Mallows permutations
The Electronic Journal of Combinatorics | 2025-05-30 | Paper |
| Tangled paths: a random graph model from Mallows permutations (extended abstract) | 2025-04-08 | Paper |
The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
Algorithmica | 2024-10-24 | Paper |
| Balanced allocations: caching and packing, twinning and thinning | 2024-07-19 | Paper |
A new temporal interpretation of cluster editing
Journal of Computer and System Sciences | 2024-07-01 | Paper |
The Power of Filling in Balanced Allocations
SIAM Journal on Discrete Mathematics | 2024-02-07 | Paper |
| Rumors with Changing Credibility | 2023-11-28 | Paper |
Multiple random walks on graphs: mixing few to cover many
Combinatorics, Probability and Computing | 2023-11-08 | Paper |
Time Dependent Biased Random Walks
ACM Transactions on Algorithms | 2023-10-31 | Paper |
The power of two choices for random walks
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
| Cops and Robbers on Multi-Layer Graphs | 2023-03-07 | Paper |
| Choice and Bias in Random Walks | 2023-02-03 | Paper |
| Balanced Allocations with Heterogeneous Bins: The Power of Memory | 2023-01-23 | Paper |
A new temporal interpretation of cluster editing
(available as arXiv preprint) | 2022-08-30 | Paper |
The complexity of finding optimal subgraphs to represent spatial correlation
(available as arXiv preprint) | 2022-06-29 | Paper |
The cover time of a (multiple) Markov chain with rational transition probabilities is rational
Statistics & Probability Letters | 2022-06-01 | Paper |
A New Temporal Interpretation of Cluster Editing
(available as arXiv preprint) | 2022-02-02 | Paper |
| Balanced Allocations: Caching and Packing, Twinning and Thinning | 2021-10-20 | Paper |
The Power of Two Choices for Random Walks
(available as arXiv preprint) | 2019-11-12 | Paper |
| The dispersion time of random walks on finite graphs | 2018-08-28 | Paper |
Tangled Paths: A Random Graph Model from Mallows Permutations
(available as arXiv preprint) | N/A | Paper |
Mean-Biased Processes for Balanced Allocations
(available as arXiv preprint) | N/A | Paper |
