Nebel, B. (2020) “On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs”, Proceedings of the International Conference on Automated Planning and Scheduling, 30(1), pp. 212-216. Available at: https://ojs.aaai.org/index.php/ICAPS/article/view/6663 (Accessed: 28February2021).