Planar Graph Blocking for External Searching. - Surender Baswana; Sandeep Sen (Algorithmica, 2002)

A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs. - Surender Baswana; Sandeep Sen (ICALP, 2003)

Maintaining all-pairs approximate shortest paths under deletion of edges. - Surender Baswana; Ramesh Hariharan; Sandeep Sen (SODA, 2003)

Approximate distance oracles for unweighted graphs in Õ(n2) time. - Surender Baswana; Sandeep Sen (SODA, 2004)

Randomized Graph Data-Structures for Approximate Shortest Paths. - Surender Baswana; Sandeep Sen (Handbook of Data Structures and Applications, 2004)

New constructions of (alpha, beta)-spanners and purely additive spanners. - Surender Baswana; Telikepalli Kavitha; Kurt Mehlhorn; Seth Pettie (SODA, 2005)

All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time. - Surender Baswana; Vishrut Goyal; Sandeep Sen (STACS, 2005)

Dynamic Algorithms for Graph Spanners. - Surender Baswana (ESA, 2006)

Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. - Surender Baswana; Telikepalli Kavitha (FOCS, 2006)

Faster Streaming algorithms for graph spanners - Surender Baswana (CoRR, 2006)

Approximate distance oracles for unweighted graphs in expected O(n2) time. - Surender Baswana; Sandeep Sen (ACM Trans. Algorithms, 2006)

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. - Surender Baswana; Ramesh Hariharan; Sandeep Sen (J. Algorithms, 2007)

A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. - Surender Baswana; Sandeep Sen (Random Struct. Algorithms, 2007)

Implied Set Closure and Its Application to Memory Consistency Verification. - Surender Baswana; Shashank K. Mehta; Vishal Powar (CAV, 2008)

Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. - Surender Baswana; Akshay Gaur; Sandeep Sen; Jayant Upadhyay (ICALP (1), 2008)

Fully dynamic algorithm for graph spanners with poly-logarithmic update time. - Surender Baswana; Soumojit Sarkar (SODA, 2008)

Streaming algorithm for graph spanners - single pass and constant processing time per edge. - Surender Baswana (Inf. Process. Lett., 2008)

Algorithms for Spanners in Weighted Graphs. - Surender Baswana; Sandeep Sen (Encyclopedia of Algorithms, 2008)

Computing single source shortest paths using single-objective fitness. - Surender Baswana; Somenath Biswas; Benjamin Doerr; Tobias Friedrich 001; Piyush P. Kurur; Frank Neumann 001 (FOGA, 2009)

All-pairs nearly 2-approximate shortest paths in I time. - Surender Baswana; Vishrut Goyal; Sandeep Sen (Theor. Comput. Sci., 2009)

Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs. - Neelesh Khanna; Surender Baswana (STACS, 2010)

Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph - Neelesh Khanna; Surender Baswana (CoRR, 2010)

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. - Surender Baswana; Telikepalli Kavitha (SIAM J. Comput., 2010)

Additive spanners and (alpha, beta)-spanners. - Surender Baswana; Telikepalli Kavitha; Kurt Mehlhorn; Seth Pettie (ACM Trans. Algorithms, 2010)

Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. - Abhash Anand; Surender Baswana; Manoj Gupta 002; Sandeep Sen (FSTTCS, 2012)

Single source distance oracle for planar digraphs avoiding a failed node or link. - Surender Baswana; Utkarsh Lath; Anuradha S. Mehta (SODA, 2012)

Fully dynamic randomized algorithms for graph spanners. - Surender Baswana; Sumeet Khurana; Soumojit Sarkar (ACM Trans. Algorithms, 2012)

Pertinent path profiling: Tracking interactions among relevant statements. - Ramshankar Chouhan; Subhajit Roy 001; Surender Baswana (CGO, 2013)

Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs. - Surender Baswana; Neelesh Khanna (Algorithmica, 2013)

On Dynamic DFS Tree in Directed Graphs. - Surender Baswana; Keerti Choudhary (MFCS (2), 2015)

Fault Tolerant Reachability for Directed Graphs. - Surender Baswana; Keerti Choudhary; Liam Roditty (DISC, 2015)

Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier. - Surender Baswana; Shreejit Ray Chaudhury; Keerti Choudhary; Shahbaz Khan 004 (CoRR, 2015)

Fully Dynamic Maximal Matching in O(log n) Update Time. - Surender Baswana; Manoj Gupta 002; Sandeep Sen (SIAM J. Comput., 2015)

Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk). - Surender Baswana (CALDAM, 2016)

Dynamic DFS in Undirected Graphs: breaking the O(m) barrier. - Surender Baswana; Shreejit Ray Chaudhury; Keerti Choudhary; Shahbaz Khan 004 (SODA, 2016)

Fault tolerant subgraph for single source reachability: generic and optimal. - Surender Baswana; Keerti Choudhary; Liam Roditty (STOC, 2016)

Matching in Dynamic Graphs. - Surender Baswana; Manoj Gupta 002; Sandeep Sen (Encyclopedia of Algorithms, 2016)

Simple Algorithms for Spanners in Weighted Graphs. - Surender Baswana; Sandeep Sen (Encyclopedia of Algorithms, 2016)

Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs. - Surender Baswana; Shahbaz Khan 004 (Algorithmica, 2017)

Incremental DFS algorithms: a theoretical and experimental study. - Surender Baswana; Ayush Goel; Shahbaz Khan 004 (SODA, 2018)

Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal. - Surender Baswana; Keerti Choudhary; Liam Roditty (SIAM J. Comput., 2018)

Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version). - Surender Baswana; Manoj Gupta 002; Sandeep Sen (SIAM J. Comput., 2018)

Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. - Surender Baswana; Shiv Kumar Gupta 001; Ayush Tulsyan (MFCS, 2019)

An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. - Surender Baswana; Keerti Choudhary; Liam Roditty (Algorithmica, 2019)

Joint Seat Allocation 2018: An algorithmic perspective. - Surender Baswana; P. P. Chakrabarti 001; Yashodhan Kanoria; Utkarsh Patange; Sharat Chandran (CoRR, 2019)

Centralized Admissions for Engineering Colleges in India. - Surender Baswana; Partha Pratim Chakrabarti; Sharat Chandran; Yashodhan Kanoria; Utkarsh Patange (INFORMS J. Appl. Anal., 2019)

Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier. - Surender Baswana; Shreejit Ray Chaudhury; Keerti Choudhary; Shahbaz Khan 004 (SIAM J. Comput., 2019)

Fault-Tolerant All-Pairs Mincuts. - Surender Baswana; Abhyuday Pandey (CoRR, 2020)

Approximate Single-Source Fault Tolerant Shortest Path. - Surender Baswana; Keerti Choudhary; Moazzam Hussain; Liam Roditty (ACM Trans. Algorithms, 2020)

Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle. - Surender Baswana; Koustav Bhanja; Abhyuday Pandey (ICALP, 2022)

Sensitivity Oracles for All-Pairs Mincuts. - Surender Baswana; Abhyuday Pandey (SODA, 2022)

Mincut Sensitivity Data Structures for the Insertion of an Edge. - Surender Baswana; Shiv Kumar Gupta 001; Till Knollmann (Algorithmica, 2022)

Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient. - Surender Baswana; Shiv Kumar Gupta 001; Ayush Tulsyan (Algorithmica, 2022)

Vital Edges for (s, t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle. - Surender Baswana; Koustav Bhanja (CoRR, 2023)

Minimum+1 (s, t)-cuts and Dual-edge Sensitivity Oracle. - Surender Baswana; Koustav Bhanja; Abhyuday Pandey (ACM Trans. Algorithms, 2023)

Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles. - Surender Baswana; Koustav Bhanja (ICALP, 2024)

The connectivity carcass of a vertex subset in a graph: both odd and even case. - Surender Baswana; Abhyuday Pandey (SOSA, 2025)

Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut. - Surender Baswana; Koustav Bhanja; Anupam Roy (CoRR, 2025)