( en | de | ru )

 

Disambiguation of "Baswana, Surender"

Author of the publication

copydeleteadd this publication to your clipboard
Pertinent path profiling: Tracking interactions among relevant statements.

, , and . CGO, page 16:1-16:12. IEEE Computer Society, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Surender Kumar Gupta

Surender Singh Roperia

 

Other publications of authors with the same name

Approximate distance oracles for unweighted graphs in Õ(n2) time., and . SODA, page 271-280. SIAM, (2004)Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths., , and . STOC, page 117-123. ACM, (2002)A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs., and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 384-296. Springer, (2003)Dynamic DFS in Undirected Graphs: breaking the O(m) barrier., , , and . SODA, page 730-739. SIAM, (2016)Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient., , and . MFCS, volume 138 of LIPIcs, page 65:1-65:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time., , and . STACS, volume 3404 of Lecture Notes in Computer Science, page 666-679. Springer, (2005)A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs, and . Random Struct. Algorithms, 30 (4): 532-563 (2007)Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs., and . SIAM J. Comput., 39 (7): 2865-2896 (2010)Faster Streaming algorithms for graph spanners. CoRR, (2006)Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient., , and . CoRR, (2018)