| Publication | Date of Publication | Type |
|---|
| Dynamic pagerank: algorithms and lower bounds | 2026-01-14 | Paper |
| It's hard to HAC average linkage! | 2026-01-14 | Paper |
| Near-optimal massively parallel graph connectivity | 2025-08-12 | Paper |
| Decremental single-source reachability and strongly connected components in \(\widetilde{O}(m \sqrt{n})\) total update time | 2025-08-06 | Paper |
| Single source -- all sinks max flows in planar digraphs | 2025-05-05 | Paper |
| Fully dynamic consistent \(k\)-center clustering | 2024-11-28 | Paper |
| Optimal decremental connectivity in non-sparse graphs | 2024-11-14 | Paper |
| Near-optimal decremental hopsets with applications | 2024-06-24 | Paper |
| Simple label-correcting algorithms for partially dynamic approximate shortest paths in directed graphs | 2024-05-14 | Paper |
| Stochastic graph exploration | 2022-07-21 | Paper |
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
(available as arXiv preprint) | 2022-05-11 | Paper |
Decremental SPQR-trees for Planar Graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
Fully Dynamic Matching: Beating 2-Approximation in Δ<sup><i>ϵ</i></sup> Update Time
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Walking randomly, massively, and efficiently
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Round compression for parallel matching algorithms
SIAM Journal on Computing | 2020-10-29 | Paper |
Contracting a planar graph efficiently
(available as arXiv preprint) | 2020-05-27 | Paper |
Round compression for parallel matching algorithms
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Round compression for parallel matching algorithms
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Algorithmic complexity of power law networks
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| scientific article; zbMATH DE number 6850408 (Why is no real title available?) | 2018-03-15 | Paper |
scientific article; zbMATH DE number 6850408 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-15 | Paper |
Optimal decremental connectivity in planar graphs
Theory of Computing Systems | 2018-02-01 | Paper |
| scientific article; zbMATH DE number 6783482 (Why is no real title available?) | 2017-09-29 | Paper |
Decremental single-source reachability in planar digraphs
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Reachability in graph timelines
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Optimal decremental connectivity in planar graphs
(available as arXiv preprint) | 2017-01-24 | Paper |
Fast and Simple Connectivity in Graph Timelines
Lecture Notes in Computer Science | 2015-10-30 | Paper |
The Power of Dynamic Distance Oracles
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Improved deterministic algorithms for decremental reachability and strongly connected components
ACM Transactions on Algorithms | 2014-12-05 | Paper |
| Single Source - All Sinks Max Flows in Planar Digraphs | 2012-10-17 | Paper |
Min-cuts and shortest cycles in planar graphs in \(O(n \log\log n)\) time
Algorithms – ESA 2011 | 2011-09-16 | Paper |
