PGD

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 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
bib Project Project Project
A Structural Complexity Analysis of Synchronous Dynamical Systems
Artificial Intelligence, 2026.
Note: to appear
bib Project Project
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
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
bib 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
bib Project Project
Fair Correlation Clustering Meets Graph Parameters
Proceedings of the 17th Latin American Theoretical Informatics (LATIN 2026), 2026.
Note: to appear
bib 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 bib Project Project Project DOI
Not All Degree Constraints Are Created Equal when Computing Spanning Trees
21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
bib Project Project
On the Complexity of Extending Storylines
Graph Drawing and Network Visualization (GD'26) (Löffler, Maarten and Miksch, Silvia), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
PDF bib Project