1. Graph spanners: A tutorial review
2. A. Andoni , A. Gupta , and R. Krauthgamer . Towards (1+\eps)-approximate flow sparsifiers . In 25th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 279– 293 , 2014 . https://doi.org/10.1137/1.9781611973402.20 doi:10.1137/1.9781611973402.20. 10.1137/1.9781611973402.20 A. Andoni, A. Gupta, and R. Krauthgamer. Towards (1+\eps)-approximate flow sparsifiers. In 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 279–293, 2014. https://doi.org/10.1137/1.9781611973402.20 doi:10.1137/1.9781611973402.20.
3. Geometric applications of a matrix-searching algorithm
4. A. Basu and A. Gupta . Steiner point removal in graph metrics. Unpublished manuscript, available from http://www.math.ucdavis.edu/~abasu/papers/SPR.pdf , 2008 . A. Basu and A. Gupta. Steiner point removal in graph metrics. Unpublished manuscript, available from http://www.math.ucdavis.edu/~abasu/papers/SPR.pdf, 2008.
5. Yair Bartal and Lee-Ad Gottlieb . A linear time approximation scheme for Euclidean TSP . In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science , pages 698– 706 . IEEE, October 2013. https://doi.org/10.1109/FOCS.2013.80 doi:10.1109/FOCS.2013.80. 10.1109/FOCS.2013.80 Yair Bartal and Lee-Ad Gottlieb. A linear time approximation scheme for Euclidean TSP. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pages 698–706. IEEE, October 2013. https://doi.org/10.1109/FOCS.2013.80 doi:10.1109/FOCS.2013.80.