@InProceedings{brocken_et_al:LIPIcs.FUN.2021.15,
author = {Brocken, Thomas and van der Heijden, G. Wessel and Kostitsyna, Irina and Lo-Wong, Lloyd E. and Surtel, Remco J. A.},
title = {{Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.15},
URN = {urn:nbn:de:0030-drops-127769},
doi = {10.4230/LIPIcs.FUN.2021.15},
annote = {Keywords: Disc-robot motion planning, algorithmic complexity, PSPACE-hard}
}