Mingyu Xiao

1.5k total citations
82 papers, 504 citations indexed

About

Mingyu Xiao is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Mingyu Xiao has authored 82 papers receiving a total of 504 indexed citations (citations by other indexed papers that have themselves been cited), including 52 papers in Computational Theory and Mathematics, 37 papers in Computer Networks and Communications and 16 papers in Artificial Intelligence. Recurrent topics in Mingyu Xiao's work include Advanced Graph Theory Research (41 papers), Complexity and Algorithms in Graphs (35 papers) and Optimization and Search Problems (12 papers). Mingyu Xiao is often cited by papers focused on Advanced Graph Theory Research (41 papers), Complexity and Algorithms in Graphs (35 papers) and Optimization and Search Problems (12 papers). Mingyu Xiao collaborates with scholars based in China, Japan and France. Mingyu Xiao's co-authors include Hiroshi Nagamochi, Yi Zhou, He Zhu, Ton Kloks, Yuanshun Dai, Jin Yan, Zhang-Hua Fu, Hanqiu Sun, Zhengren Wang and Sheung-Hung Poon and has published in prestigious journals such as Chemical Engineering Journal, European Journal of Operational Research and IEEE Transactions on Image Processing.

In The Last Decade

Mingyu Xiao

67 papers receiving 496 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Mingyu Xiao China	13	255	191	119	94	58	82	504
Ryuhei Uehara Japan	12	350 1.4×	141 0.7×	105 0.9×	52 0.6×	21 0.4×	112	564
Yuichi Asahiro Japan	8	137 0.5×	97 0.5×	82 0.7×	60 0.6×	68 1.2×	34	316
Michelangelo Grigni United States	13	302 1.2×	232 1.2×	142 1.2×	87 0.9×	13 0.2×	27	599
Ralf Klasing France	14	206 0.8×	462 2.4×	41 0.3×	27 0.3×	27 0.5×	73	618
Stéphane Pérennès France	12	239 0.9×	409 2.1×	69 0.6×	31 0.3×	19 0.3×	70	573
Yoichi Iwata Japan	11	127 0.5×	249 1.3×	97 0.8×	121 1.3×	79 1.4×	26	492
Pierre Fraigniaud France	19	265 1.0×	948 5.0×	125 1.1×	71 0.8×	35 0.6×	49	1.1k
Matthew Wilkes United Kingdom	4	83 0.3×	177 0.9×	234 2.0×	60 0.6×	11 0.2×	16	492
Rolf Wanka Germany	11	102 0.4×	157 0.8×	144 1.2×	42 0.4×	19 0.3×	33	361
Klaus Sutner United States	12	450 1.8×	109 0.6×	125 1.1×	42 0.4×	19 0.3×	39	565

Countries citing papers authored by Mingyu Xiao

Since Specialization

Citations

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

Fields of papers citing papers by Mingyu Xiao

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Mingyu Xiao

This figure shows the co-authorship network connecting the top 25 collaborators of Mingyu Xiao. A scholar is included among the top collaborators of Mingyu Xiao 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 Mingyu Xiao. Mingyu Xiao 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

1.

Khoussainov, Bakh, et al.. (2025). Network control games played on graphs. Theoretical Computer Science. 1034. 115123–115123.

2.

Xiao, Mingyu, et al.. (2025). A 5-approximation algorithm for the traveling tournament problem. Annals of Operations Research. 346(3). 2287–2305.

3.

Xiao, Mingyu, et al.. (2024). Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2. Mathematics of Operations Research. 50(2). 910–934. 1 indexed citations

4.

Xiao, Mingyu, et al.. (2024). A deterministic approximation algorithm for metric triangle packing. Theoretical Computer Science. 1010. 114699–114699.

5.

Zhou, Yi, et al.. (2024). Finding small feedback arc sets on large graphs. Computers & Operations Research. 169. 106724–106724.

6.

Xiao, Mingyu, et al.. (2023). A 5k-vertex kernel for 3-path vertex cover. Theoretical Computer Science. 959. 113872–113872.

7.

Wang, Zhengren, et al.. (2023). A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. 5648–5656. 5 indexed citations

8.

Xiao, Mingyu, et al.. (2023). The (3,3)-colorability of planar graphs without 4-cycles and 5-cycles. Discrete Mathematics. 346(4). 113306–113306. 3 indexed citations

9.

Cai, Zhiping, Mingyu Xiao, & Jiajia Zhang. (2023). Theoretical Computer Science. Communications in computer and information science.

10.

Rossi, André, et al.. (2023). A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem. Computers & Operations Research. 153. 106151–106151. 1 indexed citations

11.

Xiao, Mingyu, et al.. (2023). Fast Algorithms for SAT with Bounded Occurrences of Variables. 2004–2012.

12.

Xiao, Mingyu, et al.. (2023). Minimum-Weight Link-Disjoint Paths With a Bounded Number of Shared Nodes. IEEE Transactions on Network and Service Management. 20(3). 2598–2610. 1 indexed citations

13.

Xiao, Mingyu, et al.. (2020). Improved parameterized algorithms and kernels for mixed domination. Theoretical Computer Science. 815. 109–120.

14.

Xiao, Mingyu, et al.. (2020). Parameterized algorithms and kernels for almost induced matching. Theoretical Computer Science. 846. 103–113. 3 indexed citations

15.

Xiao, Mingyu & Frances Rosamond. (2018). Frontiers in Algorithmics. Theoretical Computer Science. 786. 1–1. 1 indexed citations

16.

Xiao, Mingyu, et al.. (2017). A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis. TeesRep (Teesside University). 919–925. 14 indexed citations

17.

Xiao, Mingyu & Hiroshi Nagamochi. (2017). Exact algorithms for maximum independent set. Information and Computation. 255. 126–146. 62 indexed citations

18.

Xiao, Mingyu & Huan Tan. (2017). Exact algorithms for Maximum Induced Matching. Information and Computation. 256. 196–211. 5 indexed citations

19.

Xiao, Mingyu, Ton Kloks, & Sheung-Hung Poon. (2012). New parameterized algorithms for the edge dominating set problem. Theoretical Computer Science. 511. 147–158. 16 indexed citations

20.

Xiao, Mingyu & Hiroshi Nagamochi. (2012). Parameterized edge dominating set in graphs with degree bounded by 3. Theoretical Computer Science. 508. 2–15. 4 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