Refereed Journal Papers


  1. Incremental algorithm for DFS tree in undirected graphs
    S. Baswana and S. Khan
    Algorithmica (accepted), 2016.


  2. Fully dynamic algorithm for maximal matching.
    S. Baswana, M. Gupta, and S. Sen.
    SIAM J. Comp., 44(1): 88-113, 2015
    Note: In the version that appeared in the journal, the analysis of the algorithm was erroneous. However, we have been able to fix the error in the analysis based on an interesting property of the original algorithm that was not reported earlier. The performance bounds of the original algorithm is preserved in the new analysis. The pdf file available above is the correct full version. For those who want to just see the new analysis, please click here for a shorter version. The corresponding erratum for the paper has been submitted to SICOMP and is under process.


  3. Approximate Shortest paths avoiding a failed vertex : near optimal data structures for undirected unweighted graphs.
    S. Baswana and N. Khanna.
    Algorithmica, volume 66(1): 18-50, 2013


  4. Fully Dynamic Randomized Algorithms for Graph Spanners.
    S. Baswana, S. Khurana, and S. Sarkar
    ACM Transaction on Algorithms, volume 8(4): 35, 2012


  5. Faster Algorithms for All-Pairs Approximate Shortest Paths in Undirected Graphs.
    S. Baswana and T. Kavitha
    SIAM Journal of Computing, volume 39, issue 7, pp 2865-2896 (2010).


  6. Additive Spanners and (alpha,beta)-Spanners.
    S. Baswana and T. Kavitha, K. Mehlhorn, and S. Pettie.
    ACM Transaction on Algorithms, volume 7, issue 1, 2010 .


  7. All-Pairs Nearly 2-Approximate Shortest Paths in O(n2 polylog n) time.
    S. Baswana and V. Goyal and S. Sen.
    Theoretical Computer Science, volume 410, issue 1, pp 84-93 (2009).


  8. Streaming Algorithm for Graph Spanners - Single Pass and Constant Processing Time per Edge
    Information Processing Letters , volume 106, issue 3, pp 110-114, 2008.


  9. A Simple and Linear Time Randomized Algorithm for Computing Sparse Spanners in Weighted Graphs
    S. Baswana and S. Sen
    Random Strutcures and Algorithms, volume 30, issue 4, pp 532-563, 2007.


  10. Improved Decremental Algorithms for Maintaining Transitive Closure and All-pairs Shortest Paths in Digraphs
    S. Baswana, R. Hariharan and S. Sen
    Journal of Algorithms, volume 62, issue 2, pp 74-92, 2007.


  11. Approximate Distance oracles for Unweighted Graphs in Expected O(n^2) Time
    S. Baswana and S. Sen
    ACM Transactions on Algorithms, volume 2, issue 4, pp 557-577, 2006.
    Special issue for selected best papers that appeared in SODA 2004


  12. Planar Graph Blocking for External Searching
    S. Baswana and S. Sen
    Algorithmica, volume 34, pp 298-308, 2002.



Refereed Conference Papers


  1. Fault Tolerant Subgraph for Single Source Reachability: Generic and Optimal.
    with Keerti Choudhary and Liam Roditty.
    Proc. 48th ACM Symposium on Theory of Computing (STOC), 2016.

  2. Dynamic DFS Tree in Undirected Graphs: Breaking the O(m) barrier.
    with Shreejit Ray Chaudhury, Keerti Choudhary, and Shahbaz Khan
    Proc. 27th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2016.

  3. Fault Tolerant Reachability for Directed Graphs
    with Keerti Choudhary and Liam Roditty
    Proc. 29th International Symposium on Distributed Computing (DISC), pp 528-543, 2015.

  4. On Dynamic DFS Tree in Directed Graphs
    with Keerti Choudhary
    Proc. 40th International Symposium on Mathematical Foundations of Computer Science (MFCS)(2), pp 102-114, 2015.

  5. Incremental Algorithm for Maintaining a DFS Tree in an Undirected Graph
    with Shahbaz Khan.
    Proc. of 41st International Colloquium on Automata, Languages, and Programming (ICALP),pp 138-149, 2014.

  6. Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs.
    with Abhash Anand, Manoj Gupta and Sandeep Sen.
    Proc. 32nd Symposium on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 257-266,~2012.

  7. Single source distance oracle for planar digraphs avoiding any failed node or link
    with Utkarsh Lath and Anuradha S. Mehta
    Proc. 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp 223-232, 2012.

  8. Fully dynamic maximal matching in O(log n) update time
    with Manoj Gupta and Sandeep Sen
    Proc. 52nd IEEE Symposium on Foundations of Computer Science (FOCS), pp 383-392, 2011.

  9. Approximate shortest paths oracle handling single vertex failure
    with Neelesh Khanna
    Proc. 27th Symposium on Theoretical Aspects of Computer Science (STACS), pp 513-524, 2010.

  10. Distance oracles for unweighted graphs : breaking the quadratic barrier with constant additive error
    with A. Gaur, S. Sen, and J. Upadhyay
    Proc. 35th International Colloquium on Automata, Languages and Programming (ICALP)
    Springer Verlag, Lecture notes in computer science, volume 5125, pp 609-621, 2008

  11. Implied Set Closure and Its Application to Memory Consistency Verification
    with S. Mehta, V. Powar
    Proc. 20th International Conference on Computer Aided Verification (CAV)
    Springer Verlag, Lecture notes in computer science, volume 5123, pp 94-106, 2008.

  12. Fully Dynamic Algorithms for Graph Spanners with Poly-Logaritmic Update Time
    with S. Sarkar
    Proc. 19th Symposium on Discrete Algorithms (SODA)
    pp 672-681. ACM and SIAM, 2008.

  13. Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths
    with T. Kavitha
    Proc. 47th IEEE Symposium on Foundations of Computer Science (FOCS)
    IEEE, pp 591-602, 2006.

  14. Dynamic Algorithms for Graph Spanners
    S. Baswana
    Proc. 14th European Symposium on Algorithms (ESA)
    Springer-Verlag, Lecture Notes in Computer Science, volume 4168, pp 76-87, 2006.

  15. New Construction of (a,b)-Spanners and Purely Additive Spanners
    with T. Kavitha, K. Mehlhorn, and S. Pettie
    Proc. 16th Symposium on Discrete Algorithms (SODA)
    ACM and SIAM, pp 672-681, 2005.

  16. All-Pairs Nearly 2-Approximate Shortest Paths in O(n^2 polylog n) Time
    with V. Goyal, and S. Sen.
    Proc. 22nd Symposium on Theoretical Aspects of Computer Science (STACS)
    Springer-Verlag, Lecture Notes in Computer Science, volume 3404, pp 666-679, 2005.

  17. Approximate Distance Oracles for Unweighted Graphs in O(n^2 log n) Time
    with S. Sen
    Proc. 15th Symposium on Discrete Algorithms (SODA)
    ACM and SIAM, pp 264-273, 2004.

  18. A Simple Linear Time Algorithms for Computing (2k-1)-spanner of Size O(kn^{1+1/k}) for Weighted Graphs
    with S. Sen
    Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP)
    Springer-Verlag, Lecture Notes in Computer Science, volume 2719, pp 384-396, 2003.

  19. Maintaining All-pairs Approximate Shortest Paths under Deletion of Edges
    with R. Hariharan, and S. Sen
    Proc. 14th Symposium on Discrete Algorithms (SODA)
    ACM and SIAM, pp 394-403, 2003.

  20. Improved Decremental Algorithms for Transitive Closure and All-pairs Shortest Paths in Digraphs
    with R. Hariharan, and S. Sen
    Proc. 34th Symposium on Theory of Computing (STOC)
    ACM, pp 117-123, 2002.

  21. Planar Graph Blocking for External Searching
    with S. Sen
    Proc. 20th Symposium on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
    Springer-Verlag, Lecture Notes in Computer Science, volume 1974, pp 262-263, 2000.


Book Chapters


  1. Randomized graph data-structures for approximate shortest path problem
    S. Baswana and S. Sen
    Handbook of Data Structures and Applications, ISBN 1584884355. Dinesh Mehta and Sartaj Sahni (Ed.), CRC Press, 2004.

  2. Simple Algorithms for Spanners in Weighted Graphs
    S. Baswana and S. Sen
    Encyclopedia of Algorithms. Ming Yang Kao (Ed.), Springer, 2008.