Mao-cheng Cai

436 total citations
36 papers, 263 citations indexed

About

Mao-cheng Cai is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Mao-cheng Cai has authored 36 papers receiving a total of 263 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computational Theory and Mathematics, 14 papers in Discrete Mathematics and Combinatorics and 8 papers in Geometry and Topology. Recurrent topics in Mao-cheng Cai's work include Advanced Graph Theory Research (22 papers), Limits and Structures in Graph Theory (11 papers) and Complexity and Algorithms in Graphs (10 papers). Mao-cheng Cai is often cited by papers focused on Advanced Graph Theory Research (22 papers), Limits and Structures in Graph Theory (11 papers) and Complexity and Algorithms in Graphs (10 papers). Mao-cheng Cai collaborates with scholars based in China, Hong Kong and Taiwan. Mao-cheng Cai's co-authors include Xiaotie Deng, Yanjun Li, Wenan Zang, Yanjun Li, Xiaoguang Yang, Qizhi Fang, Jianzhong Zhang, C.W. Duin, Odile Favaron and Yanjun Li and has published in prestigious journals such as European Journal of Operational Research, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Mao-cheng Cai

31 papers receiving 244 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Mao-cheng Cai China	10	191	60	58	57	54	36	263
C. Berge France	9	218 1.1×	65 1.1×	64 1.1×	66 1.2×	29 0.5×	13	278
Wenan Zang Hong Kong	12	339 1.8×	87 1.4×	167 2.9×	82 1.4×	86 1.6×	56	415
Erfang Shan China	12	428 2.2×	116 1.9×	86 1.5×	83 1.5×	137 2.5×	114	544
A. V. Karzanov Russia	7	143 0.7×	21 0.3×	31 0.5×	12 0.2×	68 1.3×	19	213
John H. Lindsey United States	10	78 0.4×	91 1.5×	145 2.5×	66 1.2×	22 0.4×	26	307
Csilla Bujtás Hungary	13	408 2.1×	64 1.1×	186 3.2×	127 2.2×	79 1.5×	72	492
Bill Sands Canada	11	308 1.6×	111 1.9×	133 2.3×	56 1.0×	16 0.3×	43	380
Ignasi Sau France	9	222 1.2×	20 0.3×	65 1.1×	49 0.9×	87 1.6×	77	294
Neeldhara Misra India	10	211 1.1×	9 0.1×	31 0.5×	19 0.3×	71 1.3×	38	268
Rajiv Raman United States	8	105 0.5×	7 0.1×	28 0.5×	16 0.3×	48 0.9×	25	160

Countries citing papers authored by Mao-cheng Cai

Since Specialization

Citations

This map shows the geographic impact of Mao-cheng 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 Mao-cheng Cai with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mao-cheng Cai more than expected).

Fields of papers citing papers by Mao-cheng Cai

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Mao-cheng 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 Mao-cheng Cai. The network helps show where Mao-cheng Cai may publish in the future.

Co-authorship network of co-authors of Mao-cheng Cai

This figure shows the co-authorship network connecting the top 25 collaborators of Mao-cheng Cai. A scholar is included among the top collaborators of Mao-cheng 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 Mao-cheng Cai. Mao-cheng 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, Mao-cheng & Liying Kang. (2018). A Characterization of Box-bounded Degree Sequences of Graphs. Graphs and Combinatorics. 34(4). 599–606.

Brandenburg, Franz J. & Mao-cheng Cai. (2010). Shortest path and maximum flow problems in networks with additive losses and gains. Theoretical Computer Science. 412(4-5). 391–401. 1 indexed citations

Cai, Mao-cheng, C.W. Duin, Xiaoguang Yang, & Jianzhong Zhang. (2007). The partial inverse minimum spanning tree problem when weight increase is forbidden. European Journal of Operational Research. 188(2). 348–353. 18 indexed citations

Cai, Mao-cheng, Xiaotie Deng, & Zhongfei Li. (2006). Computation of arbitrage in frictional bond markets. Theoretical Computer Science. 363(3). 248–256. 1 indexed citations

Fang, Qizhi, Mao-cheng Cai, & Xiaotie Deng. (2003). Total balancedness condition for Steiner tree games. Discrete Applied Mathematics. 127(3). 555–563. 1 indexed citations

Cai, Mao-cheng, Xiaotie Deng, & Lusheng Wang. (2003). Approximate sequencing for variable length tasks. Theoretical Computer Science. 290(3). 2037–2044. 1 indexed citations

Cai, Mao-cheng, Xiaotie Deng, & Wenan Zang. (2002). A Min-Max Theorem on Feedback Vertex Sets. Mathematics of Operations Research. 27(2). 361–371.

Fang, Qizhi, et al.. (2002). On computational complexity of membership test in flow games and linear production games. International Journal of Game Theory. 31(1). 39–45. 20 indexed citations

Yang, Xiaoguang, Shuo Tao, Rongjun Liu, & Mao-cheng Cai. (2002). COMPLEXITY OF SCENARIO-BASED PORTFOLIO OPTIMIZATION PROBLEM WITH VaR OBJECTIVE. International Journal of Foundations of Computer Science. 13(5). 671–679. 3 indexed citations

10.

Fang, Qizhi & Mao-cheng Cai. (2001). Some results on universal minimal total dominating functions. Acta Mathematicae Applicatae Sinica English Series. 17(2). 165–172. 1 indexed citations

11.

Cai, Mao-cheng, Xiaotie Deng, & Wenan Zang. (2000). Solution to a problem on degree sequences of graphs. Discrete Mathematics. 219(1-3). 253–257. 6 indexed citations

12.

Cai, Mao-cheng, Xiaoguang Yang, & Yanjun Li. (1999). Inverse Polymatroidal Flow Problem. Journal of Combinatorial Optimization. 3(1). 115–126. 9 indexed citations

13.

Cai, Mao-cheng. (1999). Inverse Problems of Matroid Intersection. Journal of Combinatorial Optimization. 3(4). 465–474. 9 indexed citations

14.

Li, Yanjun & Mao-cheng Cai. (1998). A degree condition for a graph to have [ a, b ]-factors. Journal of Graph Theory. 27(1). 1–6. 18 indexed citations

15.

Cai, Mao-cheng & Yanjun Li. (1997). Inverse Matroid Intersection Problem. Mathematical Methods of Operations Research. 45(2). 235–243. 23 indexed citations

16.

Cai, Mao-cheng. (1994). An algorithm for an Eulerian trail traversing specified edges in given order. Discrete Applied Mathematics. 55(3). 233–239. 2 indexed citations

17.

Cai, Mao-cheng. (1990). Restricted covering of digraphs with arborescences. Discrete Mathematics. 82(2). 143–152.

18.

Cai, Mao-cheng. (1989). Common root functions of two digraphs. Journal of Graph Theory. 13(2). 249–256. 1 indexed citations

19.

Cai, Mao-cheng. (1982). A new bound on the length of the shortest string containing all r-permutations. Discrete Mathematics. 39(3). 329–330. 3 indexed citations

20.

Cai, Mao-cheng. (1982). Minimally k-connected graphs of low order and maximal size. Discrete Mathematics. 41(3). 229–234. 7 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