Sperner systems containing at most k sets of every cardinality. - László Lipták (Discret. Math., 1997)

Facets with fixed defect of the stable set polytope. - László Lipták; László Lovász 001 (Math. Program., 2000)

Critical Facets of the Stable Set Polytope. - László Lipták; László Lovász 001 (Comb., 2001)

The stable set problem and the lift-and-project ranks of graphs. - László Lipták; Levent Tunçel (Math. Program., 2003)

Lift-and-project ranks and antiblocker duality. - László Lipták; Levent Tunçel (Oper. Res. Lett., 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)

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)

Matching preclusion for the (n, k)-bubble-sort graphs. - Eddie Cheng 001; László Lipták; David Sherman (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)

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 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)

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)

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

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)

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)

Diagnosability of Cayley graphs generated by transposition trees with missing edges. - Eddie Cheng 001; László Lipták (Inf. Sci., 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)

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

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)

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)

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 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)

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)

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)

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)

Connectivity Properties of Generalized K4-Hypercubes. - Joshua Brudnak; László Lipták (J. Interconnect. Networks, 2021)

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)

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)

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)

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