Rs-vector algorithms for combinational problems. - Chuzo Iwamoto; Kazuo Iwama (Syst. Comput. Jpn., 1993)

Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity. - Chuzo Iwamoto; Kazuo Iwama (ISAAC, 1994)

Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete. - Chuzo Iwamoto; Godfried T. Toussaint (Inf. Process. Lett., 1994)

Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits. - Kazuo Iwama; Chuzo Iwamoto (CCC, 1996)

alpha-Connectivity: A Gradually Nonparallel Graph Problem. - Kazuo Iwama; Chuzo Iwamoto (J. Algorithms, 1996)

Time Lower Bounds do not Exist for CRCW PRAMs. - Kazuo Iwama; Chuzo Iwamoto; Manzur Morshed (Theor. Comput. Sci., 1996)

A Faster Parallel Algorithm for k-Connectivity. - Kazuo Iwama; Chuzo Iwamoto; T. Ohsawa (Inf. Process. Lett., 1997)

Improved Time and Space Hierarchies of One-Tape Off-Line TMs. - Kazuo Iwama; Chuzo Iwamoto (MFCS, 1998)

A Canonical Form of Vector Machines. - Kazuo Iwama; Chuzo Iwamoto (Inf. Comput., 1998)

On Time-Constructible Functions in One-Dimensional Cellular Automata. - Chuzo Iwamoto; Tomonobu Hatsuyama; Kenichi Morita; Katsunobu Imai (FCT, 1999)

Speeding-Up Cellular Automata by Alternations. - Chuzo Iwamoto; Katsuyuki Tateishi; Kenichi Morita; Katsunobu Imai (MCU, 2001)

A three-dimensional uniquely parsable array grammar that generates and parses cubes. - Katsunobu Imai; Yukio Matsuda; Chuzo Iwamoto; Kenichi Morita (IWCIA, 2001)

Computational Complexity in the Hyperbolic Plane. - Chuzo Iwamoto; Takeshi Andou; Kenichi Morita; Katsunobu Imai (MFCS, 2002)

Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata. - Katsunobu Imai; Kenji Fujita; Chuzo Iwamoto; Kenichi Morita (UMC, 2002)

A quadratic speedup theorem for iterative arrays. - Chuzo Iwamoto; Katsuyuki Tateishi; Kenichi Morita; Katsunobu Imai (Acta Informatica, 2002)

Constructible functions in cellular automata and their applications to hierarchy results. - Chuzo Iwamoto; Tomonobu Hatsuyama; Kenichi Morita; Katsunobu Imai (Theor. Comput. Sci., 2002)

Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata. - Chuzo Iwamoto; Katsuyuki Tateishi; Kenichi Morita; Katsunobu Imai (Fundam. Informaticae, 2003)

Hierarchies of DLOGTIME-Uniform Circuits. - Chuzo Iwamoto; Naoki Hatayama; Kenichi Morita; Katsunobu Imai; Daisuke Wakamatsu (MCU, 2004)

A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function. - Katsunobu Imai; Akihiko Ikazaki; Chuzo Iwamoto; Kenichi Morita (IEICE Trans. Inf. Syst., 2004)

Time and Space Complexity Classes of Hyperbolic Cellular Automata. - Chuzo Iwamoto; Maurice Margenstern (IEICE Trans. Inf. Syst., 2004)

Prefix Computations on Iterative Arrays with Sequential Input/Output Mode. - Chuzo Iwamoto; Tomoka Yokouchi; Kenichi Morita; Katsunobu Imai (IEICE Trans. Inf. Syst., 2004)

Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs. - Toshiyuki Fujiwara; Kazuo Iwama; Chuzo Iwamoto (J. Parallel Distributed Comput., 2004)

Translational Lemmas for Alternating TMs and PRAMs. - Chuzo Iwamoto; Yoshiaki Nakashiba; Kenichi Morita; Katsunobu Imai (FCT, 2005)

A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton. - Katsunobu Imai; Chuzo Iwamoto; Kenichi Morita (J. Cell. Autom., 2006)

A Time Hierarchy Theorem for Nondeterministic Cellular Automata. - Chuzo Iwamoto; Harumasa Yoneda; Kenichi Morita; Katsunobu Imai (TAMC, 2007)

Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs. - Chuzo Iwamoto; Naoki Hatayama; Yoshiaki Nakashiba; Kenichi Morita; Katsunobu Imai (Acta Informatica, 2007)

A Java based three-dimensional cellular automata simulator and its application to three-dimensional Larger than Life. - Mitsuru Matsushima; Katsunobu Imai; Chuzo Iwamoto; Kenichi Morita (Automata, 2008)

Special Section on Foundations of Computer Science. - Chuzo Iwamoto (IEICE Trans. Inf. Syst., 2008)

A Recursive Padding Technique on Nondeterministic Cellular Automata. - Chuzo Iwamoto; Harumasa Yoneda; Kenichi Morita; Katsunobu Imai (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Computational Complexity of Cast Puzzles. - Chuzo Iwamoto; Kento Sasaki; Kenji Nishio; Kenichi Morita (ISAAC, 2009)

On Designing Gliders in Three-Dimensional Larger than Life Cellular Automata. - Katsunobu Imai; Yasuaki Masamori; Chuzo Iwamoto; Kenichi Morita (IWNC, 2009)

On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than Four. - Naonori Tanimoto; Katsunobu Imai; Chuzo Iwamoto; Kenichi Morita (IEICE Trans. Inf. Syst., 2009)

NP-Hard and k-EXPSPACE-Hard Cast Puzzles. - Chuzo Iwamoto; Kento Sasaki; Kenji Nishio; Kenichi Morita (IEICE Trans. Inf. Syst., 2010)

Computational Complexity of String Puzzles. - Chuzo Iwamoto; Kento Sasaki; Kenichi Morita (CATS, 2012)

A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem. - Chuzo Iwamoto; Kento Sasaki; Kenichi Morita (Algorithms, 2012)

Finding the Minimum Number of Face Guards is NP-Hard. - Chuzo Iwamoto; Yusuke Kitagaki; Kenichi Morita (IEICE Trans. Inf. Syst., 2012)

Generalized Shisen-Sho is NP-Complete. - Chuzo Iwamoto; Yoshihiro Wada; Kenichi Morita (IEICE Trans. Inf. Syst., 2012)

Lower Bound of Face Guards of Polyhedral Terrains. - Chuzo Iwamoto; Junichi Kishi; Kenichi Morita (J. Inf. Process., 2012)

Universal Von Neumann Neighborhood Cellular Automata on Penrose Tilings. - Kota Sato; Katsunobu Imai; Chuzo Iwamoto (CANDAR, 2013)

Computational Complexity of the r -visibility Guard Set Problem for Polyominoes. - Chuzo Iwamoto; Toshihiko Kume (JCDCGG, 2013)

Generalized Pyramid is NP-Complete. - Chuzo Iwamoto; Yuta Matsui (IEICE Trans. Inf. Syst., 2013)

Generalized Chat Noir is PSPACE-Complete. - Chuzo Iwamoto; Yuta Mukai; Yuichi Sumida; Kenichi Morita (IEICE Trans. Inf. Syst., 2013)

Yosenabe is NP-complete. - Chuzo Iwamoto (J. Inf. Process., 2014)

Computational Complexity of Generalized Golf Solitaire. - Chuzo Iwamoto (IEICE Trans. Inf. Syst., 2015)

Computational Complexity of Generalized Forty Thieves. - Chuzo Iwamoto; Yuta Matsui (IEICE Trans. Inf. Syst., 2015)

Visibility Problems for Manhattan Towers. - Chuzo Iwamoto; Yusuke Kitagaki (IEICE Trans. Inf. Syst., 2016)

Computational Complexity of Building Puzzles. - Chuzo Iwamoto; Yuta Matsui (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Finding the Minimum Number of Open-Edge Guards in an Orthogonal Polygon is NP-Hard. - Chuzo Iwamoto (IEICE Trans. Inf. Syst., 2017)

Herugolf and Makaro are NP-complete. - Chuzo Iwamoto; Masato Haruishi; Tatsuaki Ibusuki (FUN, 2018)

Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan. - Chuzo Iwamoto; Tatsuaki Ibusuki (JCDCGGG, 2018)

Computational Complexity of Usowan Puzzles. - Chuzo Iwamoto; Masato Haruishi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Dosun-Fuwari is NP-complete. - Chuzo Iwamoto; Tatsuaki Ibusuki (J. Inf. Process., 2018)

Nurimisaki and Sashigane are NP-complete. - Chuzo Iwamoto; Tatsuya Ide (CCCG, 2019)

Computational Complexity of Herugolf and Makaro. - Chuzo Iwamoto; Masato Haruishi; Tatsuaki Ibusuki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons. - Chuzo Iwamoto; Tatsuaki Ibusuki (WALCOM, 2020)

Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles. - Chuzo Iwamoto; Tatsuaki Ibusuki (IEICE Trans. Inf. Syst., 2020)

Computational Complexity of Nurimisaki and Sashigane. - Chuzo Iwamoto; Tatsuya Ide (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020)

Chromatic Art Gallery Problem with r-Visibility is NP-Complete. - Chuzo Iwamoto; Tatsuaki Ibusuki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021)

Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard. - Chuzo Iwamoto; Tatsuaki Ibusuki (WALCOM, 2022)

Five Cells and Tilepaint are NP-Complete. - Chuzo Iwamoto; Tatsuya Ide (IEICE Trans. Inf. Syst., 2022)

Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete. - Chuzo Iwamoto; Tatsuya Ide (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

Calculation Solitaire is NP-Complete. - Chuzo Iwamoto; Tatsuya Ide (IEICE Trans. Inf. Syst., 2023)

Computational Complexity of the Vertex-to-Point Conflict-Free Chromatic Art Gallery Problem. - Chuzo Iwamoto; Tatsuaki Ibusuki (IEICE Trans. Inf. Syst., 2023)

Choco Banana is NP-Complete. - Chuzo Iwamoto; Takeru Tokunaga (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024)

Chained Block is NP-Complete. - Chuzo Iwamoto; Tatsuya Ide (IEICE Trans. Inf. Syst., 2024)

Computational Complexity of Yajisan-Kazusan and Stained Glass. - Chuzo Iwamoto; Ryo Takaishi (IEICE Trans. Inf. Syst., 2025)