List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Computational complexity of two pencil puzzles: Kurotto and Juosan | 2023-03-31 | Paper |
| Vertex-to-point conflict-free chromatic guarding is NP-hard | 2022-07-13 | Paper |
| Herugolf and Makaro are NP-complete | 2020-08-11 | Paper |
| Computational complexity of the chromatic art gallery problem for orthogonal polygons | 2020-07-22 | Paper |
Research outcomes over time
This page was built for person: Tatsuaki Ibusuki
