Geft, T. (2023) “Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids”, Proceedings of the International Symposium on Combinatorial Search, 16(1), pp. 20–28. doi: 10.1609/socs.v16i1.27279.