1. Ani, J., Bosboom, J., Demaine, E., Diomidov, Y., Hendrickson, D., Lynch, J.: Walking through doors is hard, even without staircases: Proving PSPACE-hardness via planar assemblies of door gadgets. In: Proceedings of the 10th International Conference on Fun with Algorithms, vol. 157, pp. 3:1–3:23 (2020)
2. Asif, S., et al.: Tetris is NP-hard even with $${O}$$(1) rows or columns. J. Inf. Process. 28, 942–958 (2020)
3. Biedl, T., Demaine, E., Demaine, M., Fleischer, R., Jacobson, L., Munro, J.I.: The complexity of Clickomania. In: Nowakowski, R.J. (ed.) More Games of No Chance, pp. 389–404. Cambridge University Press, Cambridge (2002)
4. Breukelaar, R., Demaine, E., Hohenberger, S., Hoogeboom, H., Kosters, W., Liben-Nowell, D.: Tetris is hard, even to approximate. Int. J. Comput. Geometry Appl. 14(1–2), 41–68 (2004)
5. Demaine, E., Viglietta, G., Williams, A.: Super Mario Bros. is harder/easier than we thought. In: Proceedings of the 9th International Conference on Fun with Algorithms, pp. 13:1–13:14 (2016)