PGD

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
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
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
ACM Transactions on Algorithms, 2026.
Note: to appear
Cite Project Project
Realizing Planar Linkages in Polygonal Domains
International Workshop on Combinatorial Algorithms (IWOCA'26), 2026.
Note: To appear.
Cite Project
Routing Few Robots in a Crowded Network
Journal of Computer and System Sciences, 2026.
Note: to appear
Cite Project Project Project
The Parameterized Complexity of Coordinated Motion Planning
Discrete and Computational Geometry, 2026.
Note: to appear
Cite Project Project