Optimal One-to-Many Disjoint Paths in Folded Hypercubes. - Cheng-Nan Lai; Gen-Huey Chen; Dyi-Rong Duh (ISPAN, 2000)

Constructing One-to-Many Disjoint Paths in Folded Hypercubes. - Cheng-Nan Lai; Gen-Huey Chen; Dyi-Rong Duh (IEEE Trans. Computers, 2002)

Strong Rabin numbers of folded hypercubes. - Cheng-Nan Lai; Gen-Huey Chen (Theor. Comput. Sci., 2005)

w-Rabin numbers and strong w-Rabin numbers of folded hypercubes. - Cheng-Nan Lai; Gen-Huey Chen (Networks, 2008)

Real-time reconfigurable cache for low-power embedded systems. - Geng-Cyuan Jheng; Dyi-Rong Duh; Cheng-Nan Lai (Int. J. Embed. Syst., 2010)

Two conditions for reducing the maximal length of node-disjoint paths in hypercubes. - Cheng-Nan Lai (Theor. Comput. Sci., 2012)

Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications. - Cheng-Nan Lai (IEEE Trans. Parallel Distributed Syst., 2012)

Two spanning disjoint paths with required length in generalized hypercubes. - Dyi-Rong Duh; Yao-Chung Lin; Cheng-Nan Lai; Yue-Li Wang (Theor. Comput. Sci., 2013)

On the Existence of All Shortest Vertex-Disjoint Paths in Cayley Graphs of Abelian Groups. - Cheng-Nan Lai (ICS, 2014)

An efficient construction of one-to-many node-disjoint paths in folded hypercubes. - Cheng-Nan Lai (J. Parallel Distributed Comput., 2014)

Constructing all shortest node-disjoint paths in torus networks. - Cheng-Nan Lai (J. Parallel Distributed Comput., 2015)

On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups. - Cheng-Nan Lai (Theor. Comput. Sci., 2015)

On the construction of all shortest node-disjoint paths in star networks. - Cheng-Nan Lai (Inf. Process. Lett., 2016)

Optimal construction of node-disjoint shortest paths in folded hypercubes. - Cheng-Nan Lai (J. Parallel Distributed Comput., 2017)

Optimal node-disjoint paths in folded hypercubes. - Cheng-Nan Lai (J. Parallel Distributed Comput., 2021)