Author of the publication

On the parameterized complexity of clustering problems for incomplete data.

, , , , and . J. Comput. Syst. Sci., (June 2023)

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

A polynomial kernel for $3$-leaf power deletion., , , and . CoRR, (2019)On the complexity of rainbow coloring problems., , and . Discret. Appl. Math., (2018)Complexity of the Steiner Network Problem with Respect to the Number of Terminals., , , and . STACS, volume 126 of LIPIcs, page 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Lossy Kernels for Connected Dominating Set on Sparse Graphs., , , , and . STACS, volume 96 of LIPIcs, page 29:1-29:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source., , , , and . CoRR, (2023)EPTAS for k-means Clustering of Affine Subspaces., , , , , and . SODA, page 2649-2659. SIAM, (2021)A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion., , and . J. Comput. Syst. Sci., (2018)On the parameterized complexity of clustering problems for incomplete data., , , , and . J. Comput. Syst. Sci., (June 2023)The Parameterized Complexity of Welfare Guarantees in Schelling Segregation., , and . CoRR, (2022)Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem., , , , and . CoRR, (2023)