Author of the publication

Cluster Editing with Vertex Splitting.

, , , , and . ISCO, volume 10856 of Lecture Notes in Computer Science, page 1-13. Springer, (2018)

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

Multiple Levels of Importance in Matching with Distributional Constraints: Extended Abstract., , , and . AAMAS, page 1759-1761. International Foundation for Autonomous Agents and Multiagent Systems, (2020)From Matching with Diversity Constraints to Matching with Regional Quotas., , , and . AAMAS, page 377-385. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Kernels for Global Constraints., and . IJCAI, page 540-545. IJCAI/AAAI, (2011)Turbocharging Treewidth Heuristics., , , , and . Algorithmica, 81 (2): 439-475 (2019)Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements., , , and . ISAAC, volume 92 of LIPIcs, page 37:1-37:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Backdoors to Acyclic SAT., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 363-374. Springer, (2012)Backdoors to Satisfaction., and . The Multivariate Algorithmic Revolution and Beyond, volume 7370 of Lecture Notes in Computer Science, page 287-317. Springer, (2012)Faster Algorithms for Weak Backdoors., and . AAAI, page 3741-3748. AAAI Press, (2022)Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems., and . CoRR, (2023)Strong Backdoors to Bounded Treewidth SAT., and . FOCS, page 489-498. IEEE Computer Society, (2013)