| Publication | Date of Publication | Type |
|---|
| Near optimal algorithm for the directed single source replacement paths problem | 2026-03-18 | Paper |
| Simplifying and unifying replacement paths algorithms in weighted directed graphs | 2026-03-18 | Paper |
| Path-reporting distance oracles with logarithmic stretch and linear size | 2026-01-14 | Paper |
| Faster algorithms for dual-failure replacement paths | 2026-01-14 | Paper |
| Streaming edge coloring with subquadratic palette size | 2026-01-14 | Paper |
| Nearly optimal approximate dual-failure replacement paths | 2024-11-28 | Paper |
| Nearly 2-approximate distance oracles in subquadratic time | 2024-07-19 | Paper |
Approximate distance sensitivity oracles in subquadratic space
TheoretiCS | 2024-07-03 | Paper |
| Faster deterministic worst-case fully dynamic all-pairs shortest paths via decremental hop-restricted shortest paths | 2024-05-14 | Paper |
| Approximate distance sensitivity oracles in subquadratic space | 2024-05-08 | Paper |
Constant-Round Near-Optimal Spanners in Congested Clique
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7788484 (Why is no real title available?) | 2024-01-15 | Paper |
| Reachability and shortest paths in the broadcast CONGEST model | 2023-02-03 | Paper |
Single-source shortest paths in the CONGEST model with improved bounds
Distributed Computing | 2022-08-24 | Paper |
Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
(available as arXiv preprint) | 2022-07-21 | Paper |
Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
(available as arXiv preprint) | 2021-07-28 | Paper |
Ramsey spanning trees and their applications
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Single-Source Shortest Paths in the CONGEST Model with Improved Bound
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Dynamic Low-Stretch Spanning Trees in Subpolynomial Time
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Distance sensitivity oracles with subcubic preprocessing time and fast query time
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Near optimal algorithms for the single source replacement paths problem
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Optimal distributed coloring algorithms for planar graphs in the LOCAL model
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Better approximation algorithms for the graph diameter
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
New additive spanners
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Low-distortion inference of latent similarities from a multiplex social network
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Near-optimal light spanners
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Forbidden-set distance labels for graphs of bounded doubling dimension
ACM Transactions on Algorithms | 2018-10-30 | Paper |
\((1 + \epsilon)\)-approximate \(f\)-sensitive distance oracles
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs
Proceedings of the Twenty-Eighth 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 |
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Deterministic partially dynamic single source shortest paths for sparse graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Incremental topological sort and cycle detection in \(\tilde O(m \sqrt n)\) expected total time | 2018-03-15 | Paper |
| Ramsey spanning trees and their applications | 2018-03-15 | Paper |
| scientific article; zbMATH DE number 6829368 (Why is no real title available?) | 2018-01-24 | Paper |
Secluded connectivity problems
Algorithmica | 2017-11-09 | Paper |
Deterministic decremental single source shortest paths: beyond the \(O(mn)\) bound
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Approximate nearest neighbor search in metrics of planar graphs | 2017-08-31 | Paper |
Average distance queries through weighted samples in graphs and metric spaces: high scalability with tight statistical guarantees
(available as arXiv preprint) | 2017-08-31 | Paper |
| Fully dynamic all-pairs shortest paths: breaking the \(O(n)\) barrier | 2017-03-22 | Paper |
Approximate distance oracles with improved bounds
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Approximate distance oracles with constant query time
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Low-distortion inference of latent similarities from a multiplex social network
SIAM Journal on Computing | 2015-06-11 | Paper |
Fault tolerant additive and \((\mu, \alpha)\)-spanners
Theoretical Computer Science | 2015-05-18 | Paper |
Compact routing schemes with improved stretch
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Forbidden-set distance labels for graphs of bounded doubling dimension
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Fault-tolerant spanners for general graphs
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
The fault-tolerant capacitated \(K\)-center problem
Theoretical Computer Science | 2015-01-06 | Paper |
Robust fault tolerant uncapacitated facility location
Theoretical Computer Science | 2014-07-07 | Paper |
Distance Labels with Optimal Local Stretch
Automata, Languages, and Programming | 2014-07-01 | Paper |
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Secluded connectivity problems
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Fault-tolerant compact routing schemes for general graphs
Information and Computation | 2013-06-06 | Paper |
Multipath spanners via fault-tolerant spanners
Lecture Notes in Computer Science | 2013-04-19 | Paper |
\(f\)-sensitivity distance oracles and routing schemes
Algorithmica | 2012-12-06 | Paper |
Fault tolerant additive spanners
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Sparse reliable graph backbones
Information and Computation | 2012-05-24 | Paper |
| Robust fault tolerant uncapacitated facility location | 2012-01-23 | Paper |
Fault-Tolerant Compact Routing Schemes for General Graphs
Automata, Languages and Programming | 2011-07-07 | Paper |
Fault tolerant spanners for general graphs
SIAM Journal on Computing | 2011-04-04 | Paper |
Sparse reliable graph backbones
Automata, Languages and Programming | 2010-09-07 | Paper |
\(f\)-sensitivity distance oracles and routing schemes
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Low-port tree representations
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
