Leizhen Cai
- Computational Theory and Mathematics top 1%
- Computer Networks and Communications top 5%
- Discrete Mathematics and Combinatorics top 5%
- Geometry and Topology top 10%
- Artificial Intelligence
- Co-authors
- Derek G. CorneilXuding ZhuJohn EllisFrédéric MaffrayBoting YangWeifan WangBaruch SchieberJulian Keil
- Topics
- Advanced Graph Theory Research (25 papers)Graph Labeling and Dimension Problems (13 papers)Complexity and Algorithms in Graphs (9 papers)
In The Last Decade
Leizhen Cai
30 papers receiving 483 citations
Peers
Comparison fields: 5 of 38
- Computational Theory and Mathematics 474
- Computer Networks and Communications 170
- Discrete Mathematics and Combinatorics 98
- Geometry and Topology 55
- Artificial Intelligence 49
Countries citing papers authored by Leizhen Cai
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 5 | |
| 2 | 2 | |
| 3 | 14 | |
| 4 | 5 | |
| 5 | 35 | |
| 6 | 7 | |
| 7 | 2 | |
| 8 | 6 | |
| 9 | 2 | |
| 10 | 4 | |
| 11 | Visibility graphs of polygonal rings. | 1 |
| 12 | 2 | |
| 13 | 90 | |
| 14 | 38 | |
| 15 | 14 | |
| 16 | 3 | |
| 17 | 1 | |
| 18 | 2 | |
| 19 | Tree spanners: spanning trees that approximate distances | 22 |
| 20 | 27 |
About Leizhen Cai
Leizhen Cai is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 30 papers that have together received 535 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (25 papers), Graph Labeling and Dimension Problems (13 papers) and Complexity and Algorithms in Graphs (9 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (98 citations), Computational Theory and Mathematics (474 citations) and Computer Graphics and Computer-Aided Design (41 citations). Leizhen Cai has collaborated with scholars based in Hong Kong, Canada and China. Frequent 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. Their work appears in journals such as Theoretical Computer Science, Networks and Discrete Applied Mathematics.
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.