Design of a multiple leaky buckets shaper. - Ruay Shiung Chang; Kung-Joi Pai; Chin-Ling Chen (Comput. Commun., 2000)

A Note on "An improved upper bound on the queuenumber of the hypercube". - Kung-Jui Pai; Jou-Ming Chang; Yue-Li Wang (Inf. Process. Lett., 2008)

Upper bounds on the queuenumber of k-ary n-cubes. - Kung-Jui Pai; Jou-Ming Chang; Yue-Li Wang (Inf. Process. Lett., 2009)

Restricted power domination and fault-tolerant power domination on grids. - Kung-Jui Pai; Jou-Ming Chang; Yue-Li Wang (Discret. Appl. Math., 2010)

A new upper bound on the queuenumber of hypercubes. - Kung-Jui Pai; Jou-Ming Chang; Yue-Li Wang (Discret. Math., 2010)

Erratum to "A new upper bound on the queuenumber of hypercubes" [Discrete Mathematics 310 (2010) 935-939]. - Kung-Jui Pai; Jou-Ming Chang; Yue-Li Wang (Discret. Math., 2010)

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)

Some Results of Incidence Coloring on Generalized Petersen Graphs. - Kun-Fu Ding; Kung-Jui Pai; Jou-Ming Chang; Rueiher Tsaur (ICS, 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)

Completely Independent Spanning Trees on Some Interconnection Networks. - Kung-Jui Pai; Jinn-Shyong Yang; Sing-Chen Yao; Shyue-Ming Tang; Jou-Ming Chang (IEICE Trans. Inf. Syst., 2014)

A comment on "Independent spanning trees in crossed cubes". - Jou-Ming Chang; Jhen-Ding Wang; Jinn-Shyong Yang; Kung-Jui Pai (Inf. Process. Lett., 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)

Parallel Construction of Independent Spanning Trees on Enhanced Hypercubes. - Jinn-Shyong Yang; Jou-Ming Chang; Kung-Jui Pai; Hung-Chang Chan (IEEE Trans. Parallel Distributed Syst., 2015)

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)

Vertex-transitivity on folded crossed cubes. - Kung-Jui Pai; Jou-Ming Chang; Jinn-Shyong Yang (Inf. Process. Lett., 2016)

Constructing two completely independent spanning trees in hypercube-variant networks. - Kung-Jui Pai; Jou-Ming Chang (Theor. Comput. Sci., 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)

On the Orbits of Crossed Cubes. - Tzong-Huei Shiau; Yue-Li Wang; Kung-Jui Pai (CoRR, 2017)

Completely Independent Spanning Trees on 4-Regular Chordal Rings. - Jou-Ming Chang; Hung-Yi Chang; Hung-Lung Wang; Kung-Jui Pai; Jinn-Shyong Yang (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

A note on path embedding in crossed cubes with faulty vertices. - Hon-Chan Chen; Yun-Hao Zou; Yue-Li Wang; Kung-Jui Pai (Inf. Process. Lett., 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)

Designing an Algorithm to Improve the Diameters of Completely Independent Spanning Trees in Crossed Cubes. - Kung-Jui Pai (ICS, 2018)

The Wide Diameters of Regular Hyper-Stars and Folded Hyper-Stars. - Jou-Ming Chang; Jinn-Shyong Yang; Shyue-Ming Tang; Kung-Jui Pai (Comput. J., 2018)

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)

Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes. - Yi-Xian Yang; Kung-Jui Pai; Ruay-Shiung Chang; Jou-Ming Chang (IEICE Trans. Inf. Syst., 2019)

Improving the diameters of completely independent spanning trees in locally twisted cubes. - Kung-Jui Pai; Jou-Ming Chang (Inf. Process. Lett., 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)

Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks. - Kung-Jui Pai; Jou-Ming Chang (IEEE/ACM Trans. Netw., 2019)

A Parallel Algorithm for Constructing Two Edge-Disjoint Hamiltonian Cycles in Crossed Cubes. - Kung-Jui Pai (AAIM, 2020)

A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Locally Twisted Cubes. - Shun-Yu Li; Jou-Ming Chang; Kung-Jui Pai (ICS, 2020)

Comments on "A Hamilton sufficient condition for completely independent spanning tree". - Xiao-Wen Qin; Rong-Xia Hao; Kung-Jui Pai; Jou-Ming Chang (Discret. Appl. Math., 2020)

A well-equalized 3-CIST partition of alternating group graphs. - Kung-Jui Pai; Ruay-Shiung Chang; Jou-Ming Chang (Inf. Process. Lett., 2020)

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 protection routing with secure mechanism in Möbius cubes. - Kung-Jui Pai; Ruay-Shiung Chang; Jou-Ming Chang (J. Parallel Distributed Comput., 2020)

Embedding Three Edge-Disjoint Hamiltonian Cycles into Locally Twisted Cubes. - Kung-Jui Pai (COCOON, 2021)

Constructing dual-CISTs of folded divide-and-swap cubes. - Yu-Huei Chang; Kung-Jui Pai; Chiun-Chieh Hsu; Jinn-Shyong Yang; Jou-Ming Chang (Theor. Comput. Sci., 2021)

Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes. - Yu-Han Chen; Shyue-Ming Tang; Kung-Jui Pai; Jou-Ming Chang (Theor. Comput. Sci., 2021)

Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks. - Kung-Jui Pai; Ruay-Shiung Chang; Jou-Ming Chang (J. Supercomput., 2021)

Constructing tri-CISTs in shuffle-cubes. - Yu-Han Chen; Kung-Jui Pai; Hsin-Jung Lin; Jou-Ming Chang (J. Comb. Optim., 2022)

Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks. - Kung-Jui Pai; Jinn-Shyong Yang; Guan-Yu Chen; Jou-Ming Chang (IEEE Trans. Netw. Sci. Eng., 2022)

Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing. - Xiao-Yan Li; Wanling Lin; Ximeng Liu; Cheng-Kuan Lin; Kung-Jui Pai; Jou-Ming Chang (IEEE Trans. Parallel Distributed Syst., 2022)

Subversion analyses of hierarchical networks based on (edge) neighbor connectivity. - Mei-Mei Gu; Kung-Jui Pai; Jou-Ming Chang (J. Parallel Distributed Comput., 2023)

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)

Two Edge-Disjoint Hamiltonian Cycles in Shuffle-cubes. - Kung-Jui Pai (ICS, 2024)

Reliability analysis of exchanged hypercubes based on the path connectivity. - Wen-Han Zhu; Rong-Xia Hao; Kung-Jui Pai; Eddie Cheng 001 (Discret. Appl. Math., 2024)

A tree structure for local diagnosis in multiprocessor systems under the comparison model. - Meirun Chen; Cheng-Kuan Lin; Kung-Jui Pai (Theor. Comput. Sci., 2024)

A New Tree Structure for Local Diagnosis. - Meirun Chen; Xiao-Yan Li; Cheng-Kuan Lin; Kung-Jui Pai (J. Inf. Sci. Eng., 2024)

A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks. - Hsin-Jung Lin; Shyue-Ming Tang; Kung-Jui Pai; Jou-Ming Chang (Int. J. Found. Comput. Sci., 2024)

A new locally t-diagnosable structure under the PMC model with an application to matching composition networks. - Meirun Chen; Cheng-Kuan Lin; Kung-Jui Pai (Discret. Appl. Math., 2025)