PGD

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs (Best Paper Award)
Cite Project Project Project
A Structural Complexity Analysis of Synchronous Dynamical Systems
Cite Project Project
Fair Correlation Clustering Meets Graph Parameters
Cite Project Project
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
PDF Cite Project Project Project DOI
Routing Few Robots in a Crowded Network
Cite Project Project Project
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots
PDF Cite Project Project DOI
Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity
Cite Project Project
Crossing and Independent Families Among Polygons
PDF Cite Project Project DOI
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable
Cite Project Project
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
PDF Cite Project Project Project DOI