| 2008 |
|---|
| 10 | EE | Yasuto Suzuki,
Keiichi Kaneko:
The Container Problem in Bubble-Sort Graphs.
IEICE Transactions 91-D(4): 1003-1009 (2008) |
| 2006 |
|---|
| 9 | EE | Yasuto Suzuki,
Keiichi Kaneko,
Mario Nakamori:
Node-Disjoint Paths Algorithm in a Transposition Graph.
IEICE Transactions 89-D(10): 2600-2605 (2006) |
| 8 | EE | Yasuto Suzuki,
Keiichi Kaneko:
An algorithm for disjoint paths in bubble-sort graphs.
Systems and Computers in Japan 37(12): 27-32 (2006) |
| 2005 |
|---|
| 7 | | Yasuto Suzuki,
Naoki Sawada,
Keiichi Kaneko:
Hamiltonian Cycles and Paths in Burnt Pancake Graphs.
ISCA PDCS 2005: 85-90 |
| 6 | EE | Naoki Sawada,
Yasuto Suzuki,
Keiichi Kaneko:
Container Problem in Burnt Pancake Graphs.
ISPA 2005: 479-490 |
| 2004 |
|---|
| 5 | EE | Yasuto Suzuki,
Keiichi Kaneko,
Mario Nakamori:
Container Problem in Substring Reversal Graphs.
ISPAN 2004: 563-568 |
| 4 | EE | Keiichi Kaneko,
Yasuto Suzuki,
Yukihiro Hasegawa:
Container Problem in Bi-rotator Graphs.
PDCAT 2004: 149-154 |
| 3 | | Yasuto Suzuki,
Keiichi Kaneko,
Mario Nakamori:
Node-disjoint Paths in a Transposition Graph.
PDPTA 2004: 298-304 |
| 2 | EE | Keiichi Kaneko,
Yasuto Suzuki:
Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs.
PRDC 2004: 173-182 |
| 2000 |
|---|
| 1 | EE | Keiichi Kaneko,
Yasuto Suzuki:
Node-to-Set Disjoint Paths Problem in Rotator Graphs.
ASIAN 2000: 119-132 |
