Tonan Kamata - RankMe

16 papers A 1Journal 9Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Dudeney's Dissection Is Optimal. ITCS Erik D. Demaine, Tonan Kamata, Ryuhei Uehara
2025	J	`jnl`	All Polyhedral Manifolds are Connected by a 2-Step Refolding. J. Inf. Process. Lily Chung, Erik D. Demaine, Jenny Diomidova, Tonan Kamata, Jayson Lynch, Ryuhei Uehara, Hanyu Alice Zhang
2025	J	`jnl`	Computational Complexity of One-Dimensional Origami with Constraints on Thickness at Creases. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara
2025	J	`jnl`	Overlapping of Lattice Unfolding for Cuboids. IEICE Trans. Inf. Syst. Takumi Shiota, Tonan Kamata, Ryuhei Uehara
2025	—	`conf`	The Number of Non-overlapping Unfoldings in Convex Polyhedra. CCCG Takumi Shiota, Yudai Enomoto, Masashi Gorobe, Takashi Horiyama, Tonan Kamata, Toshiki Saitoh, Ryuhei Uehara
2024	J	`jnl`	All Polyhedral Manifolds are Connected by a 2-Step Refolding. CoRR Lily Chung, Erik D. Demaine, Jenny Diomidova, Tonan Kamata, Jayson Lynch, Ryuhei Uehara, Hanyu Alice Zhang
2024	J	`jnl`	Dudeney's Dissection is Optimal. CoRR Erik D. Demaine, Tonan Kamata, Ryuhei Uehara
2023	J	`jnl`	Any platonic solid can transform to another by Comput. Geom. Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
2023	J	`jnl`	Efficient Folding Algorithms for Convex Polyhedra. Discret. Comput. Geom. Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
2023	—	`conf`	Overlapping of Lattice Unfolding for Cuboids. CCCG Takumi Shiota, Tonan Kamata, Ryuhei Uehara
2022	—	`conf`	Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature. CCCG Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara
2022	—	`conf`	Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra. CCCG Elena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara
2021	—	`conf`	Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. CCCG Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
2021	J	`jnl`	Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. CoRR Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
2021	J	`jnl`	Efficient Folding Algorithms for Regular Polyhedra. CoRR Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
2020	—	`conf`	Efficient Folding Algorithms for Regular Polyhedra. CCCG Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara