Get started
Author

Qian‐Ping Gu

Observed names: GU Qian-Ping, Gu Qianping, Gu, Qian-Ping, QIAN-PING GU, Qian-Ping Gu, Qian-ping Gu, Qianping Gu
ORCID: 0009-0003-6242-3404
Observed ORCID: 0009-0003-6242-3404
OpenAlex ID: A5104064156
A 2-approximation algorithm for genome rearrangements by reversals and transpositions
1999 · Qian-Ping Gu, Shietung Peng, et al. · Theoretical Computer Science · 103
PDF
Optimal branch-decomposition of planar graphs in O ( n 3 ) Time
2008 · Qian-Ping Gu, Hisao Tamaki · ACM Transactions on Algorithms · 87
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size
2012 · Qian-Ping Gu, Hisao Tamaki · Algorithmica · 80
PDF
Node-to-set disjoint paths problem in star graphs
1997 · Qian-Ping Gu, Shietung Peng · Information Processing Letters · 58
Node-to-set and set-to-set cluster fault tolerant routing in hypercubes
1998 · Qian-Ping Gu, Shietung Peng · Parallel Computing · 48
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes
2000 · Qian-Ping Gu, Shietung Peng · Journal of Parallel and Distributed Computing · 43
Optimal Branch-Decomposition of Planar Graphs in O(n 3) Time
2005 · Qian-Ping Gu, Hisao Tamaki · Lecture notes in computer science · 38
Unicast in hypercubes with large number of faulty nodes
1999 · Qian-Ping Gu, Shietung Peng · IEEE Transactions on Parallel and Distributed Systems · 36
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths
1997 · Qian-Ping Gu, Hisao Tamaki · Journal of Parallel and Distributed Computing · 36
K-pairwise cluster fault tolerant routing in hypercubes
1997 · Qian-Ping Gu, Shietung Peng · IEEE Transactions on Computers · 36
Node-to-node cluster fault tolerant routing in star graphs
1995 · Qian-Ping Gu, Shietung Peng · Information Processing Letters · 25
An efficient algorithm for k-pairwise disjoint paths in star graphs
1998 · Qian-Ping Gu, Shietung Peng · Information Processing Letters · 24
Formal description and analysis of a distributed location service for mobile ad hoc networks
2004 · Uwe Glässer, Qian-Ping Gu · Theoretical Computer Science · 23
PDF
Multihop all-to-all broadcast on WDM optical networks
2003 · Qian-Ping Gu, Shietung Peng · IEEE Transactions on Parallel and Distributed Systems · 23
On optimizing the satisfiability (SAT) problem
1999 · Jun Gu, Qianping Gu, et al. · Journal of Computer Science and Technology · 23
Set-To-Set Fault Tolerant Routing in Star Graphs
1996 · Qian‐Ping Gu, Shietung Peng · IEICE Transactions on Information and Systems · 23
Multicasts on WDM All-Optical Butterfly Networks *
2002 · Xinchen Liu, Qian‐Ping Gu · Journal of information science and engineering · 21
Cluster fault-tolerant routing in star graphs
2000 · Qian-Ping Gu, Shietung Peng · Networks · 21
Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
2010 · Qianping Gu, Navid Imani · Lecture notes in computer science · 20
Algorithmic analysis for ridesharing of personal vehicles
2017 · Qian-Ping Gu, Jiajian Leo Liang, et al. · Theoretical Computer Science · 19
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size
2010 · Qian-Ping Gu, Hisao Tamaki · Lecture notes in computer science · 19
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time
2009 · Qian-Ping Gu, Hisao Tamaki · Lecture notes in computer science · 19
Atomos: Constant-Size Path Validation Proof
2020 · Anxiao He, Kai Bu, et al. · IEEE Transactions on Information Forensics and Security · 18
Computing Branch Decomposition of Large Planar Graphs
2008 · Zhengbing Bian, Qian-Ping Gu · Springer eBooks · 18
Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs
2008 · Zhengbing Bian, Qian-Ping Gu, et al. · Society for Industrial and Applied Mathematics eBooks · 17
Works count: 107
Citation count: 1,162
H-index: 19
I10-index: 34
Year
Topic
Type