A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations. - Ro-Yu Wu; Jou-Ming Chang; Yue-Li Wang (Theor. Comput. Sci., 2006)

A Developed Restricted Rotation for Binary Trees Transformation. - Ro-Yu Wu; Jou-Ming Chang; Chir-Ho Chang (HIS (1), 2009)

On the diameter of geometric path graphs of points in convex position. - Jou-Ming Chang; Ro-Yu Wu (Inf. Process. Lett., 2009)

Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence. - Ro-Yu Wu; Jou-Ming Chang; Yue-Li Wang (Comput. J., 2010)

Ranking and Unranking of t-Ary Trees Using RD-Sequences. - Ro-Yu Wu; Jou-Ming Chang; Yue-Li Wang (IEICE Trans. Inf. Syst., 2011)

Ranking and unranking of non-regular trees with a prescribed branching sequence. - Ro-Yu Wu; Jou-Ming Chang; Chir-Ho Chang (Math. Comput. Model., 2011)

Amortized efficiency of generating planar paths in convex position. - Ro-Yu Wu; Jou-Ming Chang; Kung-Jui Pai; Yue-Li Wang (Theor. Comput. Sci., 2011)

Ranking and Unranking t-ary Trees in a Gray-Code Order. - Ro-Yu Wu; Jou-Ming Chang; An-Hang Chen; Chun-Liang Liu (Comput. J., 2013)

Ranking and Unranking of Non-regular Trees in Gray-Code Order. - Ro-Yu Wu; Jou-Ming Chang; An-Hang Chen; Ming-Tat Ko (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

Longest Fault-Free Cycles in Folded Hypercubes with Conditional Faulty Elements. - Wen-Yin Huang; Jia Jie Liu; Jou-Ming Chang; Ro-Yu Wu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Queue Layouts of Toroidal Grids. - Kung-Jui Pai; Jou-Ming Chang; Yue-Li Wang; Ro-Yu Wu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Incidence coloring on hypercubes. - Kung-Jui Pai; Jou-Ming Chang; Jinn-Shyong Yang; Ro-Yu Wu (Theor. Comput. Sci., 2014)

A loopless algorithm for generating multiple binary tree sequences simultaneously. - Ro-Yu Wu; Jou-Ming Chang; Hung-Chang Chan; Kung-Jui Pai (Theor. Comput. Sci., 2014)

Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order. - Kung-Jui Pai; Ro-Yu Wu; Jou-Ming Chang; Shun-Chieh Chang (COCOA, 2016)

Gray-Code Ranking and Unranking on Left-Weight Sequences of Binary Trees. - Ro-Yu Wu; Jou-Ming Chang; Sheng-Lung Peng; Chun-Liang Liu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Locally exchanged twisted cubes: Connectivity and super connectivity. - Jou-Ming Chang; Xiang-Rui Chen; Jinn-Shyong Yang; Ro-Yu Wu (Inf. Process. Lett., 2016)

An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs. - Yu-Sheng Huang; Sheng-Lung Peng; Ro-Yu Wu (J. Interconnect. Networks, 2016)

Corrigendum to "Incidence coloring on hypercubes" [Theoret. Comput. Sci. 557 (2014) 59-65]. - Kung-Jui Pai; Jou-Ming Chang; Jinn-Shyong Yang; Ro-Yu Wu (Theor. Comput. Sci., 2016)

A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks. - Shih-Shun Kao; Jou-Ming Chang; Kung-Jui Pai; Jinn-Shyong Yang; Shyue-Ming Tang; Ro-Yu Wu (COCOA (1), 2017)

A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order. - Kung-Jui Pai; Jou-Ming Chang; Ro-Yu Wu (FAW, 2017)

Constructing Independent Spanning Trees on Bubble-Sort Networks. - Shih-Shun Kao; Jou-Ming Chang; Kung-Jui Pai; Ro-Yu Wu (COCOON, 2018)

Two Kinds of Generalized 3-Connectivities of Alternating Group Networks. - Jou-Ming Chang; Kung-Jui Pai; Jinn-Shyong Yang; Ro-Yu Wu (FAW, 2018)

Improved Algorithms for Ranking and Unranking (k, m)-Ary Trees. - Yu-Hsuan Chang; Ro-Yu Wu; Ruay-Shiung Chang; Jou-Ming Chang (AAIM, 2019)

Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes. - Kung-Jui Pai; Ruay-Shiung Chang; Jou-Ming Chang; Ro-Yu Wu (FAW, 2019)

Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order. - Kung-Jui Pai; Jou-Ming Chang; Ro-Yu Wu; Shun-Chieh Chang (Discret. Appl. Math., 2019)

Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. - Shih-Shun Kao; Kung-Jui Pai; Sun-Yuan Hsieh; Ro-Yu Wu; Jou-Ming Chang (J. Comb. Optim., 2019)

The 4-component connectivity of alternating group networks. - Jou-Ming Chang; Kung-Jui Pai; Ro-Yu Wu; Jinn-Shyong Yang (Theor. Comput. Sci., 2019)

A two-stages tree-searching algorithm for finding three completely independent spanning trees. - Kung-Jui Pai; Ruay-Shiung Chang; Ro-Yu Wu; Jou-Ming Chang (Theor. Comput. Sci., 2019)

Three completely independent spanning trees of crossed cubes with application to secure-protection routing. - Kung-Jui Pai; Ruay-Shiung Chang; Ro-Yu Wu; Jou-Ming Chang (Inf. Sci., 2020)

A loopless algorithm for generating (k, m)-ary trees in Gray code order. - Yu-Hsuan Chang; Ro-Yu Wu; Cheng-Kuan Lin; Jou-Ming Chang (Optim. Lett., 2021)

Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms. - Ro-Yu Wu; Cheng-Chia Tseng; Ling-Ju Hung; Jou-Ming Chang (ISCO, 2022)

Improved algorithms for ranking and unranking (k, m)-ary trees in B-order. - Yu-Hsuan Chang; Ro-Yu Wu; Ruay-Shiung Chang; Jou-Ming Chang (J. Comb. Optim., 2022)

Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting. - Kung-Jui Pai; Ro-Yu Wu; Sheng-Lung Peng; Jou-Ming Chang (J. Supercomput., 2023)