Finding the Set of All Hinge Vertices for Strongly Chordal Graphs in Linear Time. - Jou-Ming Chang; Chiun-Chieh Hsu; Yue-Li Wang; Ting-Yem Ho (Inf. Sci., 1997)

The Recognition of Geodetically Connected Graphs. - Jou-Ming Chang; Chin-Wen Ho (Inf. Process. Lett., 1998)

LexBFS-Ordering in Asteroidal Triple-Free Graphs. - Jou-Ming Chang; Chin-Wen Ho; Ming-Tat Ko (ISAAC, 1999)

Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs. - Chin-Wen Ho; Jou-Ming Chang (Inf. Process. Lett., 1999)

On the powers of graphs with bounded asteroidal number. - Ting-Yem Ho; Jou-Ming Chang; Yue-Li Wang (Discret. Math., 2000)

Powers of Asteroidal Triple-free Graphs with Applications. - Jou-Ming Chang; Chin-Wen Ho; Ming-Tat Ko (Ars Comb., 2003)

Induced matchings in asteroidal triple-free graphs. - Jou-Ming Chang (Discret. Appl. Math., 2003)

Sorting a sequence of strong kings in a tournament. - Ting-Yem Ho; Jou-Ming Chang (Inf. Process. Lett., 2003)

Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. - Fu-Hsing Wang; Jou-Ming Chang; Yue-Li Wang; Sun-Jen Huang (J. Parallel Distributed Comput., 2003)

Feedback vertex sets in star graphs. - Fu-Hsing Wang; Yue-Li Wang; Jou-Ming Chang (Inf. Process. Lett., 2004)

Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs. - Jou-Ming Chang; Jinn-Shyong Yang; Yue-Li Wang; Yuwen Cheng (Networks, 2004)

An efficient algorithm for estimating rotation distance between two binary trees. - Yen-Ju Chen; Jou-Ming Chang; Yue-Li Wang (Int. J. Comput. Math., 2005)

An efficient distributed algorithm for finding all hinge vertices in networks. - Ting-Yem Ho; Jou-Ming Chang (Int. J. Comput. Math., 2005)

A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs. - Jou-Ming Chang; An-Hang Chen (Ars Comb., 2006)

The lower and upper forcing geodetic numbers of block-cactus graphs. - Fu-Hsing Wang; Yue-Li Wang; Jou-Ming Chang (Eur. J. Oper. Res., 2006)

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)

Geodesic-pancyclic graphs. - Hung-Chang Chan; Jou-Ming Chang; Yue-Li Wang; Shi-Jinn Horng (Discret. Appl. Math., 2007)

Parallel construction of optimal independent spanning trees on hypercubes. - Jinn-Shyong Yang; Shyue-Ming Tang; Jou-Ming Chang; Yue-Li Wang (Parallel Comput., 2007)

Reducing the Height of Independent Spanning Trees in Chordal Rings. - Jinn-Shyong Yang; Jou-Ming Chang; Shyue-Ming Tang; Yue-Li Wang (IEEE Trans. Parallel Distributed Syst., 2007)

Fault-tolerant cycle-embedding in alternating group graphs. - Jou-Ming Chang; Jinn-Shyong Yang (Appl. Math. Comput., 2008)

The existence and uniqueness of strong kings in tournaments. - An-Hang Chen; Jou-Ming Chang; Yuwen Cheng; Yue-Li Wang (Discret. Math., 2008)

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)

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

Independent Spanning Trees on Folded Hypercubes. - Jinn-Shyong Yang; Jou-Ming Chang; Hung Chan (ISPAN, 2009)

Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes. - Hung-Chang Chan; Jou-Ming Chang; Yue-Li Wang; Shi-Jinn Horng (Appl. Math. Comput., 2009)

The Interchange Graphs of Tournaments with Minimum Score Vectors Are Exactly Hypercubes. - An-Hang Chen; Jou-Ming Chang; Yue-Li Wang (Graphs Comb., 2009)

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

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

On the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2. - Jinn-Shyong Yang; Jou-Ming Chang; Shyue-Ming Tang; Yue-Li Wang (Theor. Comput. Sci., 2009)

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

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)

Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2M, 2). - Jinn-Shyong Yang; Jou-Ming Chang; Shyue-Ming Tang; Yue-Li Wang (Int. J. Found. Comput. Sci., 2010)

Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes. - Jia-Cian Lin; Jinn-Shyong Yang; Chiun-Chieh Hsu; Jou-Ming Chang (Inf. Process. Lett., 2010)

Independent spanning trees on folded hyper-stars. - Jinn-Shyong Yang; Jou-Ming Chang (Networks, 2010)

Independent Spanning Trees on Multidimensional Torus Networks. - Shyue-Ming Tang; Jinn-Shyong Yang; Yue-Li Wang; Jou-Ming Chang (IEEE Trans. Computers, 2010)

A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs. - Kuo-Hua Kao; Jou-Ming Chang; Yue-Li Wang; Justie Su-tzu Juan (Algorithmica, 2011)

Broadcasting secure messages via optimal independent spanning trees in folded hypercubes. - Jinn-Shyong Yang; Hung-Chang Chan; Jou-Ming Chang (Discret. Appl. Math., 2011)

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)

Power Domination in Honeycomb Meshes. - Kuo-Hua Kao; Jou-Ming Chang; Yue-Li Wang; Shuo-Hong Xu; Justie Su-tzu Juan (J. Inf. Sci. Eng., 2013)

Parallel Construction of Independent Spanning Trees on Parity Cubes. - Yu-Huei Chang; Jinn-Shyong Yang; Jou-Ming Chang; Yue-Li Wang (CSE, 2014)

Some Results of Incidence Coloring on Generalized Petersen Graphs. - Kun-Fu Ding; Kung-Jui Pai; Jou-Ming Chang; Rueiher Tsaur (ICS, 2014)

Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs. - Jinn-Shyong Yang; Jou-Ming Chang (Comput. J., 2014)

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)

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)

Gray Codes for AT-Free Orders via Antimatroids. - Jou-Ming Chang; Ton Kloks; Hung-Lung Wang (IWOCA, 2015)

An Energy-Aware Random Multi-path Routing Protocol for MANETs. - Sheng-Lung Peng; Yan-Hao Chen; Ruay-Shiung Chang; Jou-Ming Chang (SmartCity, 2015)

A Fast Parallel Algorithm for Constructing Independent Spanning Trees on Parity Cubes. - Yu-Huei Chang; Jinn-Shyong Yang; Jou-Ming Chang; Yue-Li Wang (Appl. Math. Comput., 2015)

Pruning Longer Branches of Independent Spanning Trees on Folded Hyper-Stars. - Jinn-Shyong Yang; Sih-Syuan Luo; Jou-Ming Chang (Comput. J., 2015)

A Note on the Degree Condition of Completely Independent Spanning Trees. - Hung-Yi Chang; Hung-Lung Wang; Jinn-Shyong Yang; Jou-Ming Chang (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

On the Structure of Locally Outerplanar Graphs. - Hung-Lung Wang; Chun-Yu Tseng; Jou-Ming Chang (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

A fully parallelized scheme of constructing independent spanning trees on Möbius cubes. - Jinn-Shyong Yang; Meng-Ru Wu; Jou-Ming Chang; Yu-Huei Chang (J. Supercomput., 2015)

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)

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)

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)

A parallel algorithm for constructing independent spanning trees in twisted cubes. - Jou-Ming Chang; Ting-Jyun Yang; Jinn-Shyong Yang (Discret. Appl. Math., 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)

Construction independent spanning trees on locally twisted cubes in parallel. - Yu-Huei Chang; Jinn-Shyong Yang; Sun-Yuan Hsieh; Jou-Ming Chang; Yue-Li Wang (J. Comb. Optim., 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)

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)

The Component Connectivity of Alternating Group Graphs and Split-Stars. - Mei-Mei Gu; Rong-Xia Hao; Jou-Ming Chang (CoRR, 2018)

Cycle Embedding in Generalized Recursive Circulant Graphs. - Shyue-Ming Tang; Yue-Li Wang; Chien-Yi Li; Jou-Ming Chang (IEICE Trans. Inf. Syst., 2018)

Realizing Exchanged Crossed Cube Communication Patterns on Linear Array WDM Optical Networks. - Yu-Liang Liu; Jou-Ming Chang (Int. J. Found. Comput. Sci., 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)

Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity. - Mei-Mei Gu; Rong-Xia Hao; Jou-Ming Chang (IEEE Access, 2019)

Constructing dual-CISTs of DCell data center networks. - Xiao-Wen Qin; Jou-Ming Chang; Rong-Xia Hao (Appl. Math. Comput., 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 Locally Twisted Cubes. - Shun-Yu Li; Jou-Ming Chang; Kung-Jui Pai (ICS, 2020)

Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes. - Chao Wei; Rong-Xia Hao; Jou-Ming Chang (Appl. Math. Comput., 2020)

On Computing Component (Edge) Connectivities of Balanced Hypercubes. - Mei-Mei Gu; Jou-Ming Chang; Rong-Xia Hao (Comput. J., 2020)

Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs. - Mei-Mei Gu; Rong-Xia Hao; Shyue-Ming Tang; Jou-Ming Chang (Discret. Appl. Math., 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)

Reliability assessment of the Cayley graph generated by trees. - Shu-Li Zhao; Jou-Ming Chang; Rong-Xia Hao (Discret. Appl. Math., 2020)

On Component Connectivity of Hierarchical Star Networks. - Mei-Mei Gu; Jou-Ming Chang; Rong-Xia Hao (Int. J. Found. Comput. Sci., 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)

Relationship between extra edge connectivity and component edge connectivity for regular graphs. - Rong-Xia Hao; Mei-Mei Gu; Jou-Ming Chang (Theor. Comput. Sci., 2020)

The Existence of Completely Independent Spanning Trees for Some Compound Graphs. - Xiao-Wen Qin; Rong-Xia Hao; Jou-Ming Chang (IEEE Trans. Parallel Distributed Syst., 2020)

The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks. - Yi-Cheng Yang; Shih-Shun Kao; Ralf Klasing; Sun-Yuan Hsieh; Hsin-Hung Chou; Jou-Ming Chang (IEEE Access, 2021)

Strong Menger Connectedness of Augmented k-ary n-cubes. - Mei-Mei Gu; Jou-Ming Chang; Rong-Xia Hao (Comput. J., 2021)

Reliability Analysis of Alternating Group Graphs and Split-Stars. - Mei-Mei Gu; Rong-Xia Hao; Jou-Ming Chang (Comput. J., 2021)

The reliability analysis based on the generalized connectivity in balanced hypercubes. - Chao Wei; Rong-Xia Hao; Jou-Ming Chang (Discret. Appl. Math., 2021)

A Note on Super Connectivity of the Bouwer Graph. - Mei-Mei Gu; Jou-Ming Chang (J. Interconnect. Networks, 2021)

Packing internally disjoint Steiner trees to compute the κ3-connectivity in augmented cubes. - Chao Wei; Rong-Xia Hao; Jou-Ming Chang (J. Parallel Distributed Comput., 2021)

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)

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)

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)

Parallel construction of multiple independent spanning trees on highly scalable datacenter networks. - Jinn-Shyong Yang; Xiao-Yan Li; Sheng-Lung Peng; Jou-Ming Chang (Appl. Math. Comput., 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)

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

A secure data transmission scheme based on multi-protection routing in datacenter networks. - Xiao-Yan Li; Wanling Lin; Wenzhong Guo; Jou-Ming Chang (J. Parallel Distributed Comput., 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)

Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks With Heterogeneous Edge-Core Servers. - Xiao-Yan Li; Wanling Lin; Jou-Ming Chang; Xiaohua Jia (IEEE/ACM Trans. Netw., 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)

Neighbor connectivity of pancake graphs and burnt pancake graphs. - Mei-Mei Gu; Jou-Ming Chang (Discret. Appl. Math., 2023)

The generalized 4-connectivity of pancake graphs. - Shu-Li Zhao; Jou-Ming Chang; Hengzhe Li (Discret. Appl. Math., 2023)

Reliability assessment of the divide-and-swap cube in terms of generalized connectivity. - Shu-Li Zhao; Jou-Ming Chang (Theor. Comput. Sci., 2023)

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)

An Efficient Algorithm for Hamiltonian Path Embedding of $k$k-Ary $n$n-Cubes Under the Partitioned Edge Fault Model. - Hongbin Zhuang; Xiao-Yan Li; Jou-Ming Chang; Dajin Wang (IEEE Trans. Parallel Distributed Syst., 2023)

Constructing Multiple CISTs on BCube-Based Data Center Networks in the Occurrence of Switch Failures. - Wanling Lin; Xiao-Yan Li; Jou-Ming Chang; Xiaohua Jia (IEEE Trans. Computers, 2023)

Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes. - Shu-Li Zhao; Jou-Ming Chang (Inf. Process. Lett., 2023)

Matroidal connectivity and conditional matroidal connectivity of star graphs. - Hongbin Zhuang; Wanling Lin; Xiao-Yan Li; Jou-Ming Chang (Theor. Comput. Sci., 2023)

Embedding Hamiltonian Paths in $k$-Ary $n$-Cubes With Exponentially-Many Faulty Edges. - Hongbin Zhuang; Xiao-Yan Li; Jou-Ming Chang; Cheng-Kuan Lin; Ximeng Liu (IEEE Trans. Computers, 2023)

Two-disjoint-cycle-cover pancyclicity of data center networks. - Rong-Xia Hao; Xiao-Wen Qin; Hui Zhang; Jou-Ming Chang (Appl. Math. Comput., 2024)

On the minimum size of graphs with given generalized connectivity. - Shu-Li Zhao; Hengzhe Li; Jou-Ming Chang (Discret. Appl. Math., 2024)

Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model. - Hongbin Zhuang; Xiao-Yan Li; Jou-Ming Chang; Ximeng Liu (J. Parallel Distributed Comput., 2024)

Assessing Network Reliability Through Perspectives of Neighbor Connectivity and Subversion. - Mei-Mei Gu; Jinn-Shyong Yang; Jou-Ming Chang (IEEE Trans. Netw. Sci. Eng., 2024)

Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions. - Min-Shu Jao; Hung-Lung Wang; Jou-Ming Chang; Chia-Wen Wu (J. Inf. Sci. Eng., 2024)

Hyper star structure connectivity of hierarchical folded cubic networks. - Huimei Guo; Rong-Xia Hao; Jou-Ming Chang; Young Soo Kwon (J. Supercomput., 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)

2-Edge Hamiltonian connectedness: Characterization and results in data center networks. - Mei-Li Wang; Rong-Xia Hao; Jou-Ming Chang; Sejeong Bang (Appl. Math. Comput., 2025)

{1, 2}-good-neighbor conditional diagnosability of Cayley graphs generated by k-trees. - Shu-Li Zhao; Bao-Cheng Zhang; Jou-Ming Chang (Discret. Appl. Math., 2025)

Fault-tolerability analysis of hypercubes based on 3-component path-structure connectivity. - Bo Zhu; Shumin Zhang; Jou-Ming Chang; Jinyu Zou (Discret. Appl. Math., 2025)

Non-inclusive diagnosability of folded hypercube-like networks. - Nengjin Zhuo; Shumin Zhang; Jou-Ming Chang; Chengfu Ye (Discret. Appl. Math., 2025)

Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks. - Xiao-Yan Li; Zhaoding Lin; Hongbin Zhuang; Jou-Ming Chang (Theor. Comput. Sci., 2025)

Link/Switch Fault-Tolerant Hamiltonian Path Embedding in BCube Networks for Deadlock-Free Routing. - Wanling Lin; Xiao-Yan Li; Jou-Ming Chang; Dong Xiang; Xiaohua Jia (IEEE Trans. Dependable Secur. Comput., 2025)

LP-Star: Embedding Longest Paths into Star Networks With Large-Scale Missing Edges Under an Emerging Assessment Model. - Xiao-Yan Li; Jou-Ming Chang (IEEE Trans. Emerg. Top. Comput., 2025)

Packing internally disjoint Steiner paths of data center networks. - Wen-Han Zhu; Rong-Xia Hao; Jou-Ming Chang; Jaeun Lee (J. Supercomput., 2025)

A novel fault-tolerant technique for star graph-based interconnection networks. - Wenfei Liu; Jiafei Liu; Jou-Ming Chang; Jingli Wu; Qi Wang (J. Supercomput., 2025)

Structure connectivity of folded crossed cubes based on faulty stars. - Huimei Guo; Rong-Xia Hao; Aygul Mamut; Jou-Ming Chang; Jie Wu 001 (J. Appl. Math. Comput., 2025)

Non-inclusive g-extra diagnosability of regular networks under the MM* model. - Nengjin Zhuo; Shumin Zhang; Jou-Ming Chang; Chengfu Ye (J. Appl. Math. Comput., 2025)