|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 7 occurrences of 6 keywords
|
|
|
|
|
Results
Found 27 publication records. Showing 27 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Surender Baswana, Utkarsh Lath, Anuradha S. Mehta |
Single source distance oracle for planar digraphs avoiding a failed node or link.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Surender Baswana, Manoj Gupta, Sandeep Sen |
Fully dynamic maximal matching in O(log n) update time |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Surender Baswana, Manoj Gupta, Sandeep Sen |
Fully Dynamic Maximal Matching in O (log n) Update Time. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
Additive spanners and (alpha, beta)-spanners. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha |
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Neelesh Khanna, Surender Baswana |
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Vishrut Goyal, Sandeep Sen |
All-pairs nearly 2-approximate shortest paths in I time. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann |
Computing single source shortest paths using single-objective fitness. |
FOGA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana |
Streaming algorithm for graph spanners - single pass and constant processing time per edge. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Sandeep Sen |
Algorithms for Spanners in Weighted Graphs. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Soumojit Sarkar |
Fully dynamic algorithm for graph spanners with poly-logarithmic update time. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay |
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Shashank K. Mehta, Vishal Powar |
Implied Set Closure and Its Application to Memory Consistency Verification. |
CAV |
2008 |
DBLP DOI BibTeX RDF |
Memory consistency model verification, Incremental transitive closure, Total store order, Shared memory multi-processor |
| 1 | Surender Baswana, Sandeep Sen |
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Sandeep Sen |
Approximate distance oracles for unweighted graphs in expected O(n2) time. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
Approximate distance oracles, distance queries, shortest paths, distances, spanners |
| 1 | Surender Baswana |
Faster Streaming algorithms for graph spanners |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Surender Baswana |
Dynamic Algorithms for Graph Spanners. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha |
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
New constructions of (alpha, beta)-spanners and purely additive spanners. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Vishrut Goyal, Sandeep Sen |
All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Sandeep Sen |
Approximate distance oracles for unweighted graphs in Õ(n2) time. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Maintaining all-pairs approximate shortest paths under deletion of edges. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
Randomized algorithms, Shortest path, Graph algorithms |
| 1 | Surender Baswana, Sandeep Sen |
Planar Graph Blocking for External Searching. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
BFS tree, decremental, reachability |
| 1 | Surender Baswana, Sandeep Sen |
Planar Graph Blocking for External Searching. |
FSTTCS |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #27 of 27 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")