The following publications are possibly variants of this publication:
- A Node-to-Set Disjoint-Path Routing Algorithm in MetacubeAntoine Bossard, Keiichi Kaneko, Shietung Peng. ispan 2009: 23-28 [doi]
- Node-to-Set Disjoint-path Routing in MetacubeAntoine Bossard, Keiichi Kaneko, Shietung Peng. pdcat 2009: 57-62 [doi]
- Node-to-set disjoint paths routing in a metacubeAntoine Bossard, Keiichi Kaneko, Shietung Peng. ijhpcn, 8(4):315-323, 2015. [doi]
- Set-to-Set Disjoint Paths Routing in Dual-CubesKeiichi Kaneko, Shietung Peng. pdcat 2008: 129-136 [doi]
- Node-to-Set Disjoint Paths Routing in Dual-CubeKeiichi Kaneko, Shietung Peng. ispan 2008: 77-82 [doi]
- Set-to-set disjoint-path routing in perfect hierarchical hypercubesAntoine Bossard, Keiichi Kaneko. c3s2e 2011: 51-57 [doi]
- Fault-Tolerant Node-to-Set Disjoint-Path Routing in HypercubesAntoine Bossard, Keiichi Kaneko, Shietung Peng. ica3pp 2010: 511-519 [doi]
- Node-to-set disjoint-path routing in perfect hierarchical hypercubesAntoine Bossard, Keiichi Kaneko, Shietung Peng. procedia, 4:442-451, 2011. [doi]
- A Set-to-Set Disjoint Paths Routing Algorithm in ToriKeiichi Kaneko, Antoine Bossard. ijnc, 7(2):173-186, 2017. [doi]