Node-to-Set Disjoint Paths Problem in Rotator Graphs. - Keiichi Kaneko; Yasuto Suzuki (ASIAN, 2000)

Container Problem in Substring Reversal Graphs. - Yasuto Suzuki; Keiichi Kaneko; Mario Nakamori (ISPAN, 2004)

Container Problem in Bi-rotator Graphs. - Keiichi Kaneko; Yasuto Suzuki; Yukihiro Hasegawa (PDCAT, 2004)

Node-disjoint Paths in a Transposition Graph. - Yasuto Suzuki; Keiichi Kaneko; Mario Nakamori (PDPTA, 2004)

Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs. - Keiichi Kaneko; Yasuto Suzuki (PRDC, 2004)

Hamiltonian Cycles and Paths in Burnt Pancake Graphs. - Yasuto Suzuki; Naoki Sawada; Keiichi Kaneko (PDCS, 2005)

Container Problem in Burnt Pancake Graphs. - Naoki Sawada; Yasuto Suzuki; Keiichi Kaneko (ISPA, 2005)

Node-Disjoint Paths Algorithm in a Transposition Graph. - Yasuto Suzuki; Keiichi Kaneko; Mario Nakamori (IEICE Trans. Inf. Syst., 2006)

An algorithm for disjoint paths in bubble-sort graphs. - Yasuto Suzuki; Keiichi Kaneko (Syst. Comput. Jpn., 2006)

The Container Problem in Bubble-Sort Graphs. - Yasuto Suzuki; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2008)