ParAI

A Parameterized-Complexity Framework for Finding Local Optima
17th Innovations in Theoretical Computer Science Conference, ITCS 2026, 2026.
Note: to appear
Cite Project Project
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs (Best Paper Award)
2026 Symposium on Simplicity in Algorithms, SOSA 2026, 2026, SIAM.
Note: to appear
Cite Project Project Project
A Structural Complexity Analysis of Synchronous Dynamical Systems
Artificial Intelligence, 2026.
Note: to appear
Cite Project Project
Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Cite Project Project
Computing Twin-Width via Treedepth and Vertex Integrity
43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Cite Project
Coordinated Motion Planning is FPT on Discretized Simple Polygons
53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Cite Project Project
Coordinated Motion Planning is FPT on Discretized Simple Polygons
53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Cite Project Project
Fair Correlation Clustering Meets Graph Parameters
Proceedings of the 17th Latin American Theoretical Informatics (LATIN 2026), 2026.
Note: to appear
Cite Project Project
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
Algorithmica, volume 88, number 1, pages 8, 2026.
PDF Cite Project Project Project DOI
Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy
Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR.
Note: to appear
Cite Project Project