L
Professor profile
Leizhen Cai
The Chinese University of Hong Kong
· Computer Science
Design
FPT-algorithms
graph algorithms
3 vertices. My randomized algorithm for k-Vertex Cover
output N(M). Teaching: CSCI5320
Topics in Graph Algorithms
Random Separation
CSCI3160
About
Regular biography
Leizhen Cai is an Emeritus Professor in the Department of Computer Science and Engineering at The Chinese University of Hong Kong. His research focuses on FPT-algorithms, graph algorithms, and graph theory. Notably, he developed a randomized algorithm for k-Vertex Cover, where N(M) denotes the open neighborhood of marked vertices. He has taught various courses, including CSCI5320 Topics in Graph Algorithms and CSCI3160 Design and Analysis of Algorithms. His work includes significant contributions to parameterized complexity and algorithmic graph theory.