Chuzo Iwamoto

70 papers A 1B 8C 4Misc 1Journal 47Unranked 9
YearRankTypeTitle / Venue / Authors
2026 J jnl
Computational Complexity of the Chromatic Dispersive Art Gallery Problem.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Shun Takahashi
2025 J jnl
Card-Based Zero-Knowledge Proof for Dosun-Fuwari.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Chuzo Iwamoto, Kosuke Ohara
2025 J jnl
Computational Complexity of Yajisan-Kazusan and Stained Glass.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Ryo Takaishi
2024 J jnl
Chained Block is NP-Complete.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Tatsuya Ide
2024 J jnl
Choco Banana is NP-Complete.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Chuzo Iwamoto, Takeru Tokunaga
2023 J jnl
Calculation Solitaire is NP-Complete.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Tatsuya Ide
2023 J jnl
Computational Complexity of the Vertex-to-Point Conflict-Free Chromatic Art Gallery Problem.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Tatsuaki Ibusuki
2022 J jnl
Five Cells and Tilepaint are NP-Complete.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Tatsuya Ide
2022 J jnl
Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Chuzo Iwamoto, Tatsuya Ide
2022 B conf
Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard.
WALCOM
Chuzo Iwamoto, Tatsuaki Ibusuki
2021 J jnl
Chromatic Art Gallery Problem with
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Chuzo Iwamoto, Tatsuaki Ibusuki
2020 J jnl
Computational Complexity of Nurimisaki and Sashigane.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Chuzo Iwamoto, Tatsuya Ide
2020 B conf
Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons.
WALCOM
Chuzo Iwamoto, Tatsuaki Ibusuki
2020 J jnl
Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Tatsuaki Ibusuki
2019 J jnl
Computational Complexity of Herugolf and Makaro.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Chuzo Iwamoto, Masato Haruishi, Tatsuaki Ibusuki
2019 — conf
Nurimisaki and Sashigane are NP-complete.
CCCG
Chuzo Iwamoto, Tatsuya Ide
2018 — conf
Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan.
JCDCGGG
Chuzo Iwamoto, Tatsuaki Ibusuki
2018 J jnl
Computational Complexity of Usowan Puzzles.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Chuzo Iwamoto, Masato Haruishi
2018 J jnl
Dosun-Fuwari is NP-complete.
J. Inf. Process.
Chuzo Iwamoto, Tatsuaki Ibusuki
2018 Misc conf
Herugolf and Makaro are NP-complete.
FUN
Chuzo Iwamoto, Masato Haruishi, Tatsuaki Ibusuki
2017 J jnl
Finding the Minimum Number of Open-Edge Guards in an Orthogonal Polygon is NP-Hard.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto
2016 J jnl
Computational Complexity of Building Puzzles.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Chuzo Iwamoto, Yuta Matsui
2016 J jnl
Visibility Problems for Manhattan Towers.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Yusuke Kitagaki
2015 J jnl
Computational Complexity of Generalized Forty Thieves.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Yuta Matsui
2015 J jnl
Computational Complexity of Generalized Golf Solitaire.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto
2014 J jnl
Yosenabe is NP-complete.
J. Inf. Process.
Chuzo Iwamoto
2013 — conf
Computational Complexity of the r -visibility Guard Set Problem for Polyominoes.
JCDCGG
Chuzo Iwamoto, Toshihiko Kume
2013 J jnl
Generalized Chat Noir is PSPACE-Complete.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Yuta Mukai, Yuichi Sumida, Kenichi Morita
2013 J jnl
Generalized Pyramid is NP-Complete.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Yuta Matsui
2013 — conf
Universal Von Neumann Neighborhood Cellular Automata on Penrose Tilings.
CANDAR
Kota Sato, Katsunobu Imai, Chuzo Iwamoto
2012 J jnl
A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem.
Algorithms
Chuzo Iwamoto, Kento Sasaki, Kenichi Morita
2012 — conf
Computational Complexity of String Puzzles.
CATS
Chuzo Iwamoto, Kento Sasaki, Kenichi Morita
2012 J jnl
Finding the Minimum Number of Face Guards is NP-Hard.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Yusuke Kitagaki, Kenichi Morita
2012 J jnl
Generalized Shisen-Sho is NP-Complete.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Yoshihiro Wada, Kenichi Morita
2012 J jnl
Lower Bound of Face Guards of Polyhedral Terrains.
Inf. Media Technol.
Chuzo Iwamoto, Junichi Kishi, Kenichi Morita
2012 J jnl
Lower Bound of Face Guards of Polyhedral Terrains.
J. Inf. Process.
Chuzo Iwamoto, Junichi Kishi, Kenichi Morita
2010 J jnl
NP-Hard and
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita
2009 B conf
Computational Complexity of Cast Puzzles.
ISAAC
Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita
2009 — conf
On Designing Gliders in Three-Dimensional Larger than Life Cellular Automata.
IWNC
Katsunobu Imai, Yasuaki Masamori, Chuzo Iwamoto, Kenichi Morita
2009 J jnl
On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than Four.
IEICE Trans. Inf. Syst.
Naonori Tanimoto, Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita
2008 — conf
A Java based three-dimensional cellular automata simulator and its application to three-dimensional Larger than Life.
Automata
Mitsuru Matsushima, Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita
2008 J jnl
A Recursive Padding Technique on Nondeterministic Cellular Automata.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai
2008 J jnl
Special Section on Foundations of Computer Science.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto
2007 C conf
A Time Hierarchy Theorem for Nondeterministic Cellular Automata.
TAMC
Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai
2007 J jnl
Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs.
Acta Informatica
Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai
2006 J jnl
A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton.
J. Cell. Autom.
Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita
2005 B conf
Translational Lemmas for Alternating TMs and PRAMs.
FCT
Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai
2004 J jnl
A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function.
IEICE Trans. Inf. Syst.
Katsunobu Imai, Akihiko Ikazaki, Chuzo Iwamoto, Kenichi Morita
2004 C conf
Hierarchies of DLOGTIME-Uniform Circuits.
MCU
Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu
2004 J jnl
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs.
J. Parallel Distributed Comput.
Toshiyuki Fujiwara, Kazuo Iwama, Chuzo Iwamoto
2004 J jnl
Prefix Computations on Iterative Arrays with Sequential Input/Output Mode.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Tomoka Yokouchi, Kenichi Morita, Katsunobu Imai
2004 J jnl
Time and Space Complexity Classes of Hyperbolic Cellular Automata.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Maurice Margenstern
2003 J jnl
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata.
Fundam. Informaticae
Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
2002 J jnl
A quadratic speedup theorem for iterative arrays.
Acta Informatica
Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
2002 B conf
Computational Complexity in the Hyperbolic Plane.
MFCS
Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai
2002 J jnl
Constructible functions in cellular automata and their applications to hierarchy results.
Theor. Comput. Sci.
Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai
2002 — conf
Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata.
UMC
Katsunobu Imai, Kenji Fujita, Chuzo Iwamoto, Kenichi Morita
2001 C conf
A three-dimensional uniquely parsable array grammar that generates and parses cubes.
IWCIA
Katsunobu Imai, Yukio Matsuda, Chuzo Iwamoto, Kenichi Morita
2001 C conf
Speeding-Up Cellular Automata by Alternations.
MCU
Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
1999 B conf
On Time-Constructible Functions in One-Dimensional Cellular Automata.
FCT
Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai
1998 J jnl
A Canonical Form of Vector Machines.
Inf. Comput.
Kazuo Iwama, Chuzo Iwamoto
1998 B conf
Improved Time and Space Hierarchies of One-Tape Off-Line TMs.
MFCS
Kazuo Iwama, Chuzo Iwamoto
1997 J jnl
A Faster Parallel Algorithm for k-Connectivity.
Inf. Process. Lett.
Kazuo Iwama, Chuzo Iwamoto, T. Ohsawa
1996 A conf
Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits.
CCC
Kazuo Iwama, Chuzo Iwamoto
1996 J jnl
Time Lower Bounds do not Exist for CRCW PRAMs.
Theor. Comput. Sci.
Kazuo Iwama, Chuzo Iwamoto, Manzur Morshed
1996 J jnl
alpha-Connectivity: A Gradually Nonparallel Graph Problem.
J. Algorithms
Kazuo Iwama, Chuzo Iwamoto
1994 B conf
Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity.
ISAAC
Chuzo Iwamoto, Kazuo Iwama
1994 J jnl
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete.
Inf. Process. Lett.
Chuzo Iwamoto, Godfried T. Toussaint
1994 — conf
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete.
CCCG
Chuzo Iwamoto, Godfried T. Toussaint
1993 J jnl
Rs-vector algorithms for combinational problems.
Syst. Comput. Jpn.
Chuzo Iwamoto, Kazuo Iwama