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

Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs., and . SOSA, page 106-120. SIAM, (2020)Near-Optimal Massively Parallel Graph Connectivity., , , , and . FOCS, page 1615-1636. IEEE Computer Society, (2019)Optimal Decremental Connectivity in Planar Graphs., and . STACS, volume 30 of LIPIcs, page 608-621. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Efficient Centroid-Linkage Clustering., , , , , , and . CoRR, (2024)Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs., and . ESA, volume 144 of LIPIcs, page 65:1-65:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Stochastic Graph Exploration., , , and . ICALP, volume 132 of LIPIcs, page 136:1-136:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Optimal Decremental Connectivity in Non-Sparse Graphs., , , , , and . ICALP, volume 261 of LIPIcs, page 6:1-6:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds., , , , and . COLT, volume 178 of Proceedings of Machine Learning Research, page 4643-4702. PMLR, (2022)Adaptive Massively Parallel Connectivity in Optimal Space., , , and . SPAA, page 431-441. ACM, (2023)Decremental SPQR-trees for Planar Graphs., , , , and . ESA, volume 112 of LIPIcs, page 46:1-46:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)