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

Dynamic Clustering to Minimize the Sum of Radii., , and . ESA, volume 87 of LIPIcs, page 48:1-48:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk).. ICALP, volume 80 of LIPIcs, page 2:1-2:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Shared-Memory Branch-and-Reduce for Multiterminal Cuts., , and . ALENEX, page 42-55. SIAM, (2020)Simple, Scalable and Effective Clustering via One-Dimensional Projections., , , , and . CoRR, (2023)Combinatorial algorithms for web search engines: three success stories.. SODA, page 1022-1026. SIAM, (2007)Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time., , and . SODA, page 470-489. SIAM, (2017)Dynamically Maintaining the Persistent Homology of Time Series., , , and . SODA, page 243-295. SIAM, (2024)An O(n2) time algorithm for alternating Büchi games., and . SODA, page 1386-1399. SIAM, (2012)Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives., , , , and . CAV (2), volume 10982 of Lecture Notes in Computer Science, page 178-197. Springer, (2018)A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems., , , and . ITCS, volume 251 of LIPIcs, page 69:1-69:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)