Search the dblp DataBase

Publications of Author

1. Surender Baswana
   Dynamic Algorithms for Graph Spanners. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:76-87 [Conf]
   
2. Surender Baswana, Telikepalli Kavitha
   Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:591-602 [Conf]
   
3. Surender Baswana, Sandeep Sen
   Planar Graph Blocking for External Searching. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2000, pp:252-263 [Conf]
   
4. Surender Baswana, Sandeep Sen
   A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n^1+1/k) Size in Weighted Graphs. [Citation Graph (0, 0)][DBLP]
   ICALP, 2003, pp:384-296 [Conf]
   
5. Surender Baswana, Ramesh Hariharan, Sandeep Sen
   Maintaining all-pairs approximate shortest paths under deletion of edges. [Citation Graph (0, 0)][DBLP]
   SODA, 2003, pp:394-403 [Conf]
   
6. Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
   New constructions of (alpha, beta)-spanners and purely additive spanners. [Citation Graph (0, 0)][DBLP]
   SODA, 2005, pp:672-681 [Conf]
   
7. Surender Baswana, Sandeep Sen
   Approximate distance oracles for unweighted graphs in Õ(n²) time. [Citation Graph (0, 0)][DBLP]
   SODA, 2004, pp:271-280 [Conf]
   
8. Surender Baswana, Vishrut Goyal, Sandeep Sen
   All-Pairs Nearly 2-Approximate Shortest-Paths in O(n² polylog n) Time. [Citation Graph (0, 0)][DBLP]
   STACS, 2005, pp:666-679 [Conf]
   
9. Surender Baswana, Ramesh Hariharan, Sandeep Sen
   Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. [Citation Graph (0, 0)][DBLP]
   STOC, 2002, pp:117-123 [Conf]
   
10. Surender Baswana, Sandeep Sen
    Planar Graph Blocking for External Searching. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:3, pp:298-308 [Journal]
    
11. Surender Baswana, Ramesh Hariharan, Sandeep Sen
    Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2007, v:62, n:2, pp:74-92 [Journal]
    
12. Surender Baswana, Sandeep Sen
    Approximate distance oracles for unweighted graphs in expected O(n²) time. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:557-577 [Journal]
    
13. Surender Baswana
    Faster Streaming algorithms for graph spanners [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
14. 
    Implied Set Closure and Its Application to Memory Consistency Verification. [Citation Graph (, )][DBLP]
    
    
15. 
    Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. [Citation Graph (, )][DBLP]
    
    
16. 
    Fully dynamic algorithm for graph spanners with poly-logarithmic update time. [Citation Graph (, )][DBLP]
    
    
17. 
    Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs. [Citation Graph (, )][DBLP]