Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Baswana, Surender - Department of Computer Science and Engineering, Indian Institute of Technology Kanpur
All-Pairs Nearly 2-Approximate Shortest Paths in O(n2 Surender Baswana
Dynamic Algorithms for Graph Spanners Surender Baswana
Approximate Distance Oracles for Unweighted Graphs in Expected O(n 2 ) time #
Additive Spanners and (#, #)Spanners # Surender Baswana + Telikepalli Kavitha # Kurt Mehlhorn Seth Pettie
Planar Graph Blocking for External Searching Surender Baswana y and Sandeep Sen z
Faster Algorithms for Approximate Distance Oracles and AllPairs Small Stretch Surender Baswana #
Improved Decremental Algorithms for Maintaining Transitive Closure and All-Pairs
FASTER ALGORITHMS FOR ALL-PAIRS APPROXIMATE SHORTEST PATHS IN UNDIRECTED GRAPHS
Streaming Algorithm for Graph Spanners -Single Pass and Constant Processing Time per Edge
Simple Algorithms for Spanners in Weighted Graphs (2003; Baswana, Sen)
A Simple and Linear Time Randomized Algorithm for Computing Sparse Spanners in Weighted Graphs #
G = (V, E) V E u, v V t
Fully dynamic maximal matching in O(log n) update time Surender Baswana
Fully Dynamic Randomized Algorithms for Graph Spanners Surender Baswana
Single source distance oracle for planar digraphs avoiding a failed node or link Surender Baswana
G = (V, E) u, v V t t
