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

Voronoi Game on Graphs., , , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 77-88. Springer, (2013)Socially Fair Matching: Exact and Approximation Algorithms., , , , and . WADS, volume 14079 of Lecture Notes in Computer Science, page 79-92. Springer, (2023)Coresets for Clustering in Geometric Intersection Graphs., , and . SoCG, volume 258 of LIPIcs, page 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching., and . SoCG, volume 293 of LIPIcs, page 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Lossy Kernelization of Same-Size Clustering., , , , and . CSR, volume 13296 of Lecture Notes in Computer Science, page 96-114. Springer, (2022)Near-Optimal Clustering in the k-machine model., , , and . ICDCN, page 15:1-15:10. ACM, (2018)A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering., , , and . CoRR, (2024)Geometric Covering via Extraction Theorem., , , , and . ITCS, volume 287 of LIPIcs, page 7:1-7:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications., , and . ICALP, volume 198 of LIPIcs, page 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Geometric Planar Networks on Bichromatic Points., , , and . CALDAM, volume 12016 of Lecture Notes in Computer Science, page 79-91. Springer, (2020)