Author of the publication

Contracting a Planar Graph Efficiently.

, , , , , and . ESA, volume 87 of LIPIcs, page 50:1-50:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Near-Optimal Massively Parallel Graph Connectivity., , , , and . FOCS, page 1615-1636. IEEE Computer Society, (2019)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)Optimal Decremental Connectivity in Planar Graphs., and . STACS, volume 30 of LIPIcs, page 608-621. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Scalable Community Detection via Parallel Correlation Clustering., , , , and . Proc. VLDB Endow., 14 (11): 2305-2313 (2021)Fully Dynamic Consistent k-Center Clustering., , , , and . CoRR, (2023)Massively Parallel Computation via Remote Memory Access., , , , , and . ACM Trans. Parallel Comput., 8 (3): 13:1-13:25 (2021)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)Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs., and . SOSA, page 106-120. SIAM, (2020)Near-Optimal Decremental Approximate Multi-Source Shortest Paths., and . CoRR, (2020)