1. Adleman, L., et al.: Combinatorial optimization problems in self-assembly. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 23–32 (2002)
2. Akitaya, H.A., et al.: Characterizing universal reconfigurability of modular pivoting robots. In: Proceedings of the 37th International Symposium on Computational Geometry (2021)
3. Alaniz, R.M., et al.: Complexity of reconfiguration in surface chemical reaction networks. In: Chen, H.-L., Evans, C.G. (Eds.) Proceedings of the 29th International Conference on DNA Computing and Molecular Programming (DNA 29), vol. 276. Leibniz International Proceedings in Informatics (LIPIcs), pp. 10:1–10:18, Dagstuhl, Germany (2023). Schloss Dagstuhl – Leibniz-Zentrum für Informatik
4. Ani, H., et al.: PSPACE-completeness of pulling blocks to reach a goal. J. Inf. Process. 28, 929–941 (2020)
5. Ani, H., Chung, L., Demaine, E.D., Diomidova, J., Hendrickson, D., Lynch, J.: Pushing blocks via checkable gadgets: PSPACE-completeness of Push-1F and Block/Box Dude. In: Proceedings of the 11th International Conference on Fun with Algorithms (FUN 2022) (2022)