Qian‐Ping Gu

1.1k total citations
60 papers, 533 citations indexed

About

Qian‐Ping Gu is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Qian‐Ping Gu has authored 60 papers receiving a total of 533 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Computer Networks and Communications, 31 papers in Computational Theory and Mathematics and 22 papers in Electrical and Electronic Engineering. Recurrent topics in Qian‐Ping Gu's work include Interconnection Networks and Systems (31 papers), Advanced Graph Theory Research (31 papers) and Advanced Optical Network Technologies (18 papers). Qian‐Ping Gu is often cited by papers focused on Interconnection Networks and Systems (31 papers), Advanced Graph Theory Research (31 papers) and Advanced Optical Network Technologies (18 papers). Qian‐Ping Gu collaborates with scholars based in Canada, Japan and China. Qian‐Ping Gu's co-authors include Shietung Peng, Hisao Tamaki, Hal Sudborough, Jun Gu, Yong Wang, Ding‐Zhu Du, Uwe Glässer, Yong Wang, Xinchen Liu and Zhengbing Bian and has published in prestigious journals such as Information Sciences, IEEE Transactions on Computers and Computers & Operations Research.

In The Last Decade

Qian‐Ping Gu

54 papers receiving 507 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Qian‐Ping Gu Canada 13 338 233 194 78 58 60 533
Shietung Peng Japan 16 597 1.8× 336 1.4× 167 0.9× 78 1.0× 48 0.8× 80 736
Balakrishnan Krishnamurthy United States 10 592 1.8× 403 1.7× 311 1.6× 28 0.4× 87 1.5× 16 870
Jaroslav Opatrný Canada 11 259 0.8× 142 0.6× 139 0.7× 10 0.1× 49 0.8× 43 368
Arkady Kanevsky United States 16 489 1.4× 68 0.3× 152 0.8× 18 0.2× 67 1.2× 44 617
Jung-Heum Park South Korea 18 840 2.5× 467 2.0× 588 3.0× 12 0.2× 20 0.3× 56 928
Jianghua Zhong China 10 90 0.3× 78 0.3× 45 0.2× 7 0.1× 80 1.4× 31 316
Chun‐Nan Hung Taiwan 9 243 0.7× 99 0.4× 125 0.6× 8 0.1× 21 0.4× 26 299
Jean‐Frédéric Myoupo France 11 176 0.5× 51 0.2× 46 0.2× 11 0.1× 91 1.6× 47 268
Petr Kolman Czechia 12 117 0.3× 25 0.1× 173 0.9× 49 0.6× 79 1.4× 35 298
Jason D. Bakos United States 11 152 0.4× 130 0.6× 87 0.4× 24 0.3× 132 2.3× 64 484

Countries citing papers authored by Qian‐Ping Gu

Since Specialization
Citations

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

Fields of papers citing papers by Qian‐Ping Gu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Qian‐Ping Gu

This figure shows the co-authorship network connecting the top 25 collaborators of Qian‐Ping Gu. A scholar is included among the top collaborators of Qian‐Ping Gu 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 Qian‐Ping Gu. Qian‐Ping Gu 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.
Gu, Qian‐Ping, et al.. (2024). Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles. Computers & Operations Research. 164. 106529–106529. 4 indexed citations
2.
Bu, Kai, et al.. (2023). SwiftParade: Anti-Burst Multipath Validation. IEEE Transactions on Dependable and Secure Computing. 21(4). 2720–2734.
3.
Bu, Kai, et al.. (2020). Atomos: Constant-Size Path Validation Proof. IEEE Transactions on Information Forensics and Security. 15. 3832–3847. 9 indexed citations
4.
Bian, Zhengbing, Qian‐Ping Gu, & Mingzhe Zhu. (2015). Practical algorithms for branch-decompositions of planar graphs. Discrete Applied Mathematics. 199. 156–171. 1 indexed citations
5.
Gu, Qian‐Ping & Hisao Tamaki. (2012). Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. Algorithmica. 64(3). 416–453. 11 indexed citations
6.
Bian, Zhengbing, Qian‐Ping Gu, & Xiao Zhou. (2008). Efficient algorithms for wavelength assignment on trees of rings. Discrete Applied Mathematics. 157(5). 875–889. 1 indexed citations
7.
Wang, Yong & Qian‐Ping Gu. (2008). Maximum throughput traffic grooming in optical networks. Journal of Optical Networking. 7(10). 895–895. 2 indexed citations
8.
Bian, Zhengbing & Qian‐Ping Gu. (2008). 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings. Information Processing Letters. 109(8). 400–404. 1 indexed citations
9.
Wang, Yong & Qian‐Ping Gu. (2007). A Min-Max Optimization Problem on Traffic Grooming in WDM Optical Networks. 1. 228–233. 1 indexed citations
10.
Bian, Zhengbing, et al.. (2004). Wavelength assignment on bounded degree trees of rings. 73–80. 3 indexed citations
11.
Glässer, Uwe & Qian‐Ping Gu. (2004). Formal description and analysis of a distributed location service for mobile ad hoc networks. Theoretical Computer Science. 336(2-3). 285–309. 11 indexed citations
12.
Liu, Xinchen & Qian‐Ping Gu. (2002). Multicasts on WDM All-Optical Butterfly Networks *. Journal of information science and engineering. 18. 1049–1058. 10 indexed citations
13.
Gu, Qian‐Ping & Hisao Tamaki. (2000). Multicolor routing in the undirected hypercube. Discrete Applied Mathematics. 100(3). 169–181. 4 indexed citations
14.
Gu, Qian‐Ping & Shietung Peng. (2000). An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. Journal of Parallel and Distributed Computing. 60(6). 764–774. 36 indexed citations
15.
Gu, Qian‐Ping, Shietung Peng, & Hal Sudborough. (1999). A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theoretical Computer Science. 210(2). 327–339. 62 indexed citations
16.
Gu, Qian‐Ping, Kazuyuki Iwata, Shietung Peng, & Qiming Chen. (1997). A Heuristic Algorithm for Genome Rearrangements. Proceedings Genome Informatics Workshop/Genome informatics. 8. 268–269. 5 indexed citations
17.
Gu, Qian‐Ping & Shietung Peng. (1996). Set-To-Set Fault Tolerant Routing in Star Graphs. IEICE Transactions on Information and Systems. 79(4). 282–289. 16 indexed citations
18.
Gu, Qian‐Ping, Shietung Peng, & Hal Sudborough. (1996). Approximation Algorithms for Genome Rearrangements. Proceedings Genome Informatics Workshop/Genome informatics. 7. 13–22. 2 indexed citations
19.
Gu, Qian‐Ping, Satoshi Okawa, & Shietung Peng. (1994). Efficient Algorithms for Node Disjoint Path Problems. 1994. 425–426. 2 indexed citations
20.
Gu, Qian‐Ping & Shietung Peng. (1994). Fault Tolerant Routing in Toroidal Networks. 94(258). 65–74. 1 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