Surender Baswana

73 papers A* 19A 8B 1Journal 34Unranked 7
YearRankTypeTitle / Venue / Authors
2025 A conf
Faster Algorithm for Second (s, t)-Mincut and Breaking Quadratic Barrier for Dual Edge Sensitivity for (s, t)-Mincut.
ESA
Surender Baswana, Koustav Bhanja, Anupam Roy
2025 J jnl
Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut.
CoRR
Surender Baswana, Koustav Bhanja, Anupam Roy
2025 — conf
The connectivity carcass of a vertex subset in a graph: both odd and even case.
SOSA
Surender Baswana, Abhyuday Pandey
2025 J jnl
The connectivity carcass of a vertex subset in a graph: both odd and even case.
CoRR
Surender Baswana, Abhyuday Pandey
2024 A* conf
Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles.
ICALP
Surender Baswana, Koustav Bhanja
2023 J jnl
Minimum+1 (
ACM Trans. Algorithms
Surender Baswana, Koustav Bhanja, Abhyuday Pandey
2023 J jnl
Vital Edges for (s, t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle.
CoRR
Surender Baswana, Koustav Bhanja
2022 J jnl
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient.
Algorithmica
Surender Baswana, Shiv Kumar Gupta, Ayush Tulsyan
2022 J jnl
Mincut Sensitivity Data Structures for the Insertion of an Edge.
Algorithmica
Surender Baswana, Shiv Kumar Gupta, Till Knollmann
2022 A* conf
Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle.
ICALP
Surender Baswana, Koustav Bhanja, Abhyuday Pandey
2022 A* conf
Sensitivity Oracles for All-Pairs Mincuts.
SODA
Surender Baswana, Abhyuday Pandey
2020 J jnl
Approximate Single-Source Fault Tolerant Shortest Path.
ACM Trans. Algorithms
Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty
2020 J jnl
Fault-Tolerant All-Pairs Mincuts.
CoRR
Surender Baswana, Abhyuday Pandey
2020 A conf
Mincut Sensitivity Data Structures for the Insertion of an Edge.
ESA
Surender Baswana, Shiv Kumar Gupta, Till Knollmann
2019 J jnl
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model.
Algorithmica
Surender Baswana, Keerti Choudhary, Liam Roditty
2019 A* conf
Centralized Admissions for Engineering Colleges in India.
EC
Surender Baswana, Partha Pratim Chakrabarti, Sharat Chandran, Yashodhan Kanoria, Utkarsh Patange
2019 J jnl
Centralized Admissions for Engineering Colleges in India.
INFORMS J. Appl. Anal.
Surender Baswana, Partha Pratim Chakrabarti, Sharat Chandran, Yashodhan Kanoria, Utkarsh Patange
2019 J jnl
Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier.
SIAM J. Comput.
Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan
2019 B conf
Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.
MFCS
Surender Baswana, Shiv Kumar Gupta, Ayush Tulsyan
2019 J jnl
Joint Seat Allocation 2018: An algorithmic perspective.
CoRR
Surender Baswana, P. P. Chakrabarti, Yashodhan Kanoria, Utkarsh Patange, Sharat Chandran
2018 A* conf
Approximate Single Source Fault Tolerant Shortest Path.
SODA
Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty
2018 J jnl
Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.
CoRR
Surender Baswana, Shiv Kumar Gupta, Ayush Tulsyan
2018 J jnl
Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal.
SIAM J. Comput.
Surender Baswana, Keerti Choudhary, Liam Roditty
2018 J jnl
Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version).
SIAM J. Comput.
Surender Baswana, Manoj Gupta, Sandeep Sen
2018 A* conf
Incremental DFS algorithms: a theoretical and experimental study.
SODA
Surender Baswana, Ayush Goel, Shahbaz Khan
2017 A* conf
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model.
ICALP
Surender Baswana, Keerti Choudhary, Liam Roditty
2017 J jnl
Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs.
Algorithmica
Surender Baswana, Shahbaz Khan
2017 J jnl
Incremental DFS algorithms: a theoretical and experimental study.
CoRR
Surender Baswana, Ayush Goel, Shahbaz Khan
2016 J jnl
An efficient strongly connected components algorithm in the fault tolerant model.
CoRR
Surender Baswana, Keerti Choudhary, Liam Roditty
2016 A* conf
Dynamic DFS in Undirected Graphs: breaking the O(
SODA
Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan
2016 A* conf
Fault tolerant subgraph for single source reachability: generic and optimal.
STOC
Surender Baswana, Keerti Choudhary, Liam Roditty
2016 — ch.
Matching in Dynamic Graphs.
Encyclopedia of Algorithms
Surender Baswana, Manoj Gupta, Sandeep Sen
2016 — conf
Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk).
CALDAM
Surender Baswana
2016 — ch.
Simple Algorithms for Spanners in Weighted Graphs.
Encyclopedia of Algorithms
Surender Baswana, Sandeep Sen
2015 J jnl
Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier.
CoRR
Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan
2015 A conf
Fault Tolerant Reachability for Directed Graphs.
DISC
Surender Baswana, Keerti Choudhary, Liam Roditty
2015 J jnl
Fully Dynamic Maximal Matching in O(log n) Update Time.
SIAM J. Comput.
Surender Baswana, Manoj Gupta, Sandeep Sen
2015 — conf
On Dynamic DFS Tree in Directed Graphs.
MFCS (2)
Surender Baswana, Keerti Choudhary
2014 — conf
Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs.
ICALP (1)
Surender Baswana, Shahbaz Khan
2013 J jnl
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs.
Algorithmica
Surender Baswana, Neelesh Khanna
2013 A conf
Pertinent path profiling: Tracking interactions among relevant statements.
CGO
Ramshankar Chouhan, Subhajit Roy, Surender Baswana
2012 J jnl
Fully dynamic randomized algorithms for graph spanners.
ACM Trans. Algorithms
Surender Baswana, Sumeet Khurana, Soumojit Sarkar
2012 J jnl
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs
CoRR
Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen
2012 — conf
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs.
FSTTCS
Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen
2012 A* conf
Single source distance oracle for planar digraphs avoiding a failed node or link.
SODA
Surender Baswana, Utkarsh Lath, Anuradha S. Mehta
2011 A* conf
Fully Dynamic Maximal Matching in O (log n) Update Time.
FOCS
Surender Baswana, Manoj Gupta, Sandeep Sen
2011 J jnl
Fully dynamic maximal matching in O(log n) update time
CoRR
Surender Baswana, Manoj Gupta, Sandeep Sen
2010 J jnl
Additive spanners and (alpha, beta)-spanners.
ACM Trans. Algorithms
Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
2010 J jnl
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph
CoRR
Neelesh Khanna, Surender Baswana
2010 A conf
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs.
STACS
Neelesh Khanna, Surender Baswana
2010 J jnl
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs.
SIAM J. Comput.
Surender Baswana, Telikepalli Kavitha
2009 J jnl
All-pairs nearly 2-approximate shortest paths in
Theor. Comput. Sci.
Surender Baswana, Vishrut Goyal, Sandeep Sen
2009 A conf
Computing single source shortest paths using single-objective fitness.
FOGA
Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann
2008 — ch.
Algorithms for Spanners in Weighted Graphs.
Encyclopedia of Algorithms
Surender Baswana, Sandeep Sen
2008 — conf
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error.
ICALP (1)
Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay
2008 A* conf
Fully dynamic algorithm for graph spanners with poly-logarithmic update time.
SODA
Surender Baswana, Soumojit Sarkar
2008 A* conf
Implied Set Closure and Its Application to Memory Consistency Verification.
CAV
Surender Baswana, Shashank K. Mehta, Vishal Powar
2008 J jnl
Streaming algorithm for graph spanners - single pass and constant processing time per edge.
Inf. Process. Lett.
Surender Baswana
2007 J jnl
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs.
Random Struct. Algorithms
Surender Baswana, Sandeep Sen
2007 J jnl
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.
J. Algorithms
Surender Baswana, Ramesh Hariharan, Sandeep Sen
2006 J jnl
Approximate distance oracles for unweighted graphs in expected
ACM Trans. Algorithms
Surender Baswana, Sandeep Sen
2006 A conf
Dynamic Algorithms for Graph Spanners.
ESA
Surender Baswana
2006 A* conf
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths.
FOCS
Surender Baswana, Telikepalli Kavitha
2006 J jnl
Faster Streaming algorithms for graph spanners
CoRR
Surender Baswana
2005 A conf
All-Pairs Nearly 2-Approximate Shortest-Paths in O(n
STACS
Surender Baswana, Vishrut Goyal, Sandeep Sen
2005 A* conf
New constructions of (alpha, beta)-spanners and purely additive spanners.
SODA
Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
2004 A* conf
Approximate distance oracles for unweighted graphs in Õ(n
SODA
Surender Baswana, Sandeep Sen
2004 — ch.
Randomized Graph Data-Structures for Approximate Shortest Paths.
Handbook of Data Structures and Applications
Surender Baswana, Sandeep Sen
2003 A* conf
A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n
ICALP
Surender Baswana, Sandeep Sen
2003 A* conf
Maintaining all-pairs approximate shortest paths under deletion of edges.
SODA
Surender Baswana, Ramesh Hariharan, Sandeep Sen
2002 A* conf
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.
STOC
Surender Baswana, Ramesh Hariharan, Sandeep Sen
2002 J jnl
Planar Graph Blocking for External Searching.
Algorithmica
Surender Baswana, Sandeep Sen
2000 — conf
Planar Graph Blocking for External Searching.
FSTTCS
Surender Baswana, Sandeep Sen