1. Akitaya, H.A., et al.: Characterizing universal reconfigurability of modular pivoting robots. In: 37th International Symposium on Computational Geometry (2021)
2. Balanza-Martinez, J., et al.: Full tilt: universal constructors for general shapes with uniform external forces. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2689–2708. SIAM (2019)
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), La Maddalena, Italy, pp. 18:1–18:21, 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), Seattle, Washington, pp. 62:1–62:42, January 2020
5. Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoret. Comput. Sci. 343(1–2), 72–96 (2005)