Tatsuaki Ibusuki

According to our database, Tatsuaki Ibusuki authored at least 9 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Computational Complexity of the Vertex-to-Point Conflict-Free Chromatic Art Gallery Problem.

Chuzo Iwamoto, Tatsuaki Ibusuki

IEICE Trans. Inf. Syst., September, 2023

2022

Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard.

Chuzo Iwamoto, Tatsuaki Ibusuki

Proceedings of the WALCOM: Algorithms and Computation, 2022

2021

Chromatic Art Gallery Problem with <i>r</i>-Visibility is NP-Complete.

Chuzo Iwamoto, Tatsuaki Ibusuki

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

2020

Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles.

Chuzo Iwamoto, Tatsuaki Ibusuki

IEICE Trans. Inf. Syst., 2020

Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons.

Chuzo Iwamoto, Tatsuaki Ibusuki

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2019

Computational Complexity of Herugolf and Makaro.

Chuzo Iwamoto, Masato Haruishi, Tatsuaki Ibusuki

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

2018

Dosun-Fuwari is NP-complete.

Chuzo Iwamoto, Tatsuaki Ibusuki

J. Inf. Process., 2018

Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan.

Chuzo Iwamoto, Tatsuaki Ibusuki

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Herugolf and Makaro are NP-complete.

Chuzo Iwamoto, Masato Haruishi, Tatsuaki Ibusuki

Proceedings of the 9th International Conference on Fun with Algorithms, 2018