Chuzo Iwamoto

Orcid: 0000-0003-0152-2233

According to our database1, Chuzo Iwamoto authored at least 65 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Chained Block is NP-Complete.
IEICE Trans. Inf. Syst., 2024

Choco Banana is NP-Complete.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

2023
Computational Complexity of the Vertex-to-Point Conflict-Free Chromatic Art Gallery Problem.
IEICE Trans. Inf. Syst., September, 2023

Calculation Solitaire is NP-Complete.
IEICE Trans. Inf. Syst., March, 2023

2022
Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2022

Five Cells and Tilepaint are NP-Complete.
IEICE Trans. Inf. Syst., 2022

Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard.
Proceedings of the WALCOM: Algorithms and Computation, 2022

2021
Chromatic Art Gallery Problem with <i>r</i>-Visibility is NP-Complete.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

2020
Computational Complexity of Nurimisaki and Sashigane.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles.
IEICE Trans. Inf. Syst., 2020

Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2019
Computational Complexity of Herugolf and Makaro.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Nurimisaki and Sashigane are NP-complete.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Dosun-Fuwari is NP-complete.
J. Inf. Process., 2018

Computational Complexity of Usowan Puzzles.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan.
Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Herugolf and Makaro are NP-complete.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

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

2016
Computational Complexity of Building Puzzles.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Visibility Problems for Manhattan Towers.
IEICE Trans. Inf. Syst., 2016

2015
Computational Complexity of Generalized Forty Thieves.
IEICE Trans. Inf. Syst., 2015

Computational Complexity of Generalized Golf Solitaire.
IEICE Trans. Inf. Syst., 2015

2014
Yosenabe is NP-complete.
J. Inf. Process., 2014

2013
Generalized Chat Noir is PSPACE-Complete.
IEICE Trans. Inf. Syst., 2013

Generalized Pyramid is NP-Complete.
IEICE Trans. Inf. Syst., 2013

Computational Complexity of the r -visibility Guard Set Problem for Polyominoes.
Proceedings of the Discrete and Computational Geometry and Graphs, 2013

Universal Von Neumann Neighborhood Cellular Automata on Penrose Tilings.
Proceedings of the First International Symposium on Computing and Networking, 2013

2012
Lower Bound of Face Guards of Polyhedral Terrains.
J. Inf. Process., 2012

Generalized Shisen-Sho is NP-Complete.
IEICE Trans. Inf. Syst., 2012

Finding the Minimum Number of Face Guards is NP-Hard.
IEICE Trans. Inf. Syst., 2012

A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem.
Algorithms, 2012

Computational Complexity of String Puzzles.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2010
NP-Hard and <i>k</i>-EXPSPACE-Hard Cast Puzzles.
IEICE Trans. Inf. Syst., 2010

2009
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., 2009

On Designing Gliders in Three-Dimensional Larger than Life Cellular Automata.
Proceedings of the Natural Computing - 4th International Workshop on Natural Computing, 2009

Computational Complexity of Cast Puzzles.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
A Recursive Padding Technique on Nondeterministic Cellular Automata.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Special Section on Foundations of Computer Science.
IEICE Trans. Inf. Syst., 2008

A Java based three-dimensional cellular automata simulator and its application to three-dimensional Larger than Life.
Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

2007
Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs.
Acta Informatica, 2007

A Time Hierarchy Theorem for Nondeterministic Cellular Automata.
Proceedings of the Theory and Applications of Models of Computation, 2007

2006
A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton.
J. Cell. Autom., 2006

2005
Translational Lemmas for Alternating TMs and PRAMs.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs.
J. Parallel Distributed Comput., 2004

Prefix Computations on Iterative Arrays with Sequential Input/Output Mode.
IEICE Trans. Inf. Syst., 2004

Time and Space Complexity Classes of Hyperbolic Cellular Automata.
IEICE Trans. Inf. Syst., 2004

A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function.
IEICE Trans. Inf. Syst., 2004

Hierarchies of DLOGTIME-Uniform Circuits.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

2003
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata.
Fundam. Informaticae, 2003

2002
Constructible functions in cellular automata and their applications to hierarchy results.
Theor. Comput. Sci., 2002

A quadratic speedup theorem for iterative arrays.
Acta Informatica, 2002

Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata.
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

Computational Complexity in the Hyperbolic Plane.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001
A three-dimensional uniquely parsable array grammar that generates and parses cubes.
Proceedings of the 8th International Workshop on Combinatorial Image Analysis, 2001

Speeding-Up Cellular Automata by Alternations.
Proceedings of the Machines, 2001

1999
On Time-Constructible Functions in One-Dimensional Cellular Automata.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
A Canonical Form of Vector Machines.
Inf. Comput., 1998

Improved Time and Space Hierarchies of One-Tape Off-Line TMs.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
A Faster Parallel Algorithm for k-Connectivity.
Inf. Process. Lett., 1997

1996
Time Lower Bounds do not Exist for CRCW PRAMs.
Theor. Comput. Sci., 1996

alpha-Connectivity: A Gradually Nonparallel Graph Problem.
J. Algorithms, 1996

Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1994
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete.
Inf. Process. Lett., 1994

Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
Rs-vector algorithms for combinational problems.
Syst. Comput. Jpn., 1993


  Loading...