| Publication | Date of Publication | Type |
|---|
| VC set systems in minor-free (di)graphs and applications | 2024-11-28 | Paper |
| A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs | 2024-07-19 | Paper |
| Fully dynamic exact edge connectivity in sublinear time | 2024-05-14 | Paper |
| A simple algorithm for multiple-source shortest paths in planar digraphs | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788596 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788598 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| VC Set Systems in Minor-free (Di)Graphs and Applications | 2023-04-04 | Paper |
| Constructing Light Spanners Deterministically in Near-Linear Time | 2022-05-11 | Paper |
Constructing light spanners deterministically in near-linear time
Theoretical Computer Science | 2022-02-21 | Paper |
Constructing light spanners deterministically in near-linear time
Theoretical Computer Science | 2022-02-21 | Paper |
Decremental strongly connected components and single-source reachability in near-linear time
SIAM Journal on Computing | 2022-01-07 | Paper |
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Escaping an infinitude of lions
The American Mathematical Monthly | 2020-12-17 | Paper |
Decremental strongly-connected components and single-source reachability in near-linear time
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Greedy spanners are optimal in doubling metrics
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Approximate distance oracles with improved query time
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Faster deterministic fully-dynamic graph connectivity
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Approximate distance oracles with improved preprocessing time
(available as arXiv preprint) | 2019-05-10 | Paper |
| Approximate distance oracles with improved preprocessing time | 2019-05-10 | Paper |
Near-optimal light spanners
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Min \(st\)-cut oracle for planar graphs with near-linear preprocessing time
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Best laid plans of lions and men
(available as arXiv preprint) | 2018-08-13 | Paper |
Approximate distance oracles for planar graphs with improved query time-space tradeoff
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Near-optimal light spanners
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Better tradeoffs for exact distance oracles in planar graphs | 2018-03-15 | Paper |
Better tradeoffs for exact distance oracles in planar graphs
(available as arXiv preprint) | 2018-03-15 | Paper |
All-pairs minimum cuts in near-linear time for surface-embedded graphs
(available as arXiv preprint) | 2018-01-30 | Paper |
Near optimal adjacency labeling schemes for power-law graphs
(available as arXiv preprint) | 2017-12-19 | Paper |
Brief announcement: Labeling schemes for power-law graphs
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Fully-dynamic minimum spanning forest with improved worst-case update time
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
SIAM Journal on Computing | 2017-08-16 | Paper |
Space-efficient path-reporting approximate distance oracles
Theoretical Computer Science | 2017-03-16 | Paper |
| Computing the maximum detour of a plane geometric graph in subquadratic time | 2017-03-09 | Paper |
Faster Fully-Dynamic Minimum Spanning Forest
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Faster separators for shallow minor-free graphs via dynamic approximate distance oracles
Automata, Languages, and Programming | 2014-07-01 | Paper |
Improved algorithms for min cut and max flow in undirected planar graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| Solving the replacement paths problem for planar directed graphs in \(O(n\log n)\) time | 2014-05-22 | Paper |
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time
Computational Geometry | 2013-08-22 | Paper |
Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
| Single Source - All Sinks Max Flows in Planar Digraphs | 2012-10-17 | Paper |
Connectivity Oracles for Planar Graphs
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Bounding the expected number of rectilinear full Steiner trees
Networks | 2010-11-24 | Paper |
Shortest paths in planar graphs with real lengths in \(O(n \log^{2} n/ \log \log n)\) time
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Computing the dilation of edge-augmented graphs in metric spaces
Computational Geometry | 2009-11-16 | Paper |
A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
Networks | 2009-07-28 | Paper |
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Algorithms and Computation | 2009-01-29 | Paper |
Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
Algorithms and Computation | 2009-01-29 | Paper |
Steiner hull algorithm for the uniform orientation metrics
Computational Geometry | 2008-03-26 | Paper |
