| The 4-component connectivity of alternating group networks JM Chang, KJ Pai, RY Wu, JS Yang Theoretical Computer Science 766, 38-45, 2019 | 40 | 2019 |
| Completely independent spanning trees on complete graphs, complete bipartite graphs and complete tripartite graphs KJ Pai, SM Tang, JM Chang, JS Yang Advances in Intelligent Systems and Applications-Volume 1: Proceedings of …, 2013 | 40 | 2013 |
| Parallel construction of independent spanning trees on enhanced hypercubes JS Yang, JM Chang, KJ Pai, HC Chan IEEE Transactions on Parallel and Distributed Systems 26 (11), 3090-3098, 2014 | 39 | 2014 |
| Completely independent spanning trees on BCCC data center networks with an application to fault-tolerant routing XY Li, W Lin, X Liu, CK Lin, KJ Pai, JM Chang IEEE Transactions on Parallel and Distributed Systems 33 (8), 1939-1952, 2021 | 38 | 2021 |
| Constructing two completely independent spanning trees in hypercube-variant networks KJ Pai, JM Chang Theoretical Computer Science 652, 28-37, 2016 | 33 | 2016 |
| Completely independent spanning trees on some interconnection networks KJ Pai, JS Yang, SC Yao, SM Tang, JM Chang IEICE TRANSACTIONS on information and systems 97 (9), 2514-2517, 2014 | 33 | 2014 |
| Dual-CISTs: Configuring a protection routing on some Cayley networks KJ Pai, JM Chang IEEE/ACM Transactions on Networking 27 (3), 1112-1123, 2019 | 27 | 2019 |
| Three completely independent spanning trees of crossed cubes with application to secure-protection routing KJ Pai, RS Chang, RY Wu, JM Chang Information Sciences 541, 516-530, 2020 | 25 | 2020 |
| Two kinds of generalized 3-connectivities of alternating group networks JM Chang, KJ Pai, JS Yang, RY Wu International Workshop on Frontiers in Algorithmics, 3-14, 2018 | 25 | 2018 |
| A protection routing with secure mechanism in Möbius cubes KJ Pai, RS Chang, JM Chang Journal of Parallel and Distributed Computing 140, 1-12, 2020 | 23 | 2020 |
| Restricted power domination and fault-tolerant power domination on grids KJ Pai, JM Chang, YL Wang Discrete Applied Mathematics 158 (10), 1079-1089, 2010 | 23 | 2010 |
| Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks SS Kao, KJ Pai, SY Hsieh, RY Wu, JM Chang Journal of Combinatorial Optimization 38, 972-986, 2019 | 20 | 2019 |
| A two-stages tree-searching algorithm for finding three completely independent spanning trees KJ Pai, RS Chang, RY Wu, JM Chang Theoretical Computer Science 784, 65-74, 2019 | 18 | 2019 |
| A comment on “Independent spanning trees in crossed cubes” JM Chang, JD Wang, JS Yang, KJ Pai Information Processing Letters 114 (12), 734-739, 2014 | 18 | 2014 |
| Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks KJ Pai, RS Chang, JM Chang The Journal of Supercomputing 77 (1), 990-1014, 2021 | 16 | 2021 |
| Improving the diameters of completely independent spanning trees in locally twisted cubes KJ Pai, JM Chang Information Processing Letters 141, 22-24, 2019 | 16 | 2019 |
| Completely independent spanning trees on 4-regular chordal rings JM Chang, HY Chang, HL Wang, KJ Pai, JS Yang IEICE Transactions on Fundamentals of Electronics, Communications and …, 2017 | 15 | 2017 |
| A simple algorithm for solving the power domination problem on grid graphs KJ Pai, JM Chang, YL Wang Proc. the 24th Workshop Combin. Math. and Comput. Theory, 256-260, 2007 | 14 | 2007 |
| Vertex-transitivity on folded crossed cubes KJ Pai, JM Chang, JS Yang Information Processing Letters 116 (11), 689-693, 2016 | 13 | 2016 |
| Incidence coloring on hypercubes KJ Pai, JM Chang, JS Yang, RY Wu Theoretical Computer Science 557, 59-65, 2014 | 13 | 2014 |
