Akihiro Uejima

According to our database, Akihiro Uejima authored at least 6 papers between 2002 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

The Computational Complexity of Creek Puzzles on Several Grids.

Akihiro Uejima, Kentaro Oe

J. Inf. Process., 2020

2017

The Complexity of Generalized Pipe Link Puzzles.

Akihiro Uejima, Hiroaki Suzuki, Atsuki Okada

J. Inf. Process., 2017

2015

Fillmat is NP-Complete and ASP-Complete.

Akihiro Uejima, Hiroaki Suzuki

J. Inf. Process., 2015

2013

The Complexity of Tantrix Match Puzzles with Four Colors.

Akihiro Uejima, Fuhito Yanagitani, Shohei Tsukamoto

Inf. Media Technol., 2013

2004

Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant Graphs.

Akihiro Uejima, Hiro Ito

Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2002

On <i>H</i>-Coloring Problems with <i>H</i> Expressed by Complements of Cycles, Bipartite Graphs, and Chordal Graphs.

Akihiro Uejima, Hiro Ito

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002