A sharper analysis of a parallel algorithm for the all pairs shortest path problem. - Qian-Ping Gu; Tadao Takaoka (Parallel Comput., 1990)

Learning boolean functions. - Qian-Ping Gu; Akira Maruoka (Syst. Comput. Jpn., 1991)

Amplification of Bounded Depth Monotone Read-Once Boolean Formulae. - Qian-Ping Gu; Akira Maruoka (SIAM J. Comput., 1991)

Learning Monotone Boolean Functions by Uniformly Distributed Examples. - Qian-Ping Gu; Akira Maruoka (SIAM J. Comput., 1992)

Algorithms for Node Disjoint Paths in Incomplete Star Networks. - Qian-Ping Gu; Shietung Peng (ICPADS, 1994)

Average Time Complexity of the SAT 1.2 Algorithm. - Jun Gu; Qian-Ping Gu (ISAAC, 1994)

Advanced fault tolerant routing in hypercubes. - Qian-Ping Gu; Shietung Peng (ISPAN, 1994)

Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer. - Qian-Ping Gu; Jun Gu (IEEE Trans. Parallel Distributed Syst., 1994)

Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters. - Qian-Ping Gu; Shietung Peng (Parallel and Distributed Computing and Systems, 1995)

An efficient algorithm for k-pairwise node disjoint path problem in hypercubes. - Qian-Ping Gu; Shietung Peng (SPDP, 1995)

Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs. - Qian-Ping Gu; Shietung Peng (IEICE Trans. Inf. Syst., 1995)

Node-to-Node Cluster Fault Tolerant Routing in Star Graphs. - Qian-Ping Gu; Shietung Peng (Inf. Process. Lett., 1995)

Two Packet Routing Algorithms on a Mesh-Connected Computer. - Qian-Ping Gu; Jun Gu (IEEE Trans. Parallel Distributed Syst., 1995)

An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. - Qian-Ping Gu; Shietung Peng (ICPADS, 1996)

Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes. - Qian-Ping Gu; Shietung Peng (Comput. J., 1996)

An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters. - Qian-Ping Gu; Shietung Peng (Comput. J., 1996)

Fault Tolerant Routing in Hypercubes and Star Graphs. - Qian-Ping Gu; Shietung Peng (Parallel Process. Lett., 1996)

Convergence Properties of Optimization Algorithms for the SAT Problem. - Jun Gu; Qian-Ping Gu; Ding-Zhu Du (IEEE Trans. Computers, 1996)

Multi-Color Routing in the Undirected Hypercube. - Qian-Ping Gu; Hisao Tamaki (ISAAC, 1997)

Node-to-Node Cluster Fault Tolerant Routing in Hypercubes. - Qian-Ping Gu; Shietung Peng (ISPAN, 1997)

A Distributed Algorithm for Leader Election from a Partially Ordered Set on a Coterie. - Zixue Cheng; Qian-Ping Gu (PDPTA, 1997)

Node-To-Set Disjoint Paths Problem in Star Graphs. - Qian-Ping Gu; Shietung Peng (Inf. Process. Lett., 1997)

Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths. - Qian-Ping Gu; Hisao Tamaki (J. Parallel Distributed Comput., 1997)

k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. - Qian-Ping Gu; Shietung Peng (IEEE Trans. Computers, 1997)

Routing in Hypercubes with Large Number of Faulty Nodes. - Qian-Ping Gu; Shietung Peng (ICPADS, 1998)

Cluster Fault Tolerant Routing in Hypercubes. - Qian-Ping Gu; Shietung Peng (ICPP, 1998)

An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs. - Qian-Ping Gu; Shietung Peng (Inf. Process. Lett., 1998)

Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes. - Qian-Ping Gu; Shietung Peng (Parallel Comput., 1998)

On optimizing the satisfiability (SAT) problem. - Jun Gu; Qian-Ping Gu; Ding-Zhu Du (J. Comput. Sci. Technol., 1999)

A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. - Qian-Ping Gu; Shietung Peng; Ivan Hal Sudborough (Theor. Comput. Sci., 1999)

Unicast in Hypercubes with Large Number of Faulty Nodes. - Qian-Ping Gu; Shietung Peng (IEEE Trans. Parallel Distributed Syst., 1999)

Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. - Qian-Ping Gu; Shietung Peng (ICPP, 2000)

Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. - Qian-Ping Gu; Shietung Peng (IPDPS, 2000)

Multicolor routing in the undirected hypercube. - Qian-Ping Gu; Hisao Tamaki (Discret. Appl. Math., 2000)

An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. - Qian-Ping Gu; Shietung Peng (J. Parallel Distributed Comput., 2000)

Cluster fault-tolerant routing in star graphs. - Qian-Ping Gu; Shietung Peng (Networks, 2000)

Multicasts on WDM All-Optical Multistage Interconnection Networks. - Xinchen Liu; Qian-Ping Gu (ICPADS, 2001)

Multi-hop All-to-All Broadcast on WDM Optical Networks. - Qian-Ping Gu; Shietung Peng (ICPP Workshops, 2001)

On-line Permutation Routing on WDM All-Optical Networks. - Qian-Ping Gu (ICPP, 2002)

Multicasts on WDM All-Optical Butterfly Networks. - Xinchen Liu; Qian-Ping Gu (J. Inf. Sci. Eng., 2002)

Efficient Algorithm for Embedding Hypergraphs in a Cycle. - Qian-Ping Gu; Yong Wang (HiPC, 2003)

Multihop All-to-All Broadcast on WDM Optical Networks. - Qian-Ping Gu; Shietung Peng (IEEE Trans. Parallel Distributed Syst., 2003)

Wavelength Assignment on Bounded Degree Trees of Rings. - Zhengbing Bian; Qian-Ping Gu; Xiao Zhou 001 (ICPADS, 2004)

Tight Bounds for Wavelength Assignment on Trees of Rings. - Zhengbing Bian; Qian-Ping Gu; Xiao Zhou 001 (IPDPS, 2005)

Formal description and analysis of a distributed location service for mobile ad hoc networks. - Uwe Glässer; Qian-Ping Gu (Theor. Comput. Sci., 2005)

Grooming of Symmetric Traffic in Unidirectional SONET/WDM Rings. - Yong Wang; Qian-Ping Gu (ICC, 2006)

Efficient Algorithms for Traffic Grooming in SONET/WDM Networks. - Yong Wang; Qian-Ping Gu (ICPP, 2006)

Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle. - Qian-Ping Gu; Yong Wang (IEEE Trans. Parallel Distributed Syst., 2006)

Maximizing Throughput for Traffic Grooming with Limited Grooming Resources. - Yong Wang; Qian-Ping Gu (GLOBECOM, 2007)

Wavelength Assignment in Multifiber WDM Star and Spider Networks. - Zhengbing Bian; Qian-Ping Gu (ICC, 2007)

A Min-Max Optimization Problem on Traffic Grooming in WDM Optical Networks. - Yong Wang; Qian-Ping Gu (ICCCN, 2007)

Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. - Zhengbing Bian; Qian-Ping Gu; Marjan Marzban; Hisao Tamaki; Yumi Yoshitake (ALENEX, 2008)

Computational Study on Dominating Set Problem of Planar Graphs. - Marjan Marzban; Qian-Ping Gu; Xiaohua Jia (COCOA, 2008)

Computing Branch Decomposition of Large Planar Graphs. - Zhengbing Bian; Qian-Ping Gu (WEA, 2008)

On the complexity and algorithm of grooming regular traffic in WDM optical networks. - Yong Wang; Qian-Ping Gu (J. Parallel Distributed Comput., 2008)

Optimal branch-decomposition of planar graphs in O(n3) Time. - Qian-Ping Gu; Hisao Tamaki (ACM Trans. Algorithms, 2008)

Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time. - Qian-Ping Gu; Hisao Tamaki (ISAAC, 2009)

Efficient algorithms for wavelength assignment on trees of rings. - Zhengbing Bian; Qian-Ping Gu; Xiao Zhou 001 (Discret. Appl. Math., 2009)

1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings. - Zhengbing Bian; Qian-Ping Gu (Inf. Process. Lett., 2009)

Minimizing SONET Add-Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths. - Yong Wang; Qian-Ping Gu (Networks, 2009)

Computational study on planar dominating set problem. - Marjan Marzban; Qian-Ping Gu; Xiaohua Jia (Theor. Comput. Sci., 2009)

Computational Study for Planar Connected Dominating Set Problem. - Marjan Marzban; Qian-Ping Gu; Xiaohua Jia (COCOA (2), 2010)

Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set. - Qianping Gu; Navid Imani (LATIN, 2010)

Wavelength assignment in multifiber star networks. - Zhengbing Bian; Qian-Ping Gu (Networks, 2010)

Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem. - Chunhao Wang; Qian-Ping Gu (ISAAC, 2011)

Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+ϵ) time. - Qian-Ping Gu; Hisao Tamaki (Theor. Comput. Sci., 2011)

Carving-decomposition based algorithms for the maximum path coloring problem. - Mehwish Bashir; Qian-Ping Gu (ICC, 2012)

Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. - Qian-Ping Gu; Hisao Tamaki (Algorithmica, 2012)

Computational Study on a PTAS for Planar Dominating Set Problem. - Marjan Marzban; Qian-Ping Gu (Algorithms, 2013)

Constant Query Time (1+ epsilon ) -Approximate Distance Oracle for Planar Graphs. - Qian-Ping Gu; Gengchun Xu (ISAAC, 2015)

Preface. - Qian-Ping Gu; Pavol Hell; Boting Yang (Theor. Comput. Sci., 2015)

Practical algorithms for branch-decompositions of planar graphs. - Zhengbing Bian; Qian-Ping Gu; Mingzhe Zhu (Discret. Appl. Math., 2016)

A Practical Algorithm for Embedding Graphs on Torus. - Jiahua Yu; Qian-Ping Gu (Int. J. Netw. Comput., 2016)

Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs. - Yingjie Xia; Mingzhe Zhu; Qianping Gu; Luming Zhang; Xuelong Li 001 (Inf. Sci., 2016)

New analysis and computational study for the planar connected dominating set problem. - Marjan Marzban; Qian-Ping Gu; Xiaohua Jia (J. Comb. Optim., 2016)

Constant Query Time $(1 + ε)$-Approximate Distance Oracle for Planar Graphs. - Qian-Ping Gu; Gengchun Xu (CoRR, 2017)

Algorithmic analysis for ridesharing of personal vehicles. - Qian-Ping Gu; Jiajian Leo Liang; Guochuan Zhang (Theor. Comput. Sci., 2018)

Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs. - Qian-Ping Gu; Gengchun Xu (Discret. Appl. Math., 2019)

Efficient algorithms for ridesharing of personal vehicles. - Qian-Ping Gu; Jiajian Leo Liang; Guochuan Zhang (Theor. Comput. Sci., 2019)

Constant query time (1 + ϵ)-approximate distance oracle for planar graphs. - Qian-Ping Gu; Gengchun Xu (Theor. Comput. Sci., 2019)

Atomos: Constant-Size Path Validation Proof. - Anxiao He; Kai Bu; Yucong Li; Eikoh Chida; Qianping Gu; Kui Ren 001 (IEEE Trans. Inf. Forensics Secur., 2020)

Multimodal Transportation with Ridesharing of Personal Vehicles. - Qian-Ping Gu; Jiajian Leo Liang (ISAAC, 2021)

Approximate ridesharing of personal vehicles problem. - Qian-Ping Gu; Jiajian Leo Liang; Guochuan Zhang (Theor. Comput. Sci., 2021)

An efficient oracle for counting shortest paths in planar graphs. - Ye Gong; Qian-Ping Gu (Theor. Comput. Sci., 2022)

Algorithms for the Ridesharing with Profit Constraint Problem. - Qian-Ping Gu; Jiajian Leo Liang (COCOA (1), 2023)

Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles. - Qian-Ping Gu; Jiajian Leo Liang (Comput. Oper. Res., 2024)

SwiftParade: Anti-Burst Multipath Validation. - Anxiao He; Kai Bu; Jiongrui Huang; Yifei Pang; Qianping Gu; Kui Ren 001 (IEEE Trans. Dependable Secur. Comput., 2024)

Average Sensitivity of Breadth-First Search Algorithms on Grids. - Ryan Assari; Qian-Ping Gu (IWOCA, 2025)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile. - Qian-Ping Gu; Jiajian Leo Liang (IWOCA, 2025)