The Parameterized Complexity of Coordinated Motion Planning

12 December 2023

Papers citing "The Parameterized Complexity of Coordinated Motion Planning"

3 / 3 papers shown

Title
Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology Foivos Fioravantes Dusan Knop Jan Matyás Kristan N. Melissinos Michal Opler 20 3 0 15 Dec 2023
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids Tzvika Geft 21 3 0 25 May 2023
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds Bahareh Banyassady Mark de Berg K. Bringmann K. Buchin Henning Fernau Dan Halperin Irina Kostitsyna Y. Okamoto Stijn Slot 37 10 0 16 May 2022