[1]
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 (Jun. 2020), 212-216.