( en | de | ru )

 

Disambiguation of "Baswana, Surender"

Author of the publication

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

, , , and . SODA, page 730-739. SIAM, (2016)

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

Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs., and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 138-149. Springer, (2014)Fully dynamic algorithm for graph spanners with poly-logarithmic update time., and . SODA, page 1125-1134. SIAM, (2008)Vital Edges for (s, t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle., and . CoRR, (2023)Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier., , , and . SIAM J. Comput., 48 (4): 1335-1363 (2019)Single source distance oracle for planar digraphs avoiding a failed node or link., , and . SODA, page 223-232. SIAM, (2012)Streaming algorithm for graph spanners - single pass and constant processing time per edge.. Inf. Process. Lett., 106 (3): 110-114 (2008)Mincut Sensitivity Data Structures for the Insertion of an Edge., , and . ESA, volume 173 of LIPIcs, page 12:1-12:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs., , , and . FSTTCS, volume 18 of LIPIcs, page 257-266. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Faster Streaming algorithms for graph spanners. CoRR, (2006)Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error., , , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 609-621. Springer, (2008)