NEBEL, B. On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs. Proceedings of the International Conference on Automated Planning and Scheduling, [S. l.], v. 30, n. 1, p. 212-216, 2020. DOI: 10.1609/icaps.v30i1.6663. Disponível em: https://ojs.aaai.org/index.php/ICAPS/article/view/6663. Acesso em: 12 jul. 2024.