Leizhen Cai

Computer Science

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.
Cai L, Ye J. (2019) Two edge-disjoint paths with length constraints Theoretical Computer Science. 795: 275-284
Cai L, Ye J. (2015) Parameterized complexity of finding connected induced subgraphs Theoretical Computer Science. 607: 49-59
Guo C, Cai L. (2015) Obtaining split graphs by edge contraction Theoretical Computer Science. 607: 60-67
Cai L, Cai Y. (2015) Incompressibility of $$H$$H-Free Edge Modification Problems Algorithmica. 71: 731-757
Cai L, Yang B. (2011) Parameterized complexity of even/odd subgraph problems Journal of Discrete Algorithms. 9: 231-240
Cai L, Cheng Y, Verbin E, et al. (2010) Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem Siam Journal On Discrete Mathematics. 24: 1322-1335
Xiao M, Cai L, Yao AC. (2009) Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem Algorithmica. 59: 510-520
Cai L. (2008) Parameterized complexity of cardinality constrained optimization problems Computer Journal. 51: 102-121
Wang W, Cai L. (2008) Labelling planar graphs without 4-cycles with a condition on distance two Discrete Applied Mathematics. 156: 2241-2249
Cai L. (2003) The complexity of the locally connected spanning tree problem Discrete Applied Mathematics. 131: 63-75