Leizhen Cai

1.4k total citations
30 papers, 535 citations indexed

About

Leizhen Cai is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Leizhen Cai has authored 30 papers receiving a total of 535 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computational Theory and Mathematics, 8 papers in Computer Networks and Communications and 8 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Leizhen Cai's work include Advanced Graph Theory Research (25 papers), Graph Labeling and Dimension Problems (13 papers) and Complexity and Algorithms in Graphs (9 papers). Leizhen Cai is often cited by papers focused on Advanced Graph Theory Research (25 papers), Graph Labeling and Dimension Problems (13 papers) and Complexity and Algorithms in Graphs (9 papers). Leizhen Cai collaborates with scholars based in Hong Kong, Canada and China. Leizhen Cai's co-authors include Derek G. Corneil, Xuding Zhu, John Ellis, Frédéric Maffray, Boting Yang, Weifan Wang, Baruch Schieber, Julian Keil, Andrew Chi-Chih Yao and Mingyu Xiao and has published in prestigious journals such as Theoretical Computer Science, Networks and Discrete Applied Mathematics.

In The Last Decade

Leizhen Cai

30 papers receiving 483 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Leizhen Cai Hong Kong	12	474	170	98	55	49	30	535
Jan Arne Telle Norway	16	720 1.5×	343 2.0×	131 1.3×	82 1.5×	76 1.6×	69	864
Yngve Villanger Norway	17	604 1.3×	233 1.4×	81 0.8×	37 0.7×	97 2.0×	46	675
Celina M.H. de Figueiredo Brazil	14	589 1.2×	102 0.6×	201 2.1×	93 1.7×	52 1.1×	134	663
Igor Razgon Ireland	11	370 0.8×	141 0.8×	48 0.5×	23 0.4×	51 1.0×	24	424
Naomi Nishimura Canada	12	300 0.6×	180 1.1×	31 0.3×	23 0.4×	79 1.6×	34	385
Stephan Kreutzer Germany	15	489 1.0×	139 0.8×	79 0.8×	52 0.9×	155 3.2×	48	588
Kristina Vušković United Kingdom	15	577 1.2×	96 0.6×	246 2.5×	91 1.7×	31 0.6×	48	632
Sylvain Gravier France	14	374 0.8×	150 0.9×	109 1.1×	91 1.7×	126 2.6×	65	491
Jochen Alber Germany	11	373 0.8×	193 1.1×	22 0.2×	17 0.3×	74 1.5×	17	455
Rossella Petreschi Italy	11	264 0.6×	76 0.4×	33 0.3×	53 1.0×	33 0.7×	40	332

Countries citing papers authored by Leizhen Cai

Since Specialization

Citations

This map shows the geographic impact of Leizhen Cai's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Leizhen Cai with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Leizhen Cai more than expected).

Fields of papers citing papers by Leizhen Cai

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Leizhen Cai. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Leizhen Cai. The network helps show where Leizhen Cai may publish in the future.

Co-authorship network of co-authors of Leizhen Cai

This figure shows the co-authorship network connecting the top 25 collaborators of Leizhen Cai. A scholar is included among the top collaborators of Leizhen Cai based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Leizhen Cai. Leizhen Cai is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Cai, Leizhen, et al.. (2015). Obtaining split graphs by edge contraction. Theoretical Computer Science. 607. 60–67. 5 indexed citations

Cai, Leizhen, Siu-Wing Cheng, & Tak‐Wah Lam. (2013). Algorithms and Computation 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings. Rare & Special e-Zone (The Hong Kong University of Science and Technology). 2 indexed citations

Cai, Leizhen & Boting Yang. (2011). Parameterized complexity of even/odd subgraph problems. Journal of Discrete Algorithms. 9(3). 231–240. 14 indexed citations

Cai, Leizhen, Weifan Wang, & Xuding Zhu. (2009). Choosability of toroidal graphs without short cycles. Journal of Graph Theory. 65(1). 1–15. 6 indexed citations

Cai, Leizhen. (2003). The complexity of the locally connected spanning tree problem. Discrete Applied Mathematics. 131(1). 63–75. 5 indexed citations

Cai, Leizhen. (2003). Parameterized complexity of vertex colouring. Discrete Applied Mathematics. 127(3). 415–429. 35 indexed citations

Cai, Leizhen & Baruch Schieber. (1997). A linear-time algorithm for computing the intersection of all odd cycles in a graph. Discrete Applied Mathematics. 73(1). 27–34. 7 indexed citations

Cai, Leizhen & Derek G. Corneil. (1996). A generalization of perfect graphs— i -perfect graphs. Journal of Graph Theory. 23(1). 87–103. 6 indexed citations

Cai, Leizhen, Derek G. Corneil, & Andrzej Proskurowski. (1996). A generalization of line graphs: ( X, Y )-intersection graphs. Journal of Graph Theory. 21(3). 267–287. 2 indexed citations

10.

Cai, Leizhen, Derek G. Corneil, & Andrzej Proskurowski. (1996). A generalization of line graphs: (X, Y)-intersection graphs. Journal of Graph Theory. 21(3). 267–287. 2 indexed citations

11.

Cai, Leizhen & Derek G. Corneil. (1996). A generalization of perfect graphs?i-perfect graphs. Journal of Graph Theory. 23(1). 87–103. 4 indexed citations

12.

Cai, Leizhen, et al.. (1995). Visibility graphs of polygonal rings.. Canadian Conference on Computational Geometry. 157–161. 1 indexed citations

13.

Cai, Leizhen. (1995). Path decompositions of multigraphs. Journal of Graph Theory. 19(3). 297–307. 2 indexed citations

14.

Cai, Leizhen & Derek G. Corneil. (1995). Tree Spanners. SIAM Journal on Discrete Mathematics. 8(3). 359–387. 90 indexed citations

15.

Cai, Leizhen. (1994). NP-completeness of minimum spanner problems. Discrete Applied Mathematics. 48(2). 187–194. 38 indexed citations

16.

Cai, Leizhen & Frédéric Maffray. (1993). On the SPANNING k-TREE problem. Discrete Applied Mathematics. 44(1-3). 139–156. 14 indexed citations

17.

Cai, Leizhen & Julian Keil. (1993). DEGREE-BOUNDED SPANNERS. Parallel Processing Letters. 3(4). 457–468. 3 indexed citations

18.

Cai, Leizhen & Derek G. Corneil. (1992). On cycle double covers of line graphs. Discrete Mathematics. 102(1). 103–106. 1 indexed citations

19.

Cai, Leizhen & John Ellis. (1992). Edge colouring line graphs of unicyclic graphs. Discrete Applied Mathematics. 36(1). 75–82. 2 indexed citations

20.

Cai, Leizhen & John Ellis. (1991). NP-completeness of edge-colouring some restricted graphs. Discrete Applied Mathematics. 30(1). 15–27. 27 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact