ParAI

A Fixed-Parameter Algorithm for Extending Upward Planar Drawings
34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
bib Project Project
A Parameterized-Complexity Framework for Finding Local Optima
17th Innovations in Theoretical Computer Science Conference, ITCS 2026, Bocconi University, Milan, Italy, January 27-30, 2026 (Shubhangi Saraf), volume 362 of LIPIcs, pages 66:1-66:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF bib Project Project DOI
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
2026 Symposium on Simplicity in Algorithms, SOSA 2026, Vancouver, BC, Canada, January 12-14, 2026 (Sepehr Assadi and Eva Rotenberg), pages 65-80, 2026, SIAM.
PDF bib Project Project Project DOI
A structural complexity analysis of synchronous dynamical systems
Artif. Intell., volume 351, pages 104472, 2026.
PDF bib Project Project DOI
Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, Lisbon, Portugal, July 20-23, 2026 (Alexey Ignatiev and Stefan Szeider), volume 377 of LIPIcs, pages 16:1-16:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF bib Project Project DOI
Circle Graph 3-Coloring: Can Simplicity Beat SAT?
34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
bib Project Project
Computing Twin-Width via Treedepth and Vertex Integrity
43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, Grenoble, France, March 9-13, 2026 (Meena Mahajan and Florin Manea and Annabelle McIver and Kim Thang Nguyen), volume 364 of LIPIcs, pages 42:1-42:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF bib Project DOI
Coordinated Motion Planning Is FPT on Discretized Simple Polygons
53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya and Danupon Nanongkai and Michael Benedikt and Gabriele Puppis), volume 374 of LIPIcs, pages 75:1-75:13, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF bib Project Project DOI
Fair Correlation Clustering Meets Graph Parameters
Proceedings of the 17th Latin American Theoretical Informatics (LATIN 2026), 2026.
Note: to appear
bib Project Project
Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya and Danupon Nanongkai and Michael Benedikt and Gabriele Puppis), volume 374 of LIPIcs, pages 38:1-38:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF bib Project Project DOI