Author of the publication

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.

 

Other publications of authors with the same name

All-Pairs $2$-reachability in Õ(nω) Time., , , , and . CoRR, (2016)Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version)., and . SWAT, volume 621 of Lecture Notes in Computer Science, page 221-232. Springer, (1992)On Suffix Extensions in Suffix Trees., and . SPIRE, volume 7024 of Lecture Notes in Computer Science, page 301-312. Springer, (2011)Sorting and searching in the presence of memory faults (without redundancy)., and . STOC, page 101-110. ACM, (2004)A new approach to dynamic all pairs shortest paths., and . STOC, page 159-166. ACM, (2003)Getting Back to the Past in the Union-Find Problem., , and . STACS, volume 294 of Lecture Notes in Computer Science, page 8-17. Springer, (1988)Efficient cross-trees for external memory., and . External Memory Algorithms, volume 50 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 87-106. DIMACS/AMS, (1998)Dispersion of Mobile Robots on Directed Anonymous Graphs., , and . SIROCCO, volume 13298 of Lecture Notes in Computer Science, page 191-211. Springer, (2022)Finding Strong Bridges and Strong Articulation Points in Linear Time., , and . COCOA (1), volume 6508 of Lecture Notes in Computer Science, page 157-169. Springer, (2010)Dominating Sets and Connected Dominating Sets in Dynamic Graphs., , , and . STACS, volume 126 of LIPIcs, page 35:1-35:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)