B. Nebel, “On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs”, ICAPS, vol. 30, no. 1, pp. 212-216, Jun. 2020.