| 2012 | ||
|---|---|---|
| 27 | Surender Baswana, Utkarsh Lath, Anuradha S. Mehta: Single source distance oracle for planar digraphs avoiding a failed node or link. SODA 2012: 223-232 | |
| 2011 | ||
| 26 | Surender Baswana, Manoj Gupta, Sandeep Sen: Fully Dynamic Maximal Matching in O (log n) Update Time. FOCS 2011: 383-392 | |
| 25 | Surender Baswana, Manoj Gupta, Sandeep Sen: Fully dynamic maximal matching in O(log n) update time CoRR abs/1103.1109: (2011) | |
| 2010 | ||
| 24 | Neelesh Khanna, Surender Baswana: Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs. STACS 2010: 513-524 | |
| 23 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie: Additive spanners and (alpha, beta)-spanners. ACM Transactions on Algorithms 7(1): 5 (2010) | |
| 22 | Surender Baswana, Telikepalli Kavitha: Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. SIAM J. Comput. 39(7): 2865-2896 (2010) | |
| 2009 | ||
| 21 | Surender 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 | |
| 20 | Surender Baswana, Vishrut Goyal, Sandeep Sen: All-pairs nearly 2-approximate shortest paths in I time. Theor. Comput. Sci. 410(1): 84-93 (2009) | |
| 2008 | ||
| 19 | Surender Baswana, Shashank K. Mehta, Vishal Powar: Implied Set Closure and Its Application to Memory Consistency Verification. CAV 2008: 94-106 | |
| 18 | Surender 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 | |
| 17 | Surender Baswana, Soumojit Sarkar: Fully dynamic algorithm for graph spanners with poly-logarithmic update time. SODA 2008: 1125-1134 | |
| 16 | Surender Baswana, Sandeep Sen: Algorithms for Spanners in Weighted Graphs. Encyclopedia of Algorithms 2008 | |
| 15 | Surender Baswana: Streaming algorithm for graph spanners - single pass and constant processing time per edge. Inf. Process. Lett. 106(3): 110-114 (2008) | |
| 2007 | ||
| 14 | Surender Baswana, Ramesh Hariharan, Sandeep Sen: Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. J. Algorithms 62(2): 74-92 (2007) | |
| 13 | Surender 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 | ||
| 12 | Surender Baswana: Dynamic Algorithms for Graph Spanners. ESA 2006: 76-87 | |
| 11 | Surender Baswana, Telikepalli Kavitha: Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. FOCS 2006: 591-602 | |
| 10 | Surender Baswana, Sandeep Sen: Approximate distance oracles for unweighted graphs in expected O(n2) time. ACM Transactions on Algorithms 2(4): 557-577 (2006) | |
| 9 | Surender Baswana: Faster Streaming algorithms for graph spanners CoRR abs/cs/0611023: (2006) | |
| 2005 | ||
| 8 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie: New constructions of (alpha, beta)-spanners and purely additive spanners. SODA 2005: 672-681 | |
| 7 | Surender Baswana, Vishrut Goyal, Sandeep Sen: All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time. STACS 2005: 666-679 | |
| 2004 | ||
| 6 | Surender Baswana, Sandeep Sen: Approximate distance oracles for unweighted graphs in Õ(n2) time. SODA 2004: 271-280 | |
| 2003 | ||
| 5 | Surender 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 | |
| 4 | Surender Baswana, Ramesh Hariharan, Sandeep Sen: Maintaining all-pairs approximate shortest paths under deletion of edges. SODA 2003: 394-403 | |
| 2002 | ||
| 3 | Surender Baswana, Ramesh Hariharan, Sandeep Sen: Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. STOC 2002: 117-123 | |
| 2 | Surender Baswana, Sandeep Sen: Planar Graph Blocking for External Searching. Algorithmica 34(3): 298-308 (2002) | |
| 2000 | ||
| 1 | Surender Baswana, Sandeep Sen: Planar Graph Blocking for External Searching. FSTTCS 2000: 252-263 | |
| 1 | Somenath Biswas | [21] |
| 2 | Benjamin Doerr | [21] |
| 3 | Tobias Friedrich | [21] |
| 4 | Akshay Gaur | [18] |
| 5 | Vishrut Goyal | [7] [20] |
| 6 | Manoj Gupta | [25] [26] |
| 7 | Ramesh Hariharan | [3] [4] [14] |
| 8 | Telikepalli Kavitha | [8] [11] [22] [23] |
| 9 | Neelesh Khanna | [24] |
| 10 | Piyush P. Kurur | [21] |
| 11 | Utkarsh Lath | [27] |
| 12 | Kurt Mehlhorn | [8] [23] |
| 13 | Anuradha S. Mehta | [27] |
| 14 | Shashank K. Mehta | [19] |
| 15 | Frank Neumann | [21] |
| 16 | Seth Pettie | [8] [23] |
| 17 | Vishal Powar | [19] |
| 18 | Soumojit Sarkar | [17] |
| 19 | Sandeep Sen | [1] [2] [3] [4] [5] [6] [7] [10] [13] [14] [16] [18] [20] [25] [26] |
| 20 | Jayant Upadhyay | [18] |
Colors in the list of coauthors
Last update Thu May 24 01:13:30 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page