1. Highway Dimension, Shortest Paths, and Provably Efficient Algorithms
2. Parallel approximate undirected shortest paths via low hop emulators
3. Ruben Becker , Yuval Emek , Mohsen Ghaffari , and Christoph Lenzen . 2019 . Distributed algorithms for low stretch spanning trees . In 33rd International Symposium on Distributed Computing (DISC 2019). 146, 4. Ruben Becker, Yuval Emek, Mohsen Ghaffari, and Christoph Lenzen. 2019. Distributed algorithms for low stretch spanning trees. In 33rd International Symposium on Distributed Computing (DISC 2019). 146, 4.
4. Ruben Becker Yuval Emek and Christoph Lenzen. 2020. Low Diameter Graph Decompositions by Approximate Distance Computation. In ITCS. Ruben Becker Yuval Emek and Christoph Lenzen. 2020. Low Diameter Graph Decompositions by Approximate Distance Computation. In ITCS.
5. Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models