| Publication | Date of Publication | Type |
|---|
| New fault tolerant subset preservers | 2026-03-18 | Paper |
| Additive spanner lower bounds with optimal inner graph structure | 2026-01-14 | Paper |
| The discrepancy of shortest paths | 2026-01-14 | Paper |
| Spanning adjacency oracles in sublinear time | 2025-11-04 | Paper |
| Are there graphs whose shortest path structure requires large edge weights? | 2025-11-04 | Paper |
| Folklore sampling is optimal for exact hopsets: confirming the \(\sqrt{n}\) barrier | 2025-08-15 | Paper |
| Bridge girth: a unifying notion in network design | 2025-08-15 | Paper |
| New additive spanner lower bounds by an unlayered obstacle product | 2025-08-15 | Paper |
An alternate proof of near-optimal light spanners
TheoretiCS | 2025-03-06 | Paper |
Restorable shortest path tiebreaking for edge-faulty graphs
Journal of the ACM | 2025-02-05 | Paper |
| Fault-tolerant spanners against bounded-degree edge failures: linearly more faults, almost for free | 2024-11-28 | Paper |
| Epic fail: emulators can tolerate polynomially many edge faults for free | 2024-09-25 | Paper |
| Opponent indifference in rating systems: a theoretical case for sonas | 2024-09-25 | Paper |
| Partially optimal edge fault-tolerant spanners | 2024-07-19 | Paper |
| An alternate proof of near-optimal light spanners | 2024-05-29 | Paper |
scientific article; zbMATH DE number 7829257 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Reachability Preservers: New Extremal Bounds and Approximation Algorithms
SIAM Journal on Computing | 2024-03-19 | Paper |
scientific article; zbMATH DE number 7788512 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
A unified view of graph regularity via matrix decompositions
Random Structures & Algorithms | 2023-10-12 | Paper |
scientific article; zbMATH DE number 7700598 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-23 | Paper |
scientific article; zbMATH DE number 7650369 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Bridge Girth: A Unifying Notion in Network Design | 2022-12-22 | Paper |
Weighted additive spanners
(available as arXiv preprint) | 2022-12-21 | Paper |
On additive spanners in weighted graphs with local error
(available as arXiv preprint) | 2022-06-08 | Paper |
Better Distance Preservers and Additive Spanners
ACM Transactions on Algorithms | 2022-02-22 | Paper |
A note on distance-preserving graph sparsification
Information Processing Letters | 2021-12-14 | Paper |
Graph spanners: a tutorial review
Computer Science Review | 2021-05-19 | Paper |
New results on linear size distance preservers
SIAM Journal on Computing | 2021-04-14 | Paper |
| Partially Optimal Edge Fault-Tolerant Spanners | 2021-02-22 | Paper |
A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Preserving distances in very faulty graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
Testing core membership in public goods economies
(available as arXiv preprint) | 2020-05-27 | Paper |
Weighted Additive Spanners
(available as arXiv preprint) | 2020-02-15 | Paper |
A Note on Distance-Preserving Graph Sparsification
(available as arXiv preprint) | 2020-01-21 | Paper |
Strategy-Stealing is Non-Constructive
(available as arXiv preprint) | 2019-11-15 | Paper |
On the structure of unique shortest paths in graphs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A hierarchy of lower bounds for sublinear additive spanners
SIAM Journal on Computing | 2018-12-05 | Paper |
A Hierarchy of Lower Bounds for Sublinear Additive Spanners
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Error Amplification for Pairwise Spanner Lower Bounds
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Better distance preservers and additive spanners
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Linear size distance preservers
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The 4/3 additive spanner exponent is tight
Journal of the ACM | 2018-05-17 | Paper |
| Reachability preservers: new extremal bounds and approximation algorithms | 2018-03-15 | Paper |
Reachability preservers: new extremal bounds and approximation algorithms
(available as arXiv preprint) | 2018-03-15 | Paper |
| Optimal Vertex Fault Tolerant Spanners (for fixed stretch) | 2018-03-15 | Paper |
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
(available as arXiv preprint) | 2018-03-15 | Paper |
Fully dynamic spanners with worst-case update time
(available as arXiv preprint) | 2018-03-02 | Paper |
| Graph reconstruction with a betweenness oracle | 2018-01-24 | Paper |
The 4/3 additive spanner exponent is tight
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
An Alternate Proof of Near-Optimal Light Spanners
(available as arXiv preprint) | N/A | Paper |
Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths
(available as arXiv preprint) | N/A | Paper |
