Efficient Folding Algorithms for Regular Polyhedra. - Tonan Kamata; Akira Kadoguchi; Takashi Horiyama; Ryuhei Uehara (CCCG, 2020)

Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. - Erik D. Demaine; Martin L. Demaine; Yevhenii Diomidov; Tonan Kamata; Ryuhei Uehara; Hanyu Alice Zhang (CCCG, 2021)

Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra. - Elena Arseneva; Erik D. Demaine; Tonan Kamata; Ryuhei Uehara (CCCG, 2022)

Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature. - Junnosuke Hoshido; Tonan Kamata; Tsutomu Ansai; Ryuhei Uehara (CCCG, 2022)

Any platonic solid can transform to another by O(1) refoldings. - Erik D. Demaine; Martin L. Demaine; Yevhenii Diomidov; Tonan Kamata; Ryuhei Uehara; Hanyu Alice Zhang (Comput. Geom., 2023)

Efficient Folding Algorithms for Convex Polyhedra. - Tonan Kamata; Akira Kadoguchi; Takashi Horiyama; Ryuhei Uehara (Discret. Comput. Geom., 2023)

All Polyhedral Manifolds are Connected by a 2-Step Refolding. - Lily Chung; Erik D. Demaine; Jenny Diomidova; Tonan Kamata; Jayson Lynch; Ryuhei Uehara; Hanyu Alice Zhang (CoRR, 2024)

Dudeney's Dissection is Optimal. - Erik D. Demaine; Tonan Kamata; Ryuhei Uehara (CoRR, 2024)

Overlapping of Lattice Unfolding for Cuboids. - Takumi Shiota; Tonan Kamata; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2025)