| 2026 | ESA | All-Pairs kth Mincuts: Combinatorial and Structural Results. | Surender Baswana, Anupam Roy |
| 2025 | ESA | 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 |
| 2024 | ICALP | Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles. | Surender Baswana, Koustav Bhanja |
| 2022 | ICALP | Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle. | Surender Baswana, Koustav Bhanja, Abhyuday Pandey |
| 2022 | SODA | Sensitivity Oracles for All-Pairs Mincuts. | Surender Baswana, Abhyuday Pandey |
| 2020 | ESA | Mincut Sensitivity Data Structures for the Insertion of an Edge. | Surender Baswana, Shiv Kumar Gupta, Till Knollmann |
| 2019 | EC | Centralized Admissions for Engineering Colleges in India. | Surender Baswana, Partha Pratim Chakrabarti, Sharat Chandran, Yashodhan Kanoria, Utkarsh Patange |
| 2019 | MFCS | Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. | Surender Baswana, Shiv Kumar Gupta, Ayush Tulsyan |
| 2018 | SODA | Approximate Single Source Fault Tolerant Shortest Path. | Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty |
| 2018 | SODA | Incremental DFS algorithms: a theoretical and experimental study. | Surender Baswana, Ayush Goel, Shahbaz Khan |
| 2017 | ICALP | An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. | Surender Baswana, Keerti Choudhary, Liam Roditty |
| 2016 | SODA | Dynamic DFS in Undirected Graphs: breaking the O( | Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan |
| 2016 | STOC | Fault tolerant subgraph for single source reachability: generic and optimal. | Surender Baswana, Keerti Choudhary, Liam Roditty |
| 2015 | MFCS | On Dynamic DFS Tree in Directed Graphs. | Surender Baswana, Keerti Choudhary |
| 2014 | ICALP | Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs. | Surender Baswana, Shahbaz Khan |
| 2013 | CGO | Pertinent path profiling: Tracking interactions among relevant statements. | Ramshankar Chouhan, Subhajit Roy, Surender Baswana |
| 2012 | SODA | Single source distance oracle for planar digraphs avoiding a failed node or link. | Surender Baswana, Utkarsh Lath, Anuradha S. Mehta |
| 2011 | FOCS | Fully Dynamic Maximal Matching in O (log n) Update Time. | Surender Baswana, Manoj Gupta, Sandeep Sen |
| 2010 | STACS | Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs. | Neelesh Khanna, Surender Baswana |
| 2009 | FOGA | Computing single source shortest paths using single-objective fitness. | Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann |
| 2008 | CAV | Implied Set Closure and Its Application to Memory Consistency Verification. | Surender Baswana, Shashank K. Mehta, Vishal Powar |
| 2008 | ICALP | Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. | Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay |
| 2008 | SODA | Fully dynamic algorithm for graph spanners with poly-logarithmic update time. | Surender Baswana, Soumojit Sarkar |
| 2006 | ESA | Dynamic Algorithms for Graph Spanners. | Surender Baswana |
| 2006 | FOCS | Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. | Surender Baswana, Telikepalli Kavitha |
| 2005 | SODA | New constructions of (alpha, beta)-spanners and purely additive spanners. | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
| 2005 | STACS | All-Pairs Nearly 2-Approximate Shortest-Paths in O(n | Surender Baswana, Vishrut Goyal, Sandeep Sen |
| 2004 | SODA | Approximate distance oracles for unweighted graphs in (n | Surender Baswana, Sandeep Sen |
| 2003 | ICALP | A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n | Surender Baswana, Sandeep Sen |
| 2003 | SODA | Maintaining all-pairs approximate shortest paths under deletion of edges. | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
| 2002 | STOC | Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. | Surender Baswana, Ramesh Hariharan, Sandeep Sen |