Nebel, Bernhard. 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-16. https://ojs.aaai.org/index.php/ICAPS/article/view/6663.