Author of the publication

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

, , , and . IPEC, volume 214 of LIPIcs, page 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. 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 Complexity of Finding Small Separators in Temporal Graphs., , , and . MFCS, volume 117 of LIPIcs, page 45:1-45:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing., , , and . IPEC, volume 214 of LIPIcs, page 26:1-26:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)As Time Goes By: Reflections on Treewidth for Temporal Graphs., , , , and . Treewidth, Kernels, and Algorithms, volume 12160 of Lecture Notes in Computer Science, page 49-77. Springer, (2020)The Computational Complexity of Finding Separators in Temporal Graphs., , , and . CoRR, (2017)Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints., , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 62-74. Springer, (2019)Temporal graph classes: A view through temporal separators., , , , and . Theor. Comput. Sci., (2020)Restless Temporal Path Parameterized Above Lower Bounds.. STACS, volume 254 of LIPIcs, page 55:1-55:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Complexity of Transitively Orienting Temporal Graphs., , , , and . MFCS, volume 202 of LIPIcs, page 75:1-75:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Temporal reachability minimization: Delaying vs. deleting., , and . J. Comput. Syst. Sci., (2024)Computing Maximum Matchings in Temporal Graphs., , , , and . CoRR, (2019)