Surender Baswana

According to our database, Surender Baswana authored at least 56 papers between 2002 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles.

Surender Baswana, Koustav Bhanja

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Minimum+1 (<i>s, t</i>)-cuts and Dual-edge Sensitivity Oracle.

Surender Baswana, Koustav Bhanja, Abhyuday Pandey

ACM Trans. Algorithms, October, 2023

Vital Edges for (s, t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle.

Surender Baswana, Koustav Bhanja

CoRR, 2023

2022

Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient.

Surender Baswana, Shiv Kumar Gupta, Ayush Tulsyan

Algorithmica, 2022

Mincut Sensitivity Data Structures for the Insertion of an Edge.

Surender Baswana, Shiv Kumar Gupta, Till Knollmann

Algorithmica, 2022

Sensitivity Oracles for All-Pairs Mincuts.

Surender Baswana, Abhyuday Pandey

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle.

Surender Baswana, Koustav Bhanja, Abhyuday Pandey

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2020

Approximate Single-Source Fault Tolerant Shortest Path.

Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty

ACM Trans. Algorithms, 2020

Fault-Tolerant All-Pairs Mincuts.

Surender Baswana, Abhyuday Pandey

CoRR, 2020

2019

Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier.

Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan

SIAM J. Comput., 2019

Centralized Admissions for Engineering Colleges in India.

Surender Baswana, Partha Pratim Chakrabarti, Sharat Chandran, Yashodhan Kanoria, Utkarsh Patange

INFORMS J. Appl. Anal., 2019

Joint Seat Allocation 2018: An algorithmic perspective.

Surender Baswana, P. P. Chakrabarti, Yashodhan Kanoria, Utkarsh Patange, Sharat Chandran

CoRR, 2019

An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model.

Surender Baswana, Keerti Choudhary, Liam Roditty

Algorithmica, 2019

Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.

Surender Baswana, Shiv Kumar Gupta, Ayush Tulsyan

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version).

Surender Baswana, Manoj Gupta, Sandeep Sen

SIAM J. Comput., 2018

Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal.

Surender Baswana, Keerti Choudhary, Liam Roditty

SIAM J. Comput., 2018

Incremental DFS algorithms: a theoretical and experimental study.

Surender Baswana, Ayush Goel, Shahbaz Khan

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs.

Surender Baswana, Shahbaz Khan

Algorithmica, 2017

2016

Simple Algorithms for Spanners in Weighted Graphs.

Surender Baswana, Sandeep Sen

Encyclopedia of Algorithms, 2016

Matching in Dynamic Graphs.

Surender Baswana, Manoj Gupta, Sandeep Sen

Encyclopedia of Algorithms, 2016

Fault tolerant subgraph for single source reachability: generic and optimal.

Surender Baswana, Keerti Choudhary, Liam Roditty

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Dynamic DFS in Undirected Graphs: breaking the O(<i>m</i>) barrier.

Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk).

Surender Baswana

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

Fully Dynamic Maximal Matching in O(log n) Update Time.

Surender Baswana, Manoj Gupta, Sandeep Sen

SIAM J. Comput., 2015

Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier.

Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan

CoRR, 2015

Fault Tolerant Reachability for Directed Graphs.

Surender Baswana, Keerti Choudhary, Liam Roditty

Proceedings of the Distributed Computing - 29th International Symposium, 2015

On Dynamic DFS Tree in Directed Graphs.

Surender Baswana, Keerti Choudhary

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2013

Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs.

Surender Baswana, Neelesh Khanna

Algorithmica, 2013

Pertinent path profiling: Tracking interactions among relevant statements.

Ramshankar Chouhan, Subhajit Roy, Surender Baswana

Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization, 2013

2012

Fully dynamic randomized algorithms for graph spanners.

Surender Baswana, Sumeet Khurana, Soumojit Sarkar

ACM Trans. Algorithms, 2012

Single source distance oracle for planar digraphs avoiding a failed node or link.

Surender Baswana, Utkarsh Lath, Anuradha S. Mehta

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs.

Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2010

Additive spanners and (alpha, beta)-spanners.

Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie

ACM Trans. Algorithms, 2010

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs.

Surender Baswana, Telikepalli Kavitha

SIAM J. Comput., 2010

Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph

Neelesh Khanna, Surender Baswana

CoRR, 2010

Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs.

Neelesh Khanna, Surender Baswana

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

2009

All-pairs nearly 2-approximate shortest paths in <i>I</i> time.

Surender Baswana, Vishrut Goyal, Sandeep Sen

Theor. Comput. Sci., 2009

Computing single source shortest paths using single-objective fitness.

Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann

Proceedings of the Foundations of Genetic Algorithms, 2009

2008

Algorithms for Spanners in Weighted Graphs.

Surender Baswana, Sandeep Sen

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Streaming algorithm for graph spanners - single pass and constant processing time per edge.

Surender Baswana

Inf. Process. Lett., 2008

Fully dynamic algorithm for graph spanners with poly-logarithmic update time.

Surender Baswana, Soumojit Sarkar

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error.

Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Implied Set Closure and Its Application to Memory Consistency Verification.

Surender Baswana, Shashank K. Mehta, Vishal Powar

Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007

A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs.

Surender Baswana, Sandeep Sen

Random Struct. Algorithms, 2007

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.

Surender Baswana, Ramesh Hariharan, Sandeep Sen

J. Algorithms, 2007

2006

Approximate distance oracles for unweighted graphs in expected <i>O</i>(<i>n</i>²) time.

Surender Baswana, Sandeep Sen

ACM Trans. Algorithms, 2006

Faster Streaming algorithms for graph spanners

Surender Baswana

CoRR, 2006

Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths.

Surender Baswana, Telikepalli Kavitha

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Dynamic Algorithms for Graph Spanners.

Surender Baswana

Proceedings of the Algorithms, 2006

2005

All-Pairs Nearly 2-Approximate Shortest-Paths in O(n² polylog n) Time.

Surender Baswana, Vishrut Goyal, Sandeep Sen

Proceedings of the STACS 2005, 2005

New constructions of (alpha, beta)-spanners and purely additive spanners.

Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Randomized Graph Data-Structures for Approximate Shortest Paths.

Surender Baswana, Sandeep Sen

Proceedings of the Handbook of Data Structures and Applications., 2004

Approximate distance oracles for unweighted graphs in Õ(n²) time.

Surender Baswana, Sandeep Sen

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Maintaining all-pairs approximate shortest paths under deletion of edges.

Surender Baswana, Ramesh Hariharan, Sandeep Sen

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n^1+1/k) Size in Weighted Graphs.

Surender Baswana, Sandeep Sen

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Planar Graph Blocking for External Searching.

Surender Baswana, Sandeep Sen

Algorithmica, 2002