1

Computing Twin-Width Parameterized by the Feedback Edge Number
41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov, eds.), volume 289 of LIPIcs, pages 7:1–7:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF bib Project DOI
Constrained Boundary Labeling
Algorithms and Computation (ISAAC'24) (Julian Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 26:1–26:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
PDF bib Project DOI
Counting Vanishing Matrix-Vector Products
WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings (Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, eds.), volume 14549 of Lecture Notes in Computer Science, pages 335–349, 2024, Springer.
PDF bib Project DOI
Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)
35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Julián Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 40:1–40:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF bib Project DOI
Enumerating Minimal Solution Sets for Metric Graph Problems
Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers (Daniel Král, Martin Milanic, eds.), volume 14760 of Lecture Notes in Computer Science, pages 50–64, 2024, Springer.
PDF bib Project DOI
eSLIM: Circuit Minimization with SAT Based Local Improvement
27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1–23:14, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
bib Project DOI
Exact Algorithms for Clustered Planarity with Linear Saturators
35th International Symposium on Algorithms and Computation, ISAAC 2024, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
bib Project
Explaining Decisions in ML Models: A Parameterized Complexity Analysis
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 563–573, 8 2024.
PDF bib DOI
First-Order Model Checking on Monadically Stable Graph Classes
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pages 21-30, 2024.
PDF bib DOI
Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes
Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC), pages 1550–1560, 2024.
PDF bib