| Publication | Date of Publication | Type |
|---|
| Path-reporting distance oracles with linear size | 2025-12-02 | Paper |
| Light, reliable spanners | 2025-11-24 | Paper |
| On the size overhead of pairwise spanners | 2025-11-04 | Paper |
| Hopsets with constant hopbound, and applications to approximate shortest paths | 2025-08-06 | Paper |
| A unified framework for hopsets | 2025-06-19 | Paper |
| Beck's three permutations conjecture: a counterexample and some consequences | 2025-05-05 | Paper |
| Lightweight near-additive spanners | 2025-05-02 | Paper |
| Almost shortest paths with near-additive error in weighted graphs | 2024-05-27 | Paper |
| Centralized, parallel, and distributed multi-source shortest paths via hopsets and rectangular matrix multiplication | 2024-04-23 | Paper |
| scientific article; zbMATH DE number 7774272 (Why is no real title available?) | 2023-12-08 | Paper |
Corrigendum: Metric Embedding via Shortest Path Decompositions
SIAM Journal on Computing | 2023-11-14 | Paper |
Improved weighted additive spanners
Distributed Computing | 2023-09-11 | Paper |
Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC
Distributed Computing | 2022-10-14 | Paper |
Light spanners for high dimensional norms via stochastic decompositions
Algorithmica | 2022-10-06 | Paper |
Covering metric spaces by few trees
Journal of Computer and System Sciences | 2022-08-26 | Paper |
Covering Metric Spaces by Few Trees
(available as arXiv preprint) | 2022-07-21 | Paper |
Lossless prioritized embeddings
SIAM Journal on Discrete Mathematics | 2022-07-13 | Paper |
Distributed strong diameter network decomposition
Theoretical Computer Science | 2022-06-13 | Paper |
Metric Embedding via Shortest Path Decompositions
SIAM Journal on Computing | 2022-04-20 | Paper |
Near isometric terminal embeddings for doubling metrics
Algorithmica | 2021-11-19 | Paper |
| Near-additive spanners and near-exact hopsets, a unified view | 2021-08-30 | Paper |
Near-additive spanners and near-exact hopsets, a unified view
(available as arXiv preprint) | 2021-08-30 | Paper |
scientific article; zbMATH DE number 7378699 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Ramsey spanning trees and their applications
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Distributed Construction of Light Networks
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Lossless Prioritized Embeddings
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Near isometric terminal embeddings for doubling metrics
(available as arXiv preprint) | 2020-08-18 | Paper |
Near-optimal distributed routing with low memory
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Hopsets with constant hopbound, and applications to approximate shortest paths
SIAM Journal on Computing | 2019-09-16 | Paper |
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
SIAM Journal on Computing | 2019-09-02 | Paper |
Metric embedding via shortest path decompositions
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
On notions of distortion and an almost minimum spanning tree with constant average distortion
Journal of Computer and System Sciences | 2019-08-07 | Paper |
| On low dimensional local embeddings | 2019-05-06 | Paper |
Efficient algorithms for constructing very sparse spanners and emulators
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Using petal-decompositions to build a low stretch spanning tree
SIAM Journal on Computing | 2019-03-22 | Paper |
Simple deterministic algorithms for fully dynamic maximal matching
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| Snowflake universality of Wasserstein spaces | 2018-08-30 | Paper |
Snowflake universality of Wasserstein spaces
(available as arXiv preprint) | 2018-08-30 | Paper |
Efficient algorithms for constructing very sparse spanners and emulators
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On notions of distortion and an almost minimum spanning tree with constant average distortion
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Prioritized metric structures and embedding
SIAM Journal on Computing | 2018-07-04 | Paper |
On the impossibility of dimension reduction for doubling subsets of \(\ell_p\)
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
On efficient distributed construction of near optimal routing schemes
Distributed Computing | 2018-04-11 | Paper |
| Ramsey spanning trees and their applications | 2018-03-15 | Paper |
| Impossibility of sketching of the 3D transportation metric with quadratic cost | 2017-12-19 | Paper |
On efficient distributed construction of near optimal routing schemes (extended abstract)
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Distributed Strong Diameter Network Decomposition
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Terminal embeddings
Theoretical Computer Science | 2017-09-28 | Paper |
| Terminal embeddings | 2017-08-31 | Paper |
Space-efficient path-reporting approximate distance oracles
Theoretical Computer Science | 2017-03-16 | Paper |
Low dimensional embeddings of doubling metrics
Theory of Computing Systems | 2016-03-21 | Paper |
Prioritized metric structures and embedding
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
On the impossibility of dimension reduction for doubling subsets of \(\ell_{p}\)
SIAM Journal on Discrete Mathematics | 2015-07-31 | Paper |
Light spanners
SIAM Journal on Discrete Mathematics | 2015-07-31 | Paper |
Local embeddings of metric spaces
Algorithmica | 2015-07-10 | Paper |
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
SIAM Journal on Computing | 2015-06-02 | Paper |
On vertex rankings of graphs and its relatives
Discrete Mathematics | 2015-04-29 | Paper |
| Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion | 2014-12-18 | Paper |
Volume in general metric spaces
Discrete & Computational Geometry | 2014-10-29 | Paper |
Low dimensional embeddings of doubling metrics
Approximation and Online Algorithms | 2014-09-02 | Paper |
Simple deterministic algorithms for fully dynamic maximal matching
Proceedings of the forty-fifth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Light spanners
Automata, Languages, and Programming | 2014-07-01 | Paper |
Using petal-decompositions to build a low stretch spanning tree
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Bandwidth and low dimensional embedding
Theoretical Computer Science | 2013-12-19 | Paper |
Assouad's theorem with dimension independent of the snowflaking
Revista Matemática Iberoamericana | 2012-11-22 | Paper |
Advances in metric embedding theory
Advances in Mathematics | 2011-12-02 | Paper |
Dynamic inefficiency: anarchy without stability
Algorithmic Game Theory | 2011-10-28 | Paper |
Bandwidth and low dimensional embedding
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Volume in general metric spaces
Algorithms – ESA 2010 | 2010-09-06 | Paper |
| scientific article; zbMATH DE number 5764811 (Why is no real title available?) | 2010-08-06 | Paper |
Local embeddings of metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
