Chuzo Iwamoto

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 19

Top Topics

Conjunctive Queries

Computational Complexity

Top Venues

IEICE Trans. Inf. Syst.

IEICE Trans. Fundam. Electron. Commun. Comput. Sci.

J. Inf. Process.

Publications

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