Nfpc

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
ACM Trans. Algorithms, volume 20, number 3, pages 19, 2024.
PDF Cite Project Project DOI
A Unifying Framework for Characterizing and Computing Width Measures
13th Innovations in Theoretical Computer Science Conference, ITCS 2022, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Cite Project Project
Algorithmic Applications of Tree-Cut Width
SIAM J. Discrete Math., volume 36, number 4, pages 2635-2666, 2022.
PDF Cite Project Project DOI
An efficient algorithm for counting Markov equivalent DAGs
Artificial Intelligence, volume 304, pages 103648, 2022.
PDF Cite Project Project DOI
Hedonic Diversity Games: A Complexity Picture with More than Two Colors
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 5034-5042, 2022, AAAI Press.
PDF Cite Project Project
How to Find a Good Explanation for Clustering?
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 3904-3912, 2022, AAAI Press.
PDF Cite Project
On Covering Segments with Unit Intervals
SIAM J. Discret. Math., volume 36, number 2, pages 1200-1230, 2022.
PDF Cite Project Project DOI
Parameterised Partially-Predrawn Crossing Number
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc and Michael Kerber), volume 224 of LIPIcs, pages 46:1-46:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF Cite Project Project DOI
Parameterized Algorithms for Upward Planarity
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc and Michael Kerber), volume 224 of LIPIcs, pages 26:1-26:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF Cite Project Project DOI
Sum-of-Products with Default Values: Algorithms and Complexity Results
Journal of Artificial Intelligence Research, volume 33, pages 535-552, 2022.
PDF Cite Project Project