Author of the publication

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces

, , , , , , , , and . Proc. 51st International Colloquium on Automata, Languages and Programming (ICALP'24), (2024)

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

The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201)., , , and . Dagstuhl Reports, 12 (5): 112-130 (2022)A parameterized view on matroid optimization problems.. Theor. Comput. Sci., 410 (44): 4471-4479 (2009)Minimum sum multicoloring on the edges of trees.. Theor. Comput. Sci., 361 (2-3): 133-149 (2006)Finding and Counting Permutations via CSPs., , and . IPEC, volume 148 of LIPIcs, page 1:1-1:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)., , , and . CoRR, (2019)The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk).. SWAT, volume 53 of LIPIcs, page 32:1-32:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The complexity of chromatic strength and chromatic edge strength.. Comput. Complex., 14 (4): 308-340 (2006)Tractable Structures for Constraint Satisfaction with Truth Tables.. STACS, volume 3 of LIPIcs, page 649-660. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix., , , and . STACS, volume 66 of LIPIcs, page 22:1-22:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Computing Square Colorings on Bounded-Treewidth and Planar Graphs., , , and . CoRR, (2022)