Herugolf and Makaro are NP-complete. - Chuzo Iwamoto; Masato Haruishi; Tatsuaki Ibusuki (FUN, 2018)

Computational Complexity of Usowan Puzzles. - Chuzo Iwamoto; Masato Haruishi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Computational Complexity of Herugolf and Makaro. - Chuzo Iwamoto; Masato Haruishi; Tatsuaki Ibusuki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)