Chuzo Iwamoto
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Chuzo Iwamoto has a total of 88 co-authors. Here are the top co-authors by number of shared publications:
- Kenichi Morita
Hiroshima University
15 shared publications Katsunobu Imai
Graduate School of Engineering, Hiroshima University
9 shared publicationsTatsuaki Ibusuki
Graduate School of Engineering, Hiroshima University
7 shared publicationsTatsuya Ide
Graduate School of Advanced Science and Engineering, Hiroshima University
5 shared publicationsKazuo Iwama
Kyoto University, Kyoto 606-8501, Japan
3 shared publicationsYuta Matsui
Graduate School of Engineering, Hiroshima University
3 shared publications
Latest Publications
- 18 October 2026
- Published by Springer Nature
- p. 286-298
Card-Based Zero-Knowledge Proof for Yajisan-Kazusan and Yajilin
- 18 October 2026
- Published by Springer Nature
- p. 286-298
Card-Based Zero-Knowledge Proof for Yajisan-Kazusan and Yajilin
- Open Access
- 1 March 2024
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E107.D (3) , 320-324
Chained Block is NP-Complete
Chained Block is one of Nikoli's pencil puzzles. We study the computational complexity of Chained Block puzzles. It is shown that deciding whether a given instance of the Chained Block puzzle has a solution is NP-complete.
- 1 March 2024
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E107.D (3) , 320-324
Open AccessChained Block is NP-Complete
Chained Block is one of Nikoli's pencil puzzles. We study the computational complexity of Chained Block puzzles. It is shown that deciding whether a given instance of the Chained Block puzzle has a solution is NP-complete.
- Open Access
- 1 September 2023
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E106.D (9) , 1499-1506
Computational Complexity of the Vertex-to-Point Conflict-Free Chromatic Art Gallery Problem
The art gallery problem is to find a set of guards who together can observe every point of the interior of a polygon P. We study a chromatic variant of the problem, where each guard is assigned one of k distinct colors. A chromatic guarding is said to be conflict-free if at least one of the colors seen by every point in P is unique (i.e., each point in P is seen by some guard whose color appears exactly once among the guards visible to that point). In this paper, we consider vertex-to-point guarding, where the guards are placed on vertices of P, and they observe every point of the interior of P. The vertex-to-point conflict-free chromatic art gallery problem is to find a colored-guard set such that (i) guards are placed on P's vertices, and (ii) any point in P can see a guard of a unique color among all the visible guards. In this paper, it is shown that determining whether there exists a conflict-free chromatic vertex-guard set for a polygon with holes is NP-hard when the number of colors is k=2.
- 1 September 2023
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E106.D (9) , 1499-1506
Open AccessComputational Complexity of the Vertex-to-Point Conflict-Free Chromatic Art Gallery Problem
The art gallery problem is to find a set of guards who together can observe every point of the interior of a polygon P. We study a chromatic variant of the problem, where each guard is assigned one of k distinct colors. A chromatic guarding is said to be conflict-free if at least one of the colors seen by every point in P is unique (i.e., each point in P is seen by some guard whose color appears exactly once among the guards visible to that point). In this paper, we consider vertex-to-point guarding, where the guards are placed on vertices of P, and they observe every point of the interior of P. The vertex-to-point conflict-free chromatic art gallery problem is to find a colored-guard set such that (i) guards are placed on P's vertices, and (ii) any point in P can see a guard of a unique color among all the visible guards. In this paper, it is shown that determining whether there exists a conflict-free chromatic vertex-guard set for a polygon with holes is NP-hard when the number of colors is k=2.
- Open Access
- 1 March 2023
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E106.D (3) , 328-332
Calculation Solitaire is NP-Complete
Calculation is a solitaire card game with a standard 52-card deck. Initially, cards A, 2, 3, and 4 of any suit are laid out as four foundations. The remaining 48 cards are piled up as the stock, and there are four empty tableau piles. The purpose of the game is to move all cards of the stock to foundations. The foundation starting with A is to be built up in sequence from an ace to a king. The other foundations are similarly built up, but by twos, threes, and fours from 2, 3, and 4 until a king is reached. Here, a card of rank i may be used as a card of rank i + 13j for j ∈ {0, 1, 2, 3}. During the game, the player moves (i) the top card of the stock either onto a foundation or to the top of a tableau pile, or (ii) the top card of a tableau pile onto a foundation. We prove that the generalized version of Calculation Solitaire is NP-complete.
- 1 March 2023
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E106.D (3) , 328-332
Open AccessCalculation Solitaire is NP-Complete
Calculation is a solitaire card game with a standard 52-card deck. Initially, cards A, 2, 3, and 4 of any suit are laid out as four foundations. The remaining 48 cards are piled up as the stock, and there are four empty tableau piles. The purpose of the game is to move all cards of the stock to foundations. The foundation starting with A is to be built up in sequence from an ace to a king. The other foundations are similarly built up, but by twos, threes, and fours from 2, 3, and 4 until a king is reached. Here, a card of rank i may be used as a card of rank i + 13j for j ∈ {0, 1, 2, 3}. During the game, the player moves (i) the top card of the stock either onto a foundation or to the top of a tableau pile, or (ii) the top card of a tableau pile onto a foundation. We prove that the generalized version of Calculation Solitaire is NP-complete.
- 16 March 2022
- Published by Springer Nature
- p. 111-122
Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard
- 16 March 2022
- Published by Springer Nature
- p. 111-122
Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard
- 1 March 2022
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E105.D (3) , 508-516
Five Cells and Tilepaint are NP-Complete
Five Cells and Tilepaint are Nikoli's pencil puzzles. We study the computational complexity of Five Cells and Tilepaint puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.
- 1 March 2022
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E105.D (3) , 508-516
Five Cells and Tilepaint are NP-Complete
Five Cells and Tilepaint are Nikoli's pencil puzzles. We study the computational complexity of Five Cells and Tilepaint puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.
- 1 January 2022
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E105A (9) , 1187-1194
Moon-or-Sun, Nagareru, and Nurimeizu are NP-complete
Moon-or-Sun, Nagareru, and Nurimeizu are Nikoli's pencil puzzles. We study the computational complexity of Moon-or-Sun, Nagareru, and Nurimeizu puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.
- 1 January 2022
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E105A (9) , 1187-1194
Moon-or-Sun, Nagareru, and Nurimeizu are NP-complete
Moon-or-Sun, Nagareru, and Nurimeizu are Nikoli's pencil puzzles. We study the computational complexity of Moon-or-Sun, Nagareru, and Nurimeizu puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.
- Open Access
- 30 November 2021
- Published by American Physical Society (APS) in Physical Review C
- Vol. 104 (5) , 054323
Search for in-band transitions in the candidate superdeformed band inBackground: Superdeformed (SD) bands are suggested by theory around and in lighter alpha-conjugate nuclei such as , , and . Such predictions originate from a number of theoretical models including mean-field models and antisymmetrized molecular dynamics (AMD) calculations. While SD bands have been identified in and its near neighbors, evidence of their existence in the lighter, midshell nuclei is circumstantial at best. The key evidence of superdeformation would be the observation of transitions with high ( transition strengths connecting states in a rotational sequence. This is challenging information to obtain since the bands lie at a high excitation energy and competition from out-of-band decay is dominant.- 30 November 2021
- Published by American Physical Society (APS) in Physical Review C
- Vol. 104 (5) , 054323
Open AccessSearch for in-band transitions in the candidate superdeformed band inBackground: Superdeformed (SD) bands are suggested by theory around and in lighter alpha-conjugate nuclei such as , , and . Such predictions originate from a number of theoretical models including mean-field models and antisymmetrized molecular dynamics (AMD) calculations. While SD bands have been identified in and its near neighbors, evidence of their existence in the lighter, midshell nuclei is circumstantial at best. The key evidence of superdeformation would be the observation of transitions with high ( transition strengths connecting states in a rotational sequence. This is challenging information to obtain since the bands lie at a high excitation energy and competition from out-of-band decay is dominant. - 29 October 2021
- Published by Springer Nature
- p. 175-185
Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan
- 29 October 2021
- Published by Springer Nature
- p. 175-185
Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan
- 1 September 2021
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E104.A (9) , 1108-1115
Chromatic Art Gallery Problem with r-Visibility is NP-Complete
The art gallery problem is to find a set of guards who together can observe every point of the interior of a polygon P. We study a chromatic variant of the problem, where each guard is assigned one of k distinct colors. The chromatic art gallery problem is to find a guard set for P such that no two guards with the same color have overlapping visibility regions. We study the decision version of this problem for orthogonal polygons with r-visibility when the number of colors is k = 2. Here, two points are r-visible if the smallest axis-aligned rectangle containing them lies entirely within the polygon. In this paper, it is shown that determining whether there is an r-visibility guard set for an orthogonal polygon with holes such that no two guards with the same color have overlapping visibility regions is NP-hard when the number of colors is k = 2.
- 1 September 2021
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E104.A (9) , 1108-1115
Chromatic Art Gallery Problem with r-Visibility is NP-Complete
The art gallery problem is to find a set of guards who together can observe every point of the interior of a polygon P. We study a chromatic variant of the problem, where each guard is assigned one of k distinct colors. The chromatic art gallery problem is to find a guard set for P such that no two guards with the same color have overlapping visibility regions. We study the decision version of this problem for orthogonal polygons with r-visibility when the number of colors is k = 2. Here, two points are r-visible if the smallest axis-aligned rectangle containing them lies entirely within the polygon. In this paper, it is shown that determining whether there is an r-visibility guard set for an orthogonal polygon with holes such that no two guards with the same color have overlapping visibility regions is NP-hard when the number of colors is k = 2.