Surender Baswana

According to our database1, Surender Baswana authored at least 50 papers between 2002 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Approximate Single-Source Fault Tolerant Shortest Path.
ACM Trans. Algorithms, 2020

Fault-Tolerant All-Pairs Mincuts.
CoRR, 2020

Mincut Sensitivity Data Structures for the Insertion of an Edge.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier.
SIAM J. Comput., 2019

Centralized Admissions for Engineering Colleges in India.
Interfaces, 2019

Joint Seat Allocation 2018: An algorithmic perspective.
CoRR, 2019

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

Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.
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).
SIAM J. Comput., 2018

Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal.
SIAM J. Comput., 2018

Incremental DFS algorithms: a theoretical and experimental study.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs.
Algorithmica, 2017

2016
Simple Algorithms for Spanners in Weighted Graphs.
Encyclopedia of Algorithms, 2016

Matching in Dynamic Graphs.
Encyclopedia of Algorithms, 2016

Fault tolerant subgraph for single source reachability: generic and optimal.
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.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk).
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
Fully Dynamic Maximal Matching in O(log n) Update Time.
SIAM J. Comput., 2015

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

Fault Tolerant Reachability for Directed Graphs.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

On Dynamic DFS Tree in Directed Graphs.
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.
Algorithmica, 2013

Pertinent path profiling: Tracking interactions among relevant statements.
Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization, 2013

2012
Fully dynamic randomized algorithms for graph spanners.
ACM Trans. Algorithms, 2012

Single source distance oracle for planar digraphs avoiding a failed node or link.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2010
Additive spanners and (alpha, beta)-spanners.
ACM Trans. Algorithms, 2010

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs.
SIAM J. Comput., 2010

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

Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs.
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.
Theor. Comput. Sci., 2009

Computing single source shortest paths using single-objective fitness.
Proceedings of the Foundations of Genetic Algorithms, 2009

2008
Algorithms for Spanners in Weighted Graphs.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

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

Fully dynamic algorithm for graph spanners with poly-logarithmic update time.
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.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Implied Set Closure and Its Application to Memory Consistency Verification.
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.
Random Struct. Algorithms, 2007

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.
J. Algorithms, 2007

2006
Approximate distance oracles for unweighted graphs in expected <i>O</i>(<i>n</i><sup>2</sup>) time.
ACM Trans. Algorithms, 2006

Faster Streaming algorithms for graph spanners
CoRR, 2006

Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Dynamic Algorithms for Graph Spanners.
Proceedings of the Algorithms, 2006

2005
All-Pairs Nearly 2-Approximate Shortest-Paths in O(n<sup>2</sup> polylog n) Time.
Proceedings of the STACS 2005, 2005

New constructions of (alpha, beta)-spanners and purely additive spanners.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Randomized Graph Data-Structures for Approximate Shortest Paths.
Proceedings of the Handbook of Data Structures and Applications., 2004

Approximate distance oracles for unweighted graphs in Õ(n<sup>2</sup>) time.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Maintaining all-pairs approximate shortest paths under deletion of edges.
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<sup>1+1/k</sup>) Size in Weighted Graphs.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Planar Graph Blocking for External Searching.
Algorithmica, 2002


  Loading...