Ge Xia

2.2k total citations
61 papers, 851 citations indexed

About

Ge Xia is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications. According to data from OpenAlex, Ge Xia has authored 61 papers receiving a total of 851 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computational Theory and Mathematics, 17 papers in Computer Graphics and Computer-Aided Design and 16 papers in Computer Networks and Communications. Recurrent topics in Ge Xia's work include Advanced Graph Theory Research (29 papers), Complexity and Algorithms in Graphs (23 papers) and Computational Geometry and Mesh Generation (17 papers). Ge Xia is often cited by papers focused on Advanced Graph Theory Research (29 papers), Complexity and Algorithms in Graphs (23 papers) and Computational Geometry and Mesh Generation (17 papers). Ge Xia collaborates with scholars based in United States, China and Australia. Ge Xia's co-authors include Iyad Kanj, Jianer Chen, Xiuzhen Huang, Michael R. Fellows, Benny Chor, Henning Fernau, David Juedes, Jianfeng Song, Qiguang Miao and Ying Cao and has published in prestigious journals such as IEEE Transactions on Neural Networks and Learning Systems, BMC Genomics and Materials.

In The Last Decade

Ge Xia

56 papers receiving 811 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Ge Xia United States 13 518 261 149 123 92 61 851
Ryuhei Uehara Japan 12 350 0.7× 141 0.5× 105 0.7× 92 0.7× 62 0.7× 112 564
Andrzej Lingas Sweden 17 347 0.7× 227 0.9× 162 1.1× 266 2.2× 83 0.9× 122 827
Yijie Han United States 16 291 0.6× 341 1.3× 183 1.2× 159 1.3× 55 0.6× 63 741
Stephen Alstrup Denmark 14 300 0.6× 194 0.7× 281 1.9× 65 0.5× 50 0.5× 43 604
Jyrki Katajainen Denmark 14 204 0.4× 181 0.7× 284 1.9× 145 1.2× 59 0.6× 60 678
Henning Fernau Germany 18 1.0k 1.9× 354 1.4× 394 2.6× 65 0.5× 292 3.2× 190 1.3k
Meena Mahajan India 11 344 0.7× 149 0.6× 196 1.3× 24 0.2× 33 0.4× 67 546
Moshe Lewenstein Israel 19 494 1.0× 188 0.7× 604 4.1× 41 0.3× 350 3.8× 64 1.0k
Sairam Subramanian United States 11 350 0.7× 284 1.1× 156 1.0× 171 1.4× 356 3.9× 16 975
Fǎnicǎ Gavril Israel 17 1.2k 2.4× 575 2.2× 121 0.8× 138 1.1× 62 0.7× 35 1.5k

Countries citing papers authored by Ge Xia

Since Specialization
Citations

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

Fields of papers citing papers by Ge Xia

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ge Xia

This figure shows the co-authorship network connecting the top 25 collaborators of Ge Xia. A scholar is included among the top collaborators of Ge Xia 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 Ge Xia. Ge Xia is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kanj, Iyad, Dimitrios M. Thilikos, & Ge Xia. (2017). On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Information and Computation. 257. 139–156. 3 indexed citations
2.
Jiang, Minghui, Ge Xia, & Yong Zhang. (2016). Edge-disjoint packing of stars and cycles. Theoretical Computer Science. 640. 61–69. 3 indexed citations
3.
Kanj, Iyad, Guohui Lin, Tian Liu, et al.. (2015). Improved parameterized and exact algorithms for cut problems on trees. Theoretical Computer Science. 607. 455–470. 1 indexed citations
4.
Chen, Jianer, Iyad Kanj, Jie Meng, Ge Xia, & Fenghui Zhang. (2012). Parameterized top-Kalgorithms. Theoretical Computer Science. 470. 105–119. 2 indexed citations
5.
Xia, Ge & Yong Zhang. (2012). Kernelization for cycle transversal problems. Discrete Applied Mathematics. 160(7-8). 1224–1231. 5 indexed citations
6.
Xia, Ge, et al.. (2011). Toward the tight bound of the stretch factor of Delaunay triangulations. Canadian Conference on Computational Geometry. 9 indexed citations
7.
Kanj, Iyad & Ge Xia. (2011). Improved local algorithms for spanner construction. Theoretical Computer Science. 453. 54–64. 2 indexed citations
8.
Xia, Ge & Yong Zhang. (2011). On the small cycle transversal of planar graphs. Theoretical Computer Science. 412(29). 3501–3509. 7 indexed citations
9.
Cui, Shiliang, Iyad Kanj, & Ge Xia. (2010). On the stretch factor of Delaunay triangulations of points in convex position. Computational Geometry. 44(2). 104–109. 6 indexed citations
10.
Chen, Jianer, Iyad Kanj, & Ge Xia. (2010). Improved upper bounds for vertex cover. Theoretical Computer Science. 411(40-42). 3736–3756. 142 indexed citations
11.
Kanj, Iyad, Michael J. Pelsmajer, Marcus Schaefer, & Ge Xia. (2010). On the induced matching problem. Journal of Computer and System Sciences. 77(6). 1058–1070. 19 indexed citations
12.
Cui, Shiliang, Iyad Kanj, & Ge Xia. (2009). On the Dilation of Delaunay Triangulations of Points in Convex Position. Canadian Conference on Computational Geometry. 161–164. 4 indexed citations
13.
Kanj, Iyad, Luay Nakhleh, Cuong Than, & Ge Xia. (2008). Seeing the trees and their branches in the network is hard. Theoretical Computer Science. 401(1-3). 153–164. 40 indexed citations
14.
Chen, Jianer, et al.. (2008). On the pseudo-achromatic number problem. Theoretical Computer Science. 410(8-10). 818–829. 1 indexed citations
15.
Chen, Xiaogang, Dexiu Huang, Xiuhua Yuan, & Ge Xia. (2006). 2*40 Gb/s OCDM using superstructure fiber Bragg gratings en/decoder. Chinese Optics Letters. 4(2). 69–71. 1 indexed citations
16.
Chen, Jianer, Xiuzhen Huang, Iyad Kanj, & Ge Xia. (2006). Polynomial time approximation schemes and parameterized complexity. Discrete Applied Mathematics. 155(2). 180–193. 8 indexed citations
17.
Chen, Jianer, Xiuzhen Huang, Iyad Kanj, & Ge Xia. (2006). Strong computational lower bounds via parameterized complexity. Journal of Computer and System Sciences. 72(8). 1346–1367. 104 indexed citations
18.
Chen, Jianer, Iyad Kanj, Ljubomir Perković, Eric Sedgwick, & Ge Xia. (2006). Genus characterizes the complexity of certain graph problems: Some tight results. Journal of Computer and System Sciences. 73(6). 892–907. 7 indexed citations
19.
Chen, Jianer, Benny Chor, Michael R. Fellows, et al.. (2005). Tight lower bounds for certain parameterized NP-hard problems. Information and Computation. 201(2). 216–231. 73 indexed citations
20.
Chen, Jeson, Benny Chor, Michael R. Fellows, et al.. (2004). Tight lower bounds for certain parameterized NP-hard problems. 150–160. 24 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

Rankless by CCL
2026