The following pages link to Tatsuaki Ibusuki (Q782173):
Displayed 4 items.
- Computational complexity of the chromatic art gallery problem for orthogonal polygons (Q782174) (← links)
- Vertex-to-point conflict-free chromatic guarding is NP-hard (Q2154089) (← links)
- Computational complexity of two pencil puzzles: Kurotto and Juosan (Q2695483) (← links)
- (Q3301014) (← links)