ParAI

A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots

A Structural Complexity Analysis of Hierarchical Task Network Planning

Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity

Jakub Balabán, Robert Ganian, Mathis Teva Rocton

Crossing and Independent Families Among Polygons

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable

Liana Khazaliya

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms

Thomas Depian, Simon Dominik Fink, Robert Ganian, Vaishali Surianarayanan

Parameterized Algorithms for Multiagent Pathfinding on Trees

Parameterized Complexity in Machine Learning

Parameterized Complexity of Caching in Networks

Pathways to Tractability for Geometric Thickness (Best Paper Award)

Alexander Firbas