| Publication | Date of Publication | Type |
|---|
| 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 | 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 | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147402 | 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 | 2022-08-24 | Paper |
| Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles | 2022-07-21 | Paper |
| Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms | 2021-07-28 | Paper |
| Ramsey spanning trees and their applications | 2021-05-03 | Paper |
| Single-Source Shortest Paths in the CONGEST Model with Improved Bound | 2021-03-15 | Paper |
| Dynamic Low-Stretch Spanning Trees in Subpolynomial Time | 2021-02-02 | Paper |
| Distance sensitivity oracles with subcubic preprocessing time and fast query time | 2021-01-19 | Paper |
| Near optimal algorithms for the single source replacement paths problem | 2019-10-15 | Paper |
| Optimal distributed coloring algorithms for planar graphs in the LOCAL model | 2019-10-15 | Paper |
| Better approximation algorithms for the graph diameter | 2019-06-20 | Paper |
| New additive spanners | 2019-05-15 | Paper |
| Low-distortion inference of latent similarities from a multiplex social network | 2019-05-15 | Paper |
| Near-optimal light spanners | 2018-11-13 | Paper |
| Forbidden-set distance labels for graphs of bounded doubling dimension | 2018-10-30 | Paper |
| \((1 + \epsilon)\)-approximate \(f\)-sensitive distance oracles | 2018-07-16 | Paper |
| Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs | 2018-07-16 | Paper |
| Near-optimal light spanners | 2018-07-16 | Paper |
| On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs | 2018-07-16 | Paper |
| Fully dynamic all-pairs shortest paths with worst-case update-time revisited | 2018-07-16 | Paper |
| Deterministic partially dynamic single source shortest paths for sparse graphs | 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 |
| https://portal.mardi4nfdi.de/entity/Q4601879 | 2018-01-24 | Paper |
| Secluded connectivity problems | 2017-11-09 | Paper |
| Deterministic decremental single source shortest paths: beyond the \(O(mn)\) bound | 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 | 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 | 2015-08-21 | Paper |
| Approximate distance oracles with constant query time | 2015-06-26 | Paper |
| Low-distortion inference of latent similarities from a multiplex social network | 2015-06-11 | Paper |
| Fault tolerant additive and \((\mu, \alpha)\)-spanners | 2015-05-18 | Paper |
| Compact routing schemes with improved stretch | 2015-03-02 | Paper |
| Forbidden-set distance labels for graphs of bounded doubling dimension | 2015-03-02 | Paper |
| Fault-tolerant spanners for general graphs | 2015-02-04 | Paper |
| The fault-tolerant capacitated \(K\)-center problem | 2015-01-06 | Paper |
| Robust fault tolerant uncapacitated facility location | 2014-07-07 | Paper |
| Distance Labels with Optimal Local Stretch | 2014-07-01 | Paper |
| Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels | 2014-05-13 | Paper |
| Secluded connectivity problems | 2013-09-17 | Paper |
| Fault-tolerant compact routing schemes for general graphs | 2013-06-06 | Paper |
| Multipath spanners via fault-tolerant spanners | 2013-04-19 | Paper |
| \(f\)-sensitivity distance oracles and routing schemes | 2012-12-06 | Paper |
| Fault tolerant additive spanners | 2012-11-06 | Paper |
| Sparse reliable graph backbones | 2012-05-24 | Paper |
| Robust fault tolerant uncapacitated facility location | 2012-01-23 | Paper |
| Fault-Tolerant Compact Routing Schemes for General Graphs | 2011-07-07 | Paper |
| Fault tolerant spanners for general graphs | 2011-04-04 | Paper |
| Sparse reliable graph backbones | 2010-09-07 | Paper |
| \(f\)-sensitivity distance oracles and routing schemes | 2010-09-06 | Paper |
| Low-port tree representations | 2010-01-21 | Paper |
