The following publications are possibly variants of this publication:
- Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake GraphsNagateru Iwasawa, Antoine Bossard, Keiichi Kaneko. cata 2011: 21-26
- An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake GraphsKeiichi Kaneko, Naoki Sawada. ieicet, 90-D(1):306-313, 2007. [doi]
- Disjoint Paths Routing in Pancake GraphsKeiichi Kaneko, Shietung Peng. pdcat 2006: 254-259 [doi]
- A Fault-tolerant Routing Algorithm of Burnt Pancake GraphsTatsuya Iwasaki, Keiichi Kaneko. pdpta 2009: 307-313
- Pairwise Disjoint Paths in Pancake GraphsNaoki Sawada, Keiichi Kaneko, Shietung Peng. pdcat 2007: 376-382 [doi]
- Node-to-Set Disjoint Paths Problem in Burnt Pancake GraphsKeiichi Kaneko. snpd 2003: 285-292
- Fault-tolerant routing in burnt pancake graphsTatsuya Iwasaki, Keiichi Kaneko. ipl, 110(14-15):535-538, 2010. [doi]
- Cluster-Fault-Tolerant Routing in Burnt Pancake GraphsNagateru Iwasawa, Tatsuro Watanabe, Tatsuya Iwasaki, Keiichi Kaneko. ica3pp 2010: 264-274 [doi]
- A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphsTatsuro Watanabe, Keiichi Kaneko, Shietung Peng. ISCApdcs 2007: 200-205
- Hamiltonian Paths and Cycles in Faulty Burnt Pancake GraphsKeiichi Kaneko. pdpta 2006: 253-259
- Hamiltonian Cycles and Paths in Burnt Pancake GraphsYasuto Suzuki, Naoki Sawada, Keiichi Kaneko. ISCApdcs 2005: 85-90