( en | de | ru )

 

Disambiguation of "Baswana, Surender"

Author of the publication

copydeleteadd this publication to your clipboard
Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier.

, , , and . CoRR, (2015)

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)Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient., , and . Algorithmica, 84 (7): 2028-2049 (2022)Dynamic DFS in Undirected Graphs: breaking the O(m) barrier., , , and . SODA, page 730-739. SIAM, (2016)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)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)Streaming algorithm for graph spanners - single pass and constant processing time per edge.. Inf. Process. Lett., 106 (3): 110-114 (2008)Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs., and . Algorithmica, 79 (2): 466-483 (2017)Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier., , , and . CoRR, (2015)