On H-Coloring Problems with H Expressed by Complements of Cycles, Bipartite Graphs, and Chordal Graphs. - Akihiro Uejima; Hiro Ito (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

Subdivision of the hierarchy of H-colorable graph classes by circulant graphs. - Akihiro Uejima; Hiro Ito (Electron. Notes Discret. Math., 2004)

The Complexity of Tantrix Match Puzzles with Four Colors. - Akihiro Uejima; Fuhito Yanagitani; Shohei Tsukamoto (J. Inf. Process., 2013)

Fillmat is NP-Complete and ASP-Complete. - Akihiro Uejima; Hiroaki Suzuki (J. Inf. Process., 2015)

The Complexity of Generalized Pipe Link Puzzles. - Akihiro Uejima; Hiroaki Suzuki; Atsuki Okada (J. Inf. Process., 2017)

The Computational Complexity of Creek Puzzles on Several Grids. - Akihiro Uejima; Kentaro Oe (J. Inf. Process., 2020)