From post

The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing.

, , , и . IPEC, том 214 из LIPIcs, стр. 26:1-26:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

 

Другие публикации лиц с тем же именем

Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs., и . CoRR, (2020)Parameterized Complexity of Min-Power Asymmetric Connectivity., , , , и . Theory Comput. Syst., 64 (7): 1158-1182 (2020)Parameterized Complexity of Geodetic Set., и . J. Graph Algorithms Appl., 26 (4): 401-419 (2022)Structural Parameterizations of the Biclique-Free Vertex Deletion Problem., , и . CoRR, (2023)Correlating Theory and Practice in Finding Clubs and Plexes., , , и . CoRR, (2022)Binary Matrix Completion Under Diameter Constraints., , и . STACS, том 187 из LIPIcs, стр. 47:1-47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Parameterized Algorithms for Matrix Completion with Radius Constraints., , и . CPM, том 161 из LIPIcs, стр. 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication., , и . CoRR, (2024)Essentially Tight Kernels for (Weakly) Closed Graphs., , и . Algorithmica, 85 (6): 1706-1735 (июня 2023)Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees., , и . IPEC, том 249 из LIPIcs, стр. 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)