1. Ani, J., Demaine, E.D., Hendrickson, D.H., Lynch, J.: Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets. In: Proceedings of the 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022) (2022). arXiv:2005.03192
2. 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), pp. 18:1–18:21 (2018)
3. Demaine, E.D., Hearn, R.A.: Constraint logic: a uniform framework for modeling computation as games. In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, pp. 149–162, June 2008
4. Demaine, E.D., Hendrickson, D.H., Lynch, J.: Toward a general complexity theory of motion planning: characterizing which gadgets make games hard. In: Proceedings of the 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), pp. 62:1–62:42 (2020)
5. Demaine, E.D., Lynch, J., Mirano, G.J., Tyagi, N.: Energy-efficient algorithms. In: Proceedings of the 7th Annual ACM Conference on Innovations in Theoretical Computer Science (ITCS 2016), Cambridge, Massachusetts, pp. 321–332, 14–16 January 2016