The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. - Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

Complexity of Reconfiguration Problems for Constraint Satisfaction. - Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (CoRR, 2018)

Parameterized complexity of the list coloring reconfiguration problem with graph parameters. - Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (Theor. Comput. Sci., 2018)

Reconfiguration of Minimum Steiner Trees via Vertex Exchanges. - Haruka Mizuta; Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (MFCS, 2019)

Shortest Reconfiguration of Matchings. - Nicolas Bousquet 001; Tatsuhiko Hatanaka; Takehiro Ito; Moritz Mühlenthaler (WG, 2019)

The Coloring Reconfiguration Problem on Specific Graph Classes. - Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Inf. Syst., 2019)

Fixed-parameter algorithms for graph constraint logic. - Tatsuhiko Hatanaka; Felix Hommelsheim; Takehiro Ito; Yusuke Kobayashi 001; Moritz Mühlenthaler; Akira Suzuki 001 (Theor. Comput. Sci., 2023)