1. Almanza, M., Leucci, S., Panconesi, A.: Tracks from hell - when finding a proof may be easier than checking it. In: Ito, H., Leonardi, S., Pagli, L., Prencipe, G. (eds.) Proceedings of the 9th International Conference on Fun with Algorithms (FUN 2018). LIPIcs, vol. 100, pp. 4:1–4:13. La Maddalena, Italy, June 2018. https://doi.org/10.4230/LIPIcs.FUN.2018.4
2. Ani, J., Demaine, E.D., Hendrickson, D.H., Lynch, J.: Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets. arXiv preprint arXiv:2005.03192 (2020)
3. Demaine, E.D., Grosof, I., Lynch, J., Rudoy, M.: Computational complexity of motion planning of a robot through simple gadgets. In: Proceedings of the 9th International Conference on Fun with Algorithms (FUN 2018). LIPIcs, vol. 100, pp. 18:1–18:21, La Maddalena, Italy, June 2018
4. Demaine, E.D., Hendrickson, D., Lynch, J.: Toward a general theory of motion planning complexity: Characterizing which gadgets make games hard. In: Proceedings of the 11th Conference on Innovations in Theoretical Computer Science (ITCS 2020), pp. 62:1–62:42, Seattle, Washington, January 2020
5. Dohrau, J., Gärtner, B., Kohler, M., Matoušek, J., Welzl, E.: ARRIVAL: a zero-player graph game in NP $$\cap $$ coNP. In: Loebl, M., Nešetřil, J., Thomas, R. (eds.) A Journey Through Discrete Mathematics, pp. 367–374. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-44479-6_14