Leizhen Cai

Papers

Total Citations

H-Index

About

Leizhen Cai is a leading figure in theoretical computer science, whose work has fundamentally shaped our understanding of computational complexity in graph theory. His research centers on the intersection of graph algorithms, combinatorial optimization, and computational complexity, with a particular focus on the parameterized complexity of hard problems. Cai’s most celebrated contribution is his landmark 1994 paper, "NP-completeness of minimum spanner problems," which has garnered 78 citations and established the foundational complexity results for a class of network design problems. This work demonstrated that finding sparse subgraphs that preserve distances—known as spanners—is computationally intractable in many natural settings, a result that has influenced decades of subsequent research in network theory and distributed computing. Beyond this seminal paper, Cai has made lasting contributions to parameterized complexity, including the development of the Cai-Fürer-Immerman theorem, which links graph isomorphism to logic. His research continues to inspire students and researchers working on the boundaries of what computers can efficiently solve.