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)

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

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)

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)

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