Leizhen Cai

发表

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem

Andrew Chi-Chih Yao, Mingyu Xiao, Leizhen Cai, 2009, Algorithmica.

Two edge-disjoint paths with length constraints

Leizhen Cai, Junjie Ye, 2019, Theor. Comput. Sci..

The Surviving Rate of a Graph for the Firefighter Problem

Leizhen Cai, Wei-Fan Wang, L. Cai, 2009, SIAM J. Discret. Math..

Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems

Leizhen Cai, Siu On Chan, Siu Man Chan, 2006, IWPEC.

Parameterized Complexity of Connected Induced Subgraph Problems

Leizhen Cai, Junjie Ye, L. Cai, 2014, AAIM.

Finding Two Edge-Disjoint Paths with Length Constraints

Leizhen Cai, Junjie Ye, 2016, WG.

On Spanning 2-trees in a Graph

Leizhen Cai, L. Cai, 1997, Discret. Appl. Math..

Isomorphic tree spanner problems

Leizhen Cai, Derek G. Corneil, 2005, Algorithmica.

Incompressibility of $$H$$H-Free Edge Modification Problems

Leizhen Cai, Yufei Cai, 2014, Algorithmica.

Spanners in graphs of bounded degree

Leizhen Cai, J. Mark Keil, J. Keil, 1994, Networks.

Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings

Leizhen Cai, Siu-Wing Cheng, Tak-Wah Lam, 2013 .

Parameterized Complexity of Vertex Colouring

Leizhen Cai, L. Cai, 2003, Discret. Appl. Math..

Choosability of toroidal graphs without short cycles

Xuding Zhu, Leizhen Cai, Wei-Fan Wang, 2010, J. Graph Theory.

Alternating Path and Coloured Clustering pdf

Leizhen Cai, On Yin Leung, L. Cai, 2018, ArXiv.

Complexity of Vertex Switching on Edge-Bicolored Graphs

Leizhen Cai, Ho Lam Pang, 2019, CIAC.

Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties

Leizhen Cai, L. Cai, 1996, Inf. Process. Lett..

Incompressibility of H-Free Edge Modification

Leizhen Cai, Yufei Cai, L. Cai, 2013, IPEC.

Spanning 2-Trees

Leizhen Cai, 1995, ASIAN.

Edge colouring line graphs of unicyclic graphs

Leizhen Cai, John A. Ellis, L. Cai, 1992, Discret. Appl. Math..

Tree Spanners

Leizhen Cai, Derek G. Corneil, D. Corneil, 1995, SIAM J. Discret. Math..

Parameterized complexity of even/odd subgraph problems

Boting Yang, Leizhen Cai, 2011, J. Discrete Algorithms.

Stable 2-pairs and (X, Y)-intersection graphs

Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski, 2001, Discret. Math..

Game chromatic index of k-degenerate graphs

Xuding Zhu, Leizhen Cai, 2001, J. Graph Theory.

The complexity of the locally connected spanning tree problem

Leizhen Cai, L. Cai, 2003, Discret. Appl. Math..

Parameterized Complexity of Cardinality Constrained Optimization Problems

Leizhen Cai, L. Cai, 2008, Comput. J..

Parameterized complexity of finding connected induced subgraphs

Leizhen Cai, Junjie Ye, L. Cai, 2015, Theor. Comput. Sci..

Algorithms on Polygonal Embeddings of Graphs

Leizhen Cai, 1996, CCCG.

Guest Editors Foreword

Leizhen Cai, Tak Wah Lam, Siu-Wing Cheng, 2015, Algorithmica.

Contracting Graphs to Split Graphs and Threshold Graphs pdf

Leizhen Cai, Chengwei Guo, 2013, ArXiv.

Contracting Few Edges to Remove Forbidden Induced Subgraphs

Leizhen Cai, Chengwei Guo, 2013, IPEC.

Labelling planar graphs without 4-cycles with a condition on distance two

Leizhen Cai, Wei-Fan Wang, 2008, Discret. Appl. Math..

Visibility graphs of polygonal rings

Hazel Everett, Leizhen Cai, 1995, CCCG.

Computing the Optimal Bridge Between Two Convex Polygons

Yin-Feng Xu, Leizhen Cai, Binhai Zhu, 1999, Inf. Process. Lett..

The Recognition of Union Trees

Leizhen Cai, 1993, Inf. Process. Lett..

Parameterized Complexity of Even/Odd Subgraph Problems

Boting Yang, Leizhen Cai, 2010, CIAC.

Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm

Lin Yang, Leizhen Cai, Elad Verbin, 2008, ISAAC.

Obtaining split graphs by edge contraction

Leizhen Cai, Chengwei Guo, 2015, Theor. Comput. Sci..

Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem

Yuan Zhou, Leizhen Cai, Elad Verbin, 2010, SIAM J. Discret. Math..

Path decompositions of multigraphs

Leizhen Cai, 1995, J. Graph Theory.

On cycle double covers of line graphs

Leizhen Cai, Derek G. Corneil, 1992, Discret. Math..

Vertex Covers Revisited: Indirect Certificates and FPT Algorithms pdf

Leizhen Cai, 2018, ArXiv.

NP-Completeness of Minimum Spanner Problems

Leizhen Cai, L. Cai, 1994, Discret. Appl. Math..

Obtaining Split Graphs by Edge Contraction

Leizhen Cai, Chengwei Guo, 2014, AAIM.

On the SPANNING k-Tree Problem

Leizhen Cai, Frédéric Maffray, L. Cai, 1993, Discret. Appl. Math..

Computing Visibility Information in an Inaccurate Simple Polygon

Leizhen Cai, J. Mark Keil, 1997, Int. J. Comput. Geom. Appl..

A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph

Baruch Schieber, Leizhen Cai, B. Schieber, 1997, Discret. Appl. Math..

NP-completeness of edge-colouring some restricted graphs

Leizhen Cai, John A. Ellis, L. Cai, 1991, Discret. Appl. Math..

A generalization of perfect graphs - i-perfect graphs

Leizhen Cai, Derek G. Corneil, D. Corneil, 1996, J. Graph Theory.

A generalization of line graphs: (X, Y)-intersection graphs

Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski, 1996, J. Graph Theory.

Dual Connectedness of Edge-Bicolored Graphs and Beyond

Leizhen Cai, Junjie Ye, 2014, MFCS.

Intersection Graphs

Leizhen Cai, L. Cai, 2003 .

Choosability of toroidal graphs without short cycles

Xuding Zhu, Leizhen Cai, Weifan Wang, 2010 .

A generalization of perfect graphs— i -perfect graphs

Leizhen Cai, Derek G. Corneil, D. Corneil, 1996 .

Surviving rates of trees and outerplanar graphs for the firefighter problem

Leizhen Cai, Elad Verbin, Yongxi Cheng, 2009 .

Game chromatic index of k-degenerate graphs

Xuding Zhu, Leizhen Cai, 2001 .

A generalization of line graphs: ( X, Y )-intersection graphs

Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski, 1996 .