返回导师列表
CL
代表成果
- L. Cai, Vertex Covers Revisited: Indirect Certificates and FPT Algorithms, revision of arXiv:1807.11339, 2025.
- L. Cai and J. Ye, Two Edge-Disjoint Paths with Length Constraints, Theoretical Computer Science, Vol 795 275-284, 2019.
- L. Cai and Y. Cai, Incompressibility of H-Free Edge Modification Problems, Invited paper of IPEC 2013, Algorithmica 71(3) 731-757, 2015.
- M. Xiao, L. Cai, and A.C.C. Yao, Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem, Algorithmica Vol 59 510-520, 2011.
- L. Cai, Parameterized Complexity of Cardinality Constrained Optimization Problems, the Computer Journal 51(1) 102-121, 2008.
- L. Cai, S.M. Chan and S.O. Chan, Random Separation: a New Method for Solving Fixed-Cardinality Optimization Problems, IWPEC 2006, LNCS 4169, pp. 239-250, 2006.
- L. Cai, Parameterized Complexity of Vertex Colouring, Discrete Applied Mathematics, 127(3) 415-429, 2003.
- L. Cai, Fixed-parameter tractability of graph modification problems for hereditary properties, Information Processing Letters, 58, 171-176, 1996.
- L. Cai and D.G. Corneil, Tree Spanners, SIAM Journal on Discrete Mathematics, 8(3), 359-387, 1995.
数据校验于 9/6/2026数据来源