A Faster Algorithm for Computing the Strength of a Network. - Eddie Cheng 001; William H. Cunningham (Inf. Process. Lett., 1994)

Separation Problems for the Stable Set Polytope. - Eddie Cheng 001; William H. Cunningham (IPCO, 1995)

Wheel inequalitites for stable set polytopes. - Eddie Cheng 001; William H. Cunningham (Math. Program., 1997)

Separating subdivision of bicycle wheel inequalities over cut polytopes. - Eddie Cheng 001 (Oper. Res. Lett., 1998)

Edge-augmentation of hypergraphs. - Eddie Cheng 001 (Math. Program., 1999)

Successive edge-connectivity augmentation problems. - Eddie Cheng 001; Tibor Jordán (Math. Program., 1999)

On the Day-Tripathi orientation of the star graphs: Connectivity. - Eddie Cheng 001; Marc J. Lipman (Inf. Process. Lett., 2000)

Orienting split-stars and alternating group graphs. - Eddie Cheng 001; Marc J. Lipman (Networks, 2000)

Super Connectivity of Star Graphs, Alternating Group Graphs and Split-Stars. - Eddie Cheng 001; Marc J. Lipman; Hyungju Park (Ars Comb., 2001)

Flow Formulations for the Student Scheduling Problem. - Eddie Cheng 001; Serge G. Kruk; Marc J. Lipman (PATAT, 2002)

Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness. - Eddie Cheng 001; Marc J. Lipman (Discret. Appl. Math., 2002)

Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract). - Eddie Cheng 001; Jerrold W. Grossman; Marc J. Lipman (Electron. Notes Discret. Math., 2002)

Basic Structures of Some Interconnection Networks. - Eddie Cheng 001; Marc J. Lipman (Electron. Notes Discret. Math., 2002)

Separation of Antiweb-Wheel Inequalities Over Stable Set Polytopes. - Eddie Cheng 001; Sven de Vries (Electron. Notes Discret. Math., 2002)

Unidirectional (n, k)-Star Graphs. - Eddie Cheng 001; Marc J. Lipman (J. Interconnect. Networks, 2002)

Antiweb-wheel inequalities and their separation problems over the stable set polytopes. - Eddie Cheng 001; Sven de Vries (Math. Program., 2002)

Increasing the connectivity of the star graphs. - Eddie Cheng 001; Marc J. Lipman (Networks, 2002)

On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes. - Eddie Cheng 001; Sven de Vries (SIAM J. Discret. Math., 2002)

Time-stamped Graphs and Their Associated Influence Digraphs. - Eddie Cheng 001; Jerrold W. Grossman; Marc J. Lipman (Discret. Appl. Math., 2003)

Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. - Eddie Cheng 001; Sven de Vries (Oper. Res. Lett., 2004)

Maximal vertex-connectivity of. - Eddie Cheng 001; William A. Lindsey; Daniel E. Steffy (Networks, 2005)

Structural Properties Of Hyper-Stars. - Eddie Cheng 001; László Lipták (Ars Comb., 2006)

Fault Resiliency of Cayley Graphs Generated by Transpositions. - Eddie Cheng 001; László Lipták (Int. J. Found. Comput. Sci., 2007)

Linearly many faults in Cayley graphs generated by transposition trees. - Eddie Cheng 001; László Lipták (Inf. Sci., 2007)

Matching preclusion for some interconnection networks. - Eddie Cheng 001; László Lipták (Networks, 2007)

Orienting Cayley graphs generated by transposition trees. - Eddie Cheng 001; László Lipták; Nart Shawash (Comput. Math. Appl., 2008)

Strong structural properties of unidirectional star graphs. - Eddie Cheng 001; Marc J. Lipman; László Lipták (Discret. Appl. Math., 2008)

Matching preclusion for Alternating Group Graphs and their Generalizations. - Eddie Cheng 001; Linda M. Lesniak; Marc J. Lipman; László Lipták (Int. J. Found. Comput. Sci., 2008)

Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model. - Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu; Eddie Cheng 001; László Lipták (J. Interconnect. Networks, 2008)

Hamiltonian connectivity of 2-tree-generated networks. - Eddie Cheng 001; Marc J. Lipman; László Lipták; David Stiebel (Math. Comput. Model., 2008)

On Disjoint Shortest Paths Routing on the Hypercube. - Eddie Cheng 001; Shuhong Gao; Ke Qiu 001; Zhizhang Shen (COCOA, 2009)

Embedding hypercubes, rings, and odd graphs into hyper-stars. - Jong-Seok Kim; Eddie Cheng 001; László Lipták; Hyeong-Ok Lee (Int. J. Comput. Math., 2009)

Conditional matching preclusion sets. - Eddie Cheng 001; Linda M. Lesniak; Marc J. Lipman; László Lipták (Inf. Sci., 2009)

A Generating Function Approach to the Surface Areas of Some Interconnection Networks. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Interconnect. Networks, 2009)

A short note on the surface area of star graphs. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Parallel Process. Lett., 2009)

On the surface area of the (n, k)-star graph. - Zhizhang Shen; Ke Qiu 001; Eddie Cheng 001 (Theor. Comput. Sci., 2009)

The Number of Shortest Paths in the (n, k)-Star Graphs. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (COCOA (1), 2010)

Matching preclusion for the (n, k)-bubble-sort graphs. - Eddie Cheng 001; László Lipták; David Sherman (Int. J. Comput. Math., 2010)

On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Comput. Math., 2010)

Distance formula and shortest paths for the (n, k)-star graphs. - Eddie Cheng 001; Jerrold W. Grossman; László Lipták; Ke Qiu 001; Zhizhang Shen (Inf. Sci., 2010)

Matching preclusion and Conditional Matching preclusion for Augmented Cubes. - Eddie Cheng 001; Randy Jia; David Lu (J. Interconnect. Networks, 2010)

On the Existence of Disjoint Spanning Paths in Faulty Hypercubes. - Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu; Eddie Cheng 001; László Lipták (J. Interconnect. Networks, 2010)

4-Ordered Hamiltonicity for Some Chordal Ring Graphs. - David Sherman; Ming Tsai; Cheng-Kuan Lin; László Lipták; Eddie Cheng 001; Jimmy J. M. Tan; Lih-Hsing Hsu (J. Interconnect. Networks, 2010)

Linearly many faults in 2-tree-generated networks. - Eddie Cheng 001; László Lipták; Fred Sala 001 (Networks, 2010)

On the Surface Area of the Asymmetric Twisted Cube. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (COCOA, 2011)

Minimum Steiner Tree for Automatic SQL Query Generation Applied on a Medical Record Database. - Christopher E. Gillies; Nilesh V. Patel; Gautam B. Singh; Serge G. Kruk; Eddie Cheng 001; George D. Wilson (SERVICES, 2011)

On the edge-connectivity of graphs with two orbits of the same size. - Weihua Yang; Zhao Zhang; Xiaofeng Guo; Eddie Cheng 001; László Lipták (Discret. Math., 2011)

Conditional matching preclusion for the alternating group graphs and split-stars. - Eddie Cheng 001; László Lipták; Marc J. Lipman; Matthew Toeniskoetter (Int. J. Comput. Math., 2011)

A note on embeddings among folded hypercubes, even graphs and odd graphs. - Jong-Seok Kim; Eddie Cheng 001; László Lipták; Hyeong-Ok Lee (Int. J. Comput. Math., 2011)

Linearly Many Faults in (n, k)-Star Graphs. - Allen Yuan; Eddie Cheng 001; László Lipták (Int. J. Found. Comput. Sci., 2011)

A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees. - Eddie Cheng 001; László Lipták; Weihua Yang; Zhao Zhang; Xiaofeng Guo (Inf. Sci., 2011)

Independent spanning trees on even networks. - Jong-Seok Kim; Hyeong-Ok Lee; Eddie Cheng 001; László Lipták (Inf. Sci., 2011)

Strong Matching preclusion for the Alternating Group Graphs and Split-Stars. - Philip Bonneville; Eddie Cheng 001; Joseph Renzi (J. Interconnect. Networks, 2011)

On the Surface Areas and Average Distances of Meshes and Tori. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Parallel Process. Lett., 2011)

Conditional matching preclusion for the arrangement graphs. - Eddie Cheng 001; Marc J. Lipman; László Lipták; David Sherman (Theor. Comput. Sci., 2011)

Optimal Independent Spanning Trees on Odd Graphs. - Jong-Seok Kim; Hyeong-Ok Lee; Eddie Cheng 001; László Lipták (J. Supercomput., 2011)

Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products. - Eddie Cheng 001; László Lipták (Discret. Appl. Math., 2012)

Matching preclusion and conditional matching preclusion for regular interconnection networks. - Eddie Cheng 001; Marc J. Lipman; László Lipták (Discret. Appl. Math., 2012)

One-to-many node-disjoint paths of hyper-star networks. - László Lipták; Eddie Cheng 001; Jong-Seok Kim; Sung Won Kim (Discret. Appl. Math., 2012)

Solution to an open problem on 4-ordered Hamiltonian graphs. - Lih-Hsing Hsu; Jimmy J. M. Tan; Eddie Cheng 001; László Lipták; Cheng-Kuan Lin; Ming Tsai (Discret. Math., 2012)

Component connectivity of the hypercubes. - Lih-Hsing Hsu; Eddie Cheng 001; László Lipták; Jimmy J. M. Tan; Cheng-Kuan Lin; Tung-Yang Ho (Int. J. Comput. Math., 2012)

On deriving conditional diagnosability of interconnection networks. - Eddie Cheng 001; László Lipták; Ke Qiu 001; Zhizhang Shen (Inf. Process. Lett., 2012)

A Unified Approach to the Conditional Diagnosability of Interconnection Networks. - Eddie Cheng 001; László Lipták; Ke Qiu 001; Zhizhang Shen (J. Interconnect. Networks, 2012)

Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions. - Eddie Cheng 001; Philip Hu; Roger Jia; László Lipták (Networks, 2012)

Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars. - Eddie Cheng 001; Philip Hu; Roger Jia; László Lipták (Networks, 2012)

Matching preclusion and Conditional Matching preclusion for Crossed Cubes. - Eddie Cheng 001; Sachin Padmanabhan (Parallel Process. Lett., 2012)

A note on the alternating group network. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Supercomput., 2012)

On the surface area of the augmented cubes. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Supercomput., 2012)

Topological properties of folded hyper-star networks. - Jong-Seok Kim; Sung Won Kim; Eddie Cheng 001; László Lipták (J. Supercomput., 2012)

A Generating Function Approach to the Edge Surface Area of the Arrangement Graphs. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Comput. J., 2013)

Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees. - Eddie Cheng 001; László Lipták; Ke Qiu 001; Zhizhang Shen (Graphs Comb., 2013)

A Faster Algorithm for Finding Disjoint Ordering of Sets. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Netw. Comput., 2013)

Strong local diagnosability of (n, k)(n, k)-star graphs and Cayley graphs generated by 2-trees with missing edges. - Eddie Cheng 001; László Lipták; Daniel E. Steffy (Inf. Process. Lett., 2013)

The number of shortest paths in the arrangement graph. - Eddie Cheng 001; Jerrold W. Grossman; Ke Qiu 001; Zhizhang Shen (Inf. Sci., 2013)

Diagnosability of Cayley graphs generated by transposition trees with missing edges. - Eddie Cheng 001; László Lipták (Inf. Sci., 2013)

Strong Matching preclusion of Pancake graphs. - Eddie Cheng 001; David Lu; Brian Xu (J. Interconnect. Networks, 2013)

4-ordered-Hamiltonian problems of the generalized Petersen graph GP(n, 4). - Chun-Nan Hung; David Lu; Randy Jia; Cheng-Kuan Lin; László Lipták; Eddie Cheng 001; Jimmy J. M. Tan; Lih-Hsing Hsu (Math. Comput. Model., 2013)

Linearly many faults in arrangement graphs. - Eddie Cheng 001; László Lipták; Allen Yuan (Networks, 2013)

Linearly many faults in augmented cubes. - Ariana Angjeli; Eddie Cheng 001; László Lipták (Int. J. Parallel Emergent Distributed Syst., 2013)

Conditional Matching preclusion for (n, k)-Star Graphs. - Eddie Cheng 001; László Lipták (Parallel Process. Lett., 2013)

The QN, k, M Graph: a Common Generalization of Various Popular Interconnection Networks. - Eddie Cheng 001; Nart Shawash (Parallel Process. Lett., 2013)

Linearly many faults in dual-cube-like networks. - Ariana Angjeli; Eddie Cheng 001; László Lipták (Theor. Comput. Sci., 2013)

Strong matching preclusion for augmented cubes. - Eddie Cheng 001; Shalin Shah; Vyom Shah; Daniel E. Steffy (Theor. Comput. Sci., 2013)

Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (CSE, 2014)

On the Surface Areas of the Alternating Group Graph and the Split-Star Graph. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Ars Comb., 2014)

Conditional Fault Hamiltonicity of the Star Graph. - Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu; Eddie Cheng 001; László Lipták (Ars Comb., 2014)

The number of shortest paths in the (n, k)-star graph. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Discret. Math. Algorithms Appl., 2014)

Length two path-centred surface areas for the arrangement graph. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Comput. Math., 2014)

The edge-centered surface area of the arrangement graph. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Comb. Optim., 2014)

Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs. - Eddie Cheng 001; Philip Hu; Roger Jia; László Lipták; Brian Scholten; James R. Voss (Int. J. Parallel Emergent Distributed Syst., 2014)

On the conditional diagnosability of matching composition networks. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Theor. Comput. Sci., 2014)

Deriving length two path centered surface area for the arrangement graph: a generating function approach. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Supercomput., 2014)

Conditional Matching Preclusion For The Star Graphs. - Eddie Cheng 001; László Lipták; Lih-Hsing Hsu; Jimmy J. M. Tan; Cheng-Kuan Lin (Ars Comb., 2015)

On Hamiltonian properties of unidirectional hypercubes. - Chun-Nan Hung; Eddie Cheng 001; Tao-Ming Wang; Lih-Hsing Hsu (Inf. Process. Lett., 2015)

Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Interconnect. Networks, 2015)

Linearly Many Edge-Faults in 2-Bijective Connection Networks. - Dhruv Medarametla; Eddie Cheng 001; Steven Cheng; Lawrance Wu (Parallel Process. Lett., 2015)

Matching preclusion and conditional matching preclusion problems for the folded Petersen cube. - Eddie Cheng 001; Robert Connolly; Christopher Melekian (Theor. Comput. Sci., 2015)

Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the PMC Model. - Nai-Wen Chang 002; Eddie Cheng 001; Sun-Yuan Hsieh (ACM Trans. Design Autom. Electr. Syst., 2015)

Length two path centered surface areas of the (n, k)-star graph. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Inf. Sci., 2016)

Strong Matching Preclusion of Arrangement Graphs. - Eddie Cheng 001; Omer Siddiqui (J. Interconnect. Networks, 2016)

Strong matching preclusion of burnt pancake graphs. - Eddie Cheng 001; Justin Kelm; Roi Orzach; Brian Xu (Int. J. Parallel Emergent Distributed Syst., 2016)

On the Conditional Diagnosability of Hyper-Buttery Graphs snd Related Networks. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Parallel Process. Lett., 2016)

Strong matching preclusion of (n, k)-star graphs. - Eddie Cheng 001; Justin Kelm; Joseph Renzi (Theor. Comput. Sci., 2016)

A Study of the Decycling Problem for the Generalized Exchanged Hypercube. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (ISPAN-FCST-ISCC, 2017)

Steiner Distance in Join, Corona and Threshold Graphs. - Zhao Wang 007; Yaping Mao; Christopher Melekian; Eddie Cheng 001 (ISPAN-FCST-ISCC, 2017)

Proper distance in edge-colored hypercubes. - Eddie Cheng 001; Colton Magnant; Dhruv Medarametla (Appl. Math. Comput., 2017)

A strong connectivity property of the generalized exchanged hypercube. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Discret. Appl. Math., 2017)

On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs. - Eddie Cheng 001; Li Li 018; László Lipták; Sangho Shim; Daniel E. Steffy (Graphs Comb., 2017)

Diagnosability problems of the exchanged hypercube and its generalization. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Comput. Math. Comput. Syst. Theory, 2017)

On Diagnosability of Interconnection Networks. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Unconv. Comput., 2017)

Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions. - Chun-Nan Hung; Cheng-Kuan Lin; Lih-Hsing Hsu; Eddie Cheng 001; László Lipták (Parallel Process. Lett., 2017)

On the restricted connectivity of the arrangement graph. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Supercomput., 2017)

Fractional Matching Preclusion for (Burnt) Pancake Graphs. - Tianlong Ma; Yaping Mao; Eddie Cheng 001; Christopher Melekian (I-SPAN, 2018)

Fault-Hamiltonicity of Cartesian products of directed cycles. - Chun-Nan Hung; Tao-Ming Wang; Lih-Hsing Hsu; Eddie Cheng 001 (Art Discret. Appl. Math., 2018)

The k-independence number of graph products. - Yaping Mao; Eddie Cheng 001; Zhao Wang 007; Zhiwei Guo (Art Discret. Appl. Math., 2018)

Steiner Distance in Product Networks. - Yaping Mao; Eddie Cheng 001; Zhao Wang 007 (Discret. Math. Theor. Comput. Sci., 2018)

A Complete Classification of Which (n, k)-Star Graphs are Cayley Graphs. - Karimah Sweet; Li Li 018; Eddie Cheng 001; László Lipták; Daniel E. Steffy (Graphs Comb., 2018)

A note on the Steiner -diameter of a graph. - Yaping Mao; Christopher Melekian; Eddie Cheng 001 (Int. J. Comput. Math. Comput. Syst. Theory, 2018)

Matching Preclusion for the Shuffle-Cubes. - Sai Antantapantula; Christopher Melekian; Eddie Cheng 001 (Parallel Process. Lett., 2018)

Fractional Matching Preclusion for (n, k)-Star Graphs. - Tianlong Ma; Yaping Mao; Eddie Cheng 001; Jinling Wang 002 (Parallel Process. Lett., 2018)

Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks. - Shengjie He; Rong-Xia Hao; Eddie Cheng 001 (Theor. Comput. Sci., 2018)

Strong matching preclusion number of graphs. - Yaping Mao; Zhao Wang 007; Eddie Cheng 001; Christopher Melekian (Theor. Comput. Sci., 2018)

Structural Properties and Fault Resiliency of Interconnection Networks. - Eddie Cheng 001; Rong-Xia Hao; Ke Qiu 001; Zhizhang Shen (From Parallel to Emergent Computing, 2019)

Minimum degree and size conditions for the proper connection number of graphs. - Xiaxia Guan; Lina Xue; Eddie Cheng 001; Weihua Yang (Appl. Math. Comput., 2019)

Fractional matching preclusion for arrangement graphs. - Tianlong Ma; Yaping Mao; Eddie Cheng 001; Jinling Wang 002 (Discret. Appl. Math., 2019)

Two kinds of generalized connectivity of dual cubes. - Shu-Li Zhao; Rong-Xia Hao; Eddie Cheng 001 (Discret. Appl. Math., 2019)

Fractional matching preclusion for generalized augmented cubes. - Tianlong Ma; Yaping Mao; Eddie Cheng 001; Christopher Melekian (Discret. Math. Theor. Comput. Sci., 2019)

Introduction. - Eddie Cheng 001; Sun-Yuan Hsieh; Delaram Kahrobaei (Int. J. Comput. Math. Comput. Syst. Theory, 2019)

Strong matching preclusion problem of the folded Petersen cube. - Eddie Cheng 001; Spencer Liu; Chris Melekian; Karimah Sweet; Chittesh Thavamani; Freddie Zhao (Int. J. Comput. Math. Comput. Syst. Theory, 2019)

Steiner Distance in Join, Corona, Cluster, and Threshold Graphs. - Zhao Wang 007; Yaping Mao; Christopher Melekian; Eddie Cheng 001 (J. Inf. Sci. Eng., 2019)

Preface. - Eddie Cheng 001; Yaping Mao (J. Interconnect. Networks, 2019)

A Concise Survey of Matching Preclusion in Interconnection Networks. - Yaping Mao; Eddie Cheng 001 (J. Interconnect. Networks, 2019)

Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles. - Ajay Arora; Eddie Cheng 001; Colton Magnant (Parallel Process. Lett., 2019)

A Note on the Steiner k-Diameter of Tensor Product Networks. - Pranav Arunandhi; Eddie Cheng 001; Christopher Melekian (Parallel Process. Lett., 2019)

A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Theor. Comput. Sci., 2019)

Strongly Menger connectedness of data center network and (n, k)-star graph. - Mei-Mei Gu; Shengjie He; Rong-Xia Hao; Eddie Cheng 001 (Theor. Comput. Sci., 2019)

A note on generalized matching preclusion in bipartite graphs. - Christopher Melekian; Eddie Cheng 001 (Theor. Comput. Sci., 2019)

Matching preclusion number in product graphs. - Zhao Wang 007; Christopher Melekian; Eddie Cheng 001; Yaping Mao (Theor. Comput. Sci., 2019)

Matching preclusion number of graphs. - Zhao Wang 007; Yaping Mao; Eddie Cheng 001; Jinyu Zou (Theor. Comput. Sci., 2019)

Two Algorithms for Constructing Independent Spanning Trees in (n, k)-Star Graphs. - Jie-Fu Huang; Eddie Cheng 001; Sun-Yuan Hsieh (IEEE Access, 2020)

Note on Applications of Linearly Many Faults. - Mei-Mei Gu; Rong-Xia Hao; Eddie Cheng 001 (Comput. J., 2020)

2-spanning cyclability problems of the some generalized Petersen graphs. - Eddie Cheng 001; Lih-Hsing Hsu; Chun-Nan Hung; Meng-Chien Yang (Discuss. Math. Graph Theory, 2020)

The g-extra diagnosability of the generalized exchanged hypercube. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Comput. Math. Comput. Syst. Theory, 2020)

Reliability and conditional diagnosability of hyper bijective connection networks. - Guanqin Lian; Shuming Zhou; Eddie Cheng 001; Jiafei Liu; Gaolin Chen; Zhendong Gu (Int. J. Comput. Math. Comput. Syst. Theory, 2020)

Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements. - Jing Li 048; Chris Melekian; Shurong Zuo; Eddie Cheng 001 (Int. J. Found. Comput. Sci., 2020)

A note on the strong matching preclusion problem for data center networks. - Tianlong Ma; Yaping Mao; Eddie Cheng 001; Ping Han (Inf. Process. Lett., 2020)

Preface. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Parallel Emergent Distributed Syst., 2020)

Diagnosability of interconnection networks: past, present and future. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Parallel Emergent Distributed Syst., 2020)

Preface. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen; Weihua Yang (Parallel Process. Lett., 2020)

A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen; Weihua Yang (Parallel Process. Lett., 2020)

Structure and Substructure Connectivity of Hypercube-Like Networks. - Cheng-Kuan Lin; Eddie Cheng 001; László Lipták (Parallel Process. Lett., 2020)

Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs (Extended Abstract). - Sambhav Gupta; Eddie Cheng 001; László Lipták (COCOON, 2021)

Persistence of Hybrid Diagnosability of Regular Networks Under Testing Diagnostic Model. - Guanqin Lian; Shuming Zhou; Eddie Cheng 001; Jiafei Liu; Gaolin Chen (Comput. J., 2021)

Super spanning connectivity of split-star networks. - Jing Li 048; Xujing Li; Eddie Cheng 001 (Inf. Process. Lett., 2021)

Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree. - Nan Jia; Yaping Mao; Zhao Wang 007; Eddie Cheng 001 (Math. Comput. Sci., 2021)

Reliability Evaluation of Bicube-Based Multiprocessor System under the g-Good-Neighbor Restriction. - Jiafei Liu; Shuming Zhou; Eddie Cheng 001; Gaolin Chen; Min Li (Parallel Process. Lett., 2021)

Reliability analysis of the cactus-based networks. - Jiafei Liu; Shuming Zhou; Eddie Cheng 001; Qianru Zhou; Xiaoqing Liu (Theor. Comput. Sci., 2021)

Characterization of component diagnosability of regular networks. - Hong Zhang 044; Shuming Zhou; Eddie Cheng 001; Sun-Yuan Hsieh (Discret. Appl. Math., 2022)

Fractional matching preclusion number of graphs. - Jinyu Zou; Yaping Mao; Zhao Wang 007; Eddie Cheng 001 (Discret. Appl. Math., 2022)

A note on maximum fractional matchings of graphs. - Tianlong Ma; Eddie Cheng 001; Yaping Mao; Xu Wang (J. Comb. Optim., 2022)

A Note on Linearly Many Faults of Interconnection Networks. - Eddie Cheng 001; László Lipták; Ke Qiu 001; Zhizhang Shen (J. Interconnect. Networks, 2022)

A general approach to deriving diagnosability results of interconnection networks. - Eddie Cheng 001; Yaping Mao; Ke Qiu 001; Zhizhang Shen (Int. J. Parallel Emergent Distributed Syst., 2022)

Fault-tolerant Hamiltonian connectivity of 2-tree-generated networks. - Mohamad Abdallah; Eddie Cheng 001 (Theor. Comput. Sci., 2022)

On the g-extra diagnosability of enhanced hypercubes. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Theor. Comput. Sci., 2022)

Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs. - Sambhav Gupta; Eddie Cheng 001; László Lipták (Int. J. Comput. Math. Comput. Syst. Theory, 2022)

Forward Difference Properties of the (n, k)-Star Graph and Some Other Interconnection Networks. - Eddie Cheng 001; Ethan Gibbons; Ke Qiu 001; Zhizhang Shen (ICPADS, 2023)

Constructing disjoint Steiner trees in Sierpiński graphs. - Chenxu Yang; Ping Li 025; Yaping Mao; Eddie Cheng 001; Ralf Klasing (CoRR, 2023)

Restricted connectivity of Cayley graph generated by transposition trees. - Hong Zhang 044; Shuming Zhou; Eddie Cheng 001 (Discret. Appl. Math., 2023)

Conditional strong matching preclusion of the pancake graph. - Mohamad Abdallah; Eddie Cheng 001 (Int. J. Parallel Emergent Distributed Syst., 2023)

Reliability analysis of the generalized balanced hypercube. - Xiaoqing Liu; Shuming Zhou; Eddie Cheng 001; Hong Zhang 044 (Theor. Comput. Sci., 2023)

Component connectivity of augmented cubes. - Qifan Zhang; Shuming Zhou; Eddie Cheng 001 (Theor. Comput. Sci., 2023)

Component Fault Diagnosis and Fault Tolerance of Alternating Group Graphs. - Yanze Huang; Limei Lin; Eddie Cheng 001; Li Xu 002 (Comput. J., 2023)

On the g-extra connectivity of augmented cubes. - Eddie Cheng 001; László Lipták; Ke Qiu 001; Zhizhang Shen; Abhishek Vangipuram (Theor. Comput. Sci., 2023)

A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs. - Pingshan Li; Min Xu; Eddie Cheng 001 (Discret. Appl. Math., 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)

Realizability problem of distance-edge-monitoring numbers. - Zhen Ji; Yaping Mao; Eddie Cheng 001; Xiaoyan Zhang 001 (RAIRO Oper. Res., 2024)

Non-inclusive g-extra diagnosability of interconnection networks under PMC model. - Weixing Zheng 002; Shuming Zhou; Eddie Cheng 001; Qifan Zhang (Theor. Comput. Sci., 2024)

The Cyclic Diagnosability Of Hypercubes Under The PMC Model And The MM* Model. - Hong Zhang 044; Shuming Zhou; Eddie Cheng 001 (Comput. J., 2024)

A Commentary on the Progress of Big Data in Combinatorial Optimization. - Eddie Cheng 001; Longkun Guo; Yaping Mao; Xiaoyan Zhang 001 (Parallel Process. Lett., 2024)

Characterization of Cyclic Diagnosability of Regular Diagnosable Networks. - Hong Zhang 044; Shuming Zhou; Eddie Cheng 001; Sun-Yuan Hsieh (IEEE Trans. Reliab., 2024)

The t/s-Diagnosability and Diagnostic Strategy of Balanced Hypercube Under Two Classic Diagnostic Models. - Xiao-Qing Liu; Shuming Zhou; Eddie Cheng 001; Hong Zhang 044 (J. Comput. Sci. Technol., 2024)

Higher order matching preclusion for regular interconnection networks. - Eddie Cheng 001; László Lipták; Lucian Mazza (Discret. Appl. Math., 2025)

The distance-edge-monitoring numbers of subdivision graphs. - Zhen Ji; Zhiwei Guo; Eddie Cheng 001; Ralf Klasing; Yaping Mao (Discret. Appl. Math., 2025)

The cyclic diagnosability of Cayley graphs generated by transposition trees. - Weixing Zheng 002; Shuming Zhou; Eddie Cheng 001; Qifan Zhang (Discret. Appl. Math., 2025)

The (t,k)-diagnosability of Cayley graph generated by 2-tree. - Lulu Yang; Shuming Zhou; Eddie Cheng 001 (J. Parallel Distributed Comput., 2025)

Paired 2-disjoint path covers of balanced hypercube under the partitioned edge fault model. - Yifan Li; Shuming Zhou; Eddie Cheng 001 (J. Supercomput., 2025)

Conditional Fractional Matching Preclusion Number of Graphs. - Wen Li; Yuhu Liu; Yinkui Li; Eddie Cheng 001; Yaping Mao (Int. J. Found. Comput. Sci., 2025)