Your search returned the following 7 documents:

7. Additive Spanners and (α, β)-Spanners
   Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie
   ACM Transactions on Algorithms 7 (1): 5:1-5:26, 2011
   
6. Computing Single Source Shortest Paths using Single-Objective Fitness Functions
   Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, and Frank Neumann
   In: FOGA'09 : revised selected papers from ACM SIGEVO Foundations of Genetic Algorithms X, Orlando, USA, 2009, 59-66
   
5. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
   Surender Baswana and Sandeep Sen
   Random Structures & Algorithms 30 (4): 532-563, 2007
   
4. All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
   Surender Baswana, Vishrut Goyal, and Sandeep Sen
   In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, 2005, 666-679
   [PS: Download: stacs05.ps]
   
3. New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
   Surender Baswana, Kavitha Telikepalli, Kurt Mehlhorn, and Seth Pettie
   In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 672-681
   
   
2. Approximate distance oracle for unweighted graphs in Expected O(n²) time
   Surender Baswana and Sandeep Sen
   In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA, 2004, 271-280
   [PS: Download: oracle.ps]
   
1. Randomized graph data-structures for approximate shortest path problem
   Surender Baswana and Sandeep Sen
   In: Handbook of Data Structures and Applications, 2004, 38.1-38.19