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

Refined Lower Bounds for Nearest Neighbor Condensation.. ALT, volume 167 of Proceedings of Machine Learning Research, page 262-281. PMLR, (2022)A Tight Lower Bound for Planar Steiner Orientation., , and . Algorithmica, 81 (8): 3200-3216 (2019)List H-Coloring a Graph by Removing Few Vertices., , and . Algorithmica, 78 (1): 110-146 (2017)Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets., , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 80-93. Springer, (2018)FPT Inapproximability of Directed Cut and Connectivity Problems., and . IPEC, volume 148 of LIPIcs, page 8:1-8:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Tight Bounds for Gomory-Hu-like Cut Counting., , and . WG, volume 9941 of Lecture Notes in Computer Science, page 133-144. (2016)Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs., and . Encyclopedia of Algorithms, (2016)Towards a Theory of Parameterized Streaming Algorithms., and . IPEC, volume 148 of LIPIcs, page 7:1-7:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs.. CIAC, volume 12701 of Lecture Notes in Computer Science, page 187-201. Springer, (2021)How Does Fairness Affect the Complexity of Gerrymandering?, , and . AAMAS, page 2869-2871. ACM, (2023)