# Surender Baswana

According to our database

Collaborative distances:

^{1}, 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

ACM Trans. Algorithms, 2020

CoRR, 2020

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

SIAM J. Comput., 2019

Interfaces, 2019

CoRR, 2019

Algorithmica, 2019

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

2018

SIAM J. Comput., 2018

SIAM J. Comput., 2018

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

2017

Algorithmica, 2017

2016

Encyclopedia of Algorithms, 2016

Encyclopedia of Algorithms, 2016

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

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

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

SIAM J. Comput., 2015

CoRR, 2015

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

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

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

2012

ACM Trans. Algorithms, 2012

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

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

2010

ACM Trans. Algorithms, 2010

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

Theor. Comput. Sci., 2009

Proceedings of the Foundations of Genetic Algorithms, 2009

2008

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

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

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

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

Proceedings of the Algorithms, 2006

2005

Proceedings of the STACS 2005, 2005

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

2004

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

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

2003

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

Algorithmica, 2002