NP-completeness of edge-colouring some restricted graphs. - Leizhen Cai; John A. Ellis (Discret. Appl. Math., 1991)

Edge colouring line graphs of unicyclic graphs. - Leizhen Cai; John A. Ellis (Discret. Appl. Math., 1992)

On cycle double covers of line graphs. - Leizhen Cai; Derek G. Corneil (Discret. Math., 1992)

Tree spanners, spanning trees that approximate distances. - Leizhen Cai (1992)

On the SPANNING k-Tree Problem. - Leizhen Cai; Frédéric Maffray (Discret. Appl. Math., 1993)

The Recognition of Union Trees. - Leizhen Cai (Inf. Process. Lett., 1993)

Degree-Bounded Spanners. - Leizhen Cai; J. Mark Keil (Parallel Process. Lett., 1993)

NP-Completeness of Minimum Spanner Problems. - Leizhen Cai (Discret. Appl. Math., 1994)

Spanners in graphs of bounded degree. - Leizhen Cai; J. Mark Keil (Networks, 1994)

Spanning 2-Trees. - Leizhen Cai (ASIAN, 1995)

Visibility graphs of polygonal rings. - Leizhen Cai; Hazel Everett (CCCG, 1995)

Isomorphic Tree Spanner Problems. - Leizhen Cai; Derek G. Corneil (Algorithmica, 1995)

Path decompositions of multigraphs. - Leizhen Cai (J. Graph Theory, 1995)

Tree Spanners. - Leizhen Cai; Derek G. Corneil (SIAM J. Discret. Math., 1995)

Algorithms on Polygonal Embeddings of Graphs. - Leizhen Cai (CCCG, 1996)

Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties. - Leizhen Cai (Inf. Process. Lett., 1996)

A generalization of perfect graphs - i-perfect graphs. - Leizhen Cai; Derek G. Corneil (J. Graph Theory, 1996)

A generalization of line graphs: (X, Y)-intersection graphs. - Leizhen Cai; Derek G. Corneil; Andrzej Proskurowski (J. Graph Theory, 1996)

On Spanning 2-trees in a Graph. - Leizhen Cai (Discret. Appl. Math., 1997)

A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph. - Leizhen Cai; Baruch Schieber (Discret. Appl. Math., 1997)

Computing Visibility Information in an Inaccurate Simple Polygon. - Leizhen Cai; J. Mark Keil (Int. J. Comput. Geom. Appl., 1997)

Computing the Optimal Bridge Between Two Convex Polygons. - Leizhen Cai; Yin-Feng Xu; Binhai Zhu (Inf. Process. Lett., 1999)

Stable 2-pairs and (X, Y)-intersection graphs. - Leizhen Cai; Derek G. Corneil; Andrzej Proskurowski (Discret. Math., 2001)

Game chromatic index of k-degenerate graphs. - Leizhen Cai; Xuding Zhu (J. Graph Theory, 2001)

Parameterized Complexity of Vertex Colouring. - Leizhen Cai (Discret. Appl. Math., 2003)

The complexity of the locally connected spanning tree problem. - Leizhen Cai (Discret. Appl. Math., 2003)

Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems. - Leizhen Cai; Siu Man Chan; Siu On Chan (IWPEC, 2006)

Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. - Leizhen Cai; Elad Verbin; Lin Yang (ISAAC, 2008)

Parameterized Complexity of Cardinality Constrained Optimization Problems. - Leizhen Cai (Comput. J., 2008)

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem - Mingyu Xiao 001; Leizhen Cai; Andrew C. Yao (CoRR, 2008)

Labelling planar graphs without 4-cycles with a condition on distance two. - Weifan Wang 001; Leizhen Cai (Discret. Appl. Math., 2008)

The Surviving Rate of a Graph for the Firefighter Problem. - Leizhen Cai; Weifan Wang 001 (SIAM J. Discret. Math., 2009)

Choosability of toroidal graphs without short cycles. - Leizhen Cai; Weifan Wang 001; Xuding Zhu (J. Graph Theory, 2010)

Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem. - Leizhen Cai; Yongxi Cheng; Elad Verbin; Yuan Zhou 007 (SIAM J. Discret. Math., 2010)

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. - Mingyu Xiao 001; Leizhen Cai; Andrew Chi-Chih Yao (Algorithmica, 2011)

Parameterized complexity of even/odd subgraph problems. - Leizhen Cai; Boting Yang (J. Discrete Algorithms, 2011)

Incompressibility of H-Free Edge Modification. - Leizhen Cai; Yufei Cai (IPEC, 2013)

Contracting Few Edges to Remove Forbidden Induced Subgraphs. - Leizhen Cai; Chengwei Guo (IPEC, 2013)

Contracting Graphs to Split Graphs and Threshold Graphs. - Leizhen Cai; Chengwei Guo (CoRR, 2013)

Parameterized Complexity of Connected Induced Subgraph Problems. - Leizhen Cai; Junjie Ye (AAIM, 2014)

Dual Connectedness of Edge-Bicolored Graphs and Beyond. - Leizhen Cai; Junjie Ye (MFCS (2), 2014)

Incompressibility of H-Free Edge Modification Problems. - Leizhen Cai; Yufei Cai (Algorithmica, 2015)

Guest Editors Foreword. - Leizhen Cai; Siu-Wing Cheng; Tak Wah Lam (Algorithmica, 2015)

Parameterized complexity of finding connected induced subgraphs. - Leizhen Cai; Junjie Ye (Theor. Comput. Sci., 2015)

Obtaining split graphs by edge contraction. - Chengwei Guo; Leizhen Cai (Theor. Comput. Sci., 2015)

Finding Two Edge-Disjoint Paths with Length Constraints. - Leizhen Cai; Junjie Ye (WG, 2016)

Alternating Path and Coloured Clustering. - Leizhen Cai; On Yin Leung (CoRR, 2018)

Vertex Covers Revisited: Indirect Certificates and FPT Algorithms. - Leizhen Cai (CoRR, 2018)

Complexity of Vertex Switching on Edge-Bicolored Graphs. - Ho Lam Pang; Leizhen Cai (CIAC, 2019)

Two edge-disjoint paths with length constraints. - Leizhen Cai; Junjie Ye (Theor. Comput. Sci., 2019)