1. S. Alstrup , S. Dahlgaard , A. Filtser , M. Stöckel , and C. Wulff-Nilsen . 2019 . Constructing Light Spanners Deterministically in Near-Linear Time. In 27th Annual European Symposium on Algorithms (ESA 2019 ). 4:1–4:15. S. Alstrup, S. Dahlgaard, A. Filtser, M. Stöckel, and C. Wulff-Nilsen. 2019. Constructing Light Spanners Deterministically in Near-Linear Time. In 27th Annual European Symposium on Algorithms (ESA 2019). 4:1–4:15.
2. On sparse spanners of weighted graphs
3. S. Arya , G. Das , D. M. Mount , J. S. Salowe , and M. Smid . 1995. Euclidean Spanners: Short, Thin, and Lanky . In Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of Computing (STOC ’95) . 489–498. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. 1995. Euclidean Spanners: Short, Thin, and Lanky. In Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of Computing (STOC ’95). 489–498.
4. Network decomposition and locality in distributed computation
5. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs