CAI, Leizhen, CUHK CS

CAI, Leizhen

Professor

Ph.D., University of Toronto, 1992

M.Sc., University of Victoria, 1988

B.Sc., Zhejiang University, 1982

Photo
Department of Computer Science and Engineering
The Chinese University of Hong Kong
Shatin, Hong Kong SAR, CHINA

Phone: (852)26098425
Fax: (852)26035024
Email: (username lcai) cse.cuhk.edu.hk


Research Interests

Graph algorithms, parameterized complexity, and graph theory.


Representative Work

  1. L. Cai, Parameterized Complexity of Cardinality Constrained Optimization Problems, to appear in the Computer Journal , 2007.

  2. L. Cai and W. Wang, The Surviving Rate of a Graph, manuscript, 2007.

  3. L. Cai, S.M. Chan and S.O. Chan, Random Separation: a New Method for Solving Fixed-Cardinality Optimization Problems, H.L. Bodlaender and M.A. Langston(Eds.): IWPEC 2006, LNCS 4169, pp. 239-250, 2006.

  4. L. Cai, Parameterized Complexity of Vertex Colouring, Discrete Applied Mathematics, 127(3) 415-429, 2003.

  5. L. Cai and X. Zhu, Game Chromatic Index of k-Degenerate Graphs, Journal of Graph Theory, 36(3) 144-155, 2001.

  6. L. Cai and J.M. Keil, Computing Visibility Information in an Inaccurate Simple Polygon, International Journal of Computational Geometry & Applications., 7(6) 515-537, 1997.

  7. L. Cai, D.G. Corneil, and A. Proskurowski, A Generalization of Line Graphs: (X,Y)-Intersection Graphs, Journal of Graph Theory, 21(3), 267-287, 1996.

  8. L. Cai and D.G. Corneil, Tree Spanners, SIAM Journal on Discrete Mathematics, 8(3), 359-387, 1995.

  9. L. Cai, Path Decompositions of Multigraphs, Journal of Graph Theory, 19(3), 297-307, 1995.