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), 212-216. https://doi.org/10.1609/icaps.v30i1.6663