dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Surender Baswana Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Utkarsh Lath, Anuradha S. Mehta: Single source distance oracle for planar digraphs avoiding a failed node or link. SODA 2012: 223-232
2011
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Manoj Gupta, Sandeep Sen: Fully Dynamic Maximal Matching in O (log n) Update Time. FOCS 2011: 383-392
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Manoj Gupta, Sandeep Sen: Fully dynamic maximal matching in O(log n) update time CoRR abs/1103.1109: (2011)
2010
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNeelesh Khanna, Surender Baswana: Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs. STACS 2010: 513-524
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie: Additive spanners and (alpha, beta)-spanners. ACM Transactions on Algorithms 7(1): 5 (2010)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Telikepalli Kavitha: Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. SIAM J. Comput. 39(7): 2865-2896 (2010)
2009
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann: Computing single source shortest paths using single-objective fitness. FOGA 2009: 59-66
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Vishrut Goyal, Sandeep Sen: All-pairs nearly 2-approximate shortest paths in I time. Theor. Comput. Sci. 410(1): 84-93 (2009)
2008
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Shashank K. Mehta, Vishal Powar: Implied Set Closure and Its Application to Memory Consistency Verification. CAV 2008: 94-106
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay: Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. ICALP (1) 2008: 609-621
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Soumojit Sarkar: Fully dynamic algorithm for graph spanners with poly-logarithmic update time. SODA 2008: 1125-1134
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Sandeep Sen: Algorithms for Spanners in Weighted Graphs. Encyclopedia of Algorithms 2008
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana: Streaming algorithm for graph spanners - single pass and constant processing time per edge. Inf. Process. Lett. 106(3): 110-114 (2008)
2007
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Ramesh Hariharan, Sandeep Sen: Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. J. Algorithms 62(2): 74-92 (2007)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Sandeep Sen: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms 30(4): 532-563 (2007)
2006
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana: Dynamic Algorithms for Graph Spanners. ESA 2006: 76-87
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Telikepalli Kavitha: Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. FOCS 2006: 591-602
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Sandeep Sen: Approximate distance oracles for unweighted graphs in expected O(n2) time. ACM Transactions on Algorithms 2(4): 557-577 (2006)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana: Faster Streaming algorithms for graph spanners CoRR abs/cs/0611023: (2006)
2005
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie: New constructions of (alpha, beta)-spanners and purely additive spanners. SODA 2005: 672-681
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Vishrut Goyal, Sandeep Sen: All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time. STACS 2005: 666-679
2004
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Sandeep Sen: Approximate distance oracles for unweighted graphs in Õ(n2) time. SODA 2004: 271-280
2003
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Sandeep Sen: A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs. ICALP 2003: 384-296
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Ramesh Hariharan, Sandeep Sen: Maintaining all-pairs approximate shortest paths under deletion of edges. SODA 2003: 394-403
2002
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Ramesh Hariharan, Sandeep Sen: Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. STOC 2002: 117-123
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Sandeep Sen: Planar Graph Blocking for External Searching. Algorithmica 34(3): 298-308 (2002)
2000
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender Baswana, Sandeep Sen: Planar Graph Blocking for External Searching. FSTTCS 2000: 252-263

Coauthor Index

1Somenath Biswas [21]
2Benjamin Doerr [21]
3Tobias Friedrich [21]
4Akshay Gaur [18]
5Vishrut Goyal [7] [20]
6Manoj Gupta [25] [26]
7Ramesh Hariharan [3] [4] [14]
8Telikepalli Kavitha [8] [11] [22] [23]
9Neelesh Khanna [24]
10Piyush P. Kurur [21]
11Utkarsh Lath [27]
12Kurt Mehlhorn [8] [23]
13Anuradha S. Mehta [27]
14Shashank K. Mehta [19]
15Frank Neumann [21]
16Seth Pettie [8] [23]
17Vishal Powar [19]
18Soumojit Sarkar [17]
19Sandeep Sen [1] [2] [3] [4] [5] [6] [7] [10] [13] [14] [16] [18] [20] [25] [26]
20Jayant Upadhyay [18]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page