Computational Complexity of Jumping Block Puzzles. - Masaaki Kanzaki; Yota Otachi; Ryuhei Uehara (COCOON, 2021)

Parameterized Complexity of (A, ℓ )-Path Packing. - Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2022)

Computational complexity of jumping block puzzles. - Masaaki Kanzaki; Yota Otachi; Giovanni Viglietta; Ryuhei Uehara (Theor. Comput. Sci., 2024)