Qian-Ping Gu

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 23

Top Topics

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Publications

Qian-Ping Gu, Jiajian Leo Liang
Algorithms for the Ridesharing with Profit Constraint Problem. COCOA (1) (2023)
Qian-Ping Gu, Jiajian Leo Liang
Algorithms for the Ridesharing with Profit Constraint Problem. CoRR (2023)
Qian-Ping Gu, Jiajian Leo Liang
Algorithms and Computational Study on a Transportation System Integrating Public Transit and Ridesharing of Personal Vehicles. CoRR (2023)
Ye Gong, Qian-Ping Gu
An efficient oracle for counting shortest paths in planar graphs. Theor. Comput. Sci. 921 (2022)
Qian-Ping Gu, Jiajian Leo Liang
Multimodal Transportation with Ridesharing of Personal Vehicles. ISAAC (2021)
Ye Gong, Qian-Ping Gu
An Efficient Oracle for Counting Shortest Paths in Planar Graphs. AAIM (2021)
Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Approximate ridesharing of personal vehicles problem. Theor. Comput. Sci. 871 (2021)
Qian-Ping Gu, Jiajian Leo Liang
Multimodal Transportation with Ridesharing of Personal Vehicles. CoRR (2021)
Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Approximate Ridesharing of Personal Vehicles Problem. COCOA (2020)
Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Approximate Ridesharing of Personal Vehicles Problem. CoRR (2020)
Qian-Ping Gu, Gengchun Xu
Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs. Discret. Appl. Math. 257 (2019)
Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Efficient algorithms for ridesharing of personal vehicles. Theor. Comput. Sci. 788 (2019)
Qian-Ping Gu, Gengchun Xu
)-approximate distance oracle for planar graphs. Theor. Comput. Sci. 761 (2019)
Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Algorithmic analysis for ridesharing of personal vehicles. Theor. Comput. Sci. 749 (2018)
Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Efficient Algorithms for Ridesharing of Personal Vehicles. COCOA (1) (2017)
Qian-Ping Gu, Gengchun Xu
Constant Query Time $(1 + ε)$-Approximate Distance Oracle for Planar Graphs. CoRR (2017)
Jiahua Yu, Qian-Ping Gu
A Practical Algorithm for Embedding Graphs on Torus. Int. J. Netw. Comput. 6 (2) (2016)
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
New analysis and computational study for the planar connected dominating set problem. J. Comb. Optim. 32 (1) (2016)
Zhengbing Bian, Qian-Ping Gu, Mingzhe Zhu
Practical algorithms for branch-decompositions of planar graphs. Discret. Appl. Math. 199 (2016)
Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Algorithmic Analysis for Ridesharing of Personal Vehicles. COCOA (2016)
Qian-Ping Gu, Pavol Hell, Boting Yang
Preface. Theor. Comput. Sci. 607 (2015)
Qian-Ping Gu, Gengchun Xu
Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs. ISAAC (2015)
Jiahua Yu, Qian-Ping Gu
A Practical Algorithm for Embedding Graphs on Torus. CANDAR (2015)
Qian-Ping Gu, Gengchun Xu
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs. WG (2014)
Marjan Marzban, Qian-Ping Gu
Computational Study on a PTAS for Planar Dominating Set Problem. Algorithms 6 (1) (2013)
Mehwish Bashir, Qian-Ping Gu
Carving-decomposition based algorithms for the maximum path coloring problem. ICC (2012)
Qian-Ping Gu, Hisao Tamaki
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. Algorithmica 64 (3) (2012)
Qian-Ping Gu, Hisao Tamaki
) time. Theor. Comput. Sci. 412 (32) (2011)
Chunhao Wang, Qian-Ping Gu
Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem. ISAAC (2011)
Zhengbing Bian, Qian-Ping Gu
Wavelength assignment in multifiber star networks. Networks 56 (1) (2010)
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
Computational Study for Planar Connected Dominating Set Problem. COCOA (2) (2010)
Qian-Ping Gu, Hisao Tamaki
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. ISAAC (2) (2010)
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
Efficient algorithms for wavelength assignment on trees of rings. Discret. Appl. Math. 157 (5) (2009)
Zhengbing Bian, Qian-Ping Gu
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings. Inf. Process. Lett. 109 (8) (2009)
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
Computational study on planar dominating set problem. Theor. Comput. Sci. 410 (52) (2009)
Yong Wang, Qian-Ping Gu
Minimizing SONET Add-Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths. Networks 53 (3) (2009)
Qian-Ping Gu, Hisao Tamaki
) Time. ISAAC (2009)
Zhengbing Bian, Qian-Ping Gu
Computing Branch Decomposition of Large Planar Graphs. WEA (2008)
Yong Wang, Qian-Ping Gu
On the complexity and algorithm of grooming regular traffic in WDM optical networks. J. Parallel Distributed Comput. 68 (6) (2008)
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
Computational Study on Dominating Set Problem of Planar Graphs. COCOA (2008)
Qian-Ping Gu, Hisao Tamaki
) Time. ACM Trans. Algorithms 4 (3) (2008)
Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake
Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. ALENEX (2008)
Zhengbing Bian, Qian-Ping Gu
Wavelength Assignment in Multifiber WDM Star and Spider Networks. ICC (2007)
Yong Wang, Qian-Ping Gu
Maximizing Throughput for Traffic Grooming with Limited Grooming Resources. GLOBECOM (2007)
Yong Wang, Qian-Ping Gu
A Min-Max Optimization Problem on Traffic Grooming in WDM Optical Networks. ICCCN (2007)
Qian-Ping Gu, Yong Wang
Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle. IEEE Trans. Parallel Distributed Syst. 17 (3) (2006)
Yong Wang, Qian-Ping Gu
Efficient Algorithms for Traffic Grooming in SONET/WDM Networks. ICPP (2006)
Yong Wang, Qian-Ping Gu
Grooming of Symmetric Traffic in Unidirectional SONET/WDM Rings. ICC (2006)
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
Tight Bounds for Wavelength Assignment on Trees of Rings. IPDPS (2005)
Qian-Ping Gu, Hisao Tamaki
) Time. ICALP (2005)
Uwe Glässer, Qian-Ping Gu
Formal description and analysis of a distributed location service for mobile ad hoc networks. Theor. Comput. Sci. 336 (2-3) (2005)
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
Wavelength Assignment on Bounded Degree Trees of Rings. ICPADS (2004)
Qian-Ping Gu, Shietung Peng
Multihop All-to-All Broadcast on WDM Optical Networks. IEEE Trans. Parallel Distributed Syst. 14 (5) (2003)
Qian-Ping Gu, Yong Wang
Efficient Algorithm for Embedding Hypergraphs in a Cycle. HiPC (2003)
Qian-Ping Gu
On-line Permutation Routing on WDM All-Optical Networks. ICPP (2002)
Xinchen Liu, Qian-Ping Gu
Multicasts on WDM All-Optical Butterfly Networks. J. Inf. Sci. Eng. 18 (6) (2002)
Xinchen Liu, Qian-Ping Gu
Multicasts on WDM All-Optical Multistage Interconnection Networks. ICPADS (2001)
Qian-Ping Gu, Shietung Peng
Multi-hop All-to-All Broadcast on WDM Optical Networks. ICPP Workshops (2001)
Qian-Ping Gu, Hisao Tamaki
Multicolor routing in the undirected hypercube. Discret. Appl. Math. 100 (3) (2000)
Qian-Ping Gu, Shietung Peng
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. J. Parallel Distributed Comput. 60 (6) (2000)
Qian-Ping Gu, Shietung Peng
Cluster fault-tolerant routing in star graphs. Networks 35 (1) (2000)
Qian-Ping Gu, Shietung Peng
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. ICPP (2000)
Qian-Ping Gu, Shietung Peng
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. IPDPS (2000)
Jun Gu, Qian-Ping Gu, Ding-Zhu Du
On optimizing the satisfiability (SAT) problem. J. Comput. Sci. Technol. 14 (1) (1999)
Qian-Ping Gu, Shietung Peng
Unicast in Hypercubes with Large Number of Faulty Nodes. IEEE Trans. Parallel Distributed Syst. 10 (10) (1999)
Qian-Ping Gu, Shietung Peng, Ivan Hal Sudborough
A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. Theor. Comput. Sci. 210 (2) (1999)
Qian-Ping Gu, Shietung Peng
Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes. Parallel Comput. 24 (8) (1998)
Qian-Ping Gu, Shietung Peng
Routing in Hypercubes with Large Number of Faulty Nodes. ICPADS (1998)
Qian-Ping Gu, Shietung Peng
Cluster Fault Tolerant Routing in Hypercubes. ICPP (1998)
Qian-Ping Gu, Shietung Peng
-Pairwise Disjoint Paths in Star Graphs. Inf. Process. Lett. 67 (6) (1998)
Qian-Ping Gu, Shietung Peng
Node-To-Set Disjoint Paths Problem in Star Graphs. Inf. Process. Lett. 62 (4) (1997)
Qian-Ping Gu, Hisao Tamaki
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths. J. Parallel Distributed Comput. 44 (2) (1997)
Qian-Ping Gu, Shietung Peng
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. IEEE Trans. Computers 46 (9) (1997)
Qian-Ping Gu, Hisao Tamaki
Multi-Color Routing in the Undirected Hypercube. ISAAC (1997)
Qian-Ping Gu, Shietung Peng
Node-to-Node Cluster Fault Tolerant Routing in Hypercubes. ISPAN (1997)
Zixue Cheng, Qian-Ping Gu
A Distributed Algorithm for Leader Election from a Partially Ordered Set on a Coterie. PDPTA (1997)
Jun Gu, Qian-Ping Gu, Ding-Zhu Du
Convergence Properties of Optimization Algorithms for the SAT Problem. IEEE Trans. Computers 45 (2) (1996)
Qian-Ping Gu, Shietung Peng
An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. ICPADS (1996)
Qian-Ping Gu, Shietung Peng
Fault Tolerant Routing in Hypercubes and Star Graphs. Parallel Process. Lett. 6 (1) (1996)
Qian-Ping Gu, Hisao Tamaki
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. IPPS (1996)
Qian-Ping Gu, Shietung Peng
An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters. Comput. J. 39 (1) (1996)
Qian-Ping Gu, Shietung Peng
Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes. Comput. J. 39 (7) (1996)
Qian-Ping Gu, Shietung Peng
Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs. IEICE Trans. Inf. Syst. (9) (1995)
Qian-Ping Gu, Shietung Peng
Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters. Parallel and Distributed Computing and Systems (1995)
Qian-Ping Gu, Shietung Peng
Node-to-Node Cluster Fault Tolerant Routing in Star Graphs. Inf. Process. Lett. 56 (1) (1995)
Qian-Ping Gu, Shietung Peng
An efficient algorithm for k-pairwise node disjoint path problem in hypercubes. SPDP (1995)
Qian-Ping Gu, Jun Gu
Two Packet Routing Algorithms on a Mesh-Connected Computer. IEEE Trans. Parallel Distributed Syst. 6 (4) (1995)
Qian-Ping Gu, Jun Gu
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer. IEEE Trans. Parallel Distributed Syst. 5 (3) (1994)
Qian-Ping Gu, Shietung Peng
Advanced fault tolerant routing in hypercubes. ISPAN (1994)
Jun Gu, Qian-Ping Gu
Average Time Complexity of the SAT 1.2 Algorithm. ISAAC (1994)
Qian-Ping Gu, Shietung Peng
Algorithms for Node Disjoint Paths in Incomplete Star Networks. ICPADS (1994)
Qian-Ping Gu, Shietung Peng
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. ISAAC (1994)
Qian-Ping Gu, Akira Maruoka
Learning Monotone Boolean Functions by Uniformly Distributed Examples. SIAM J. Comput. 21 (3) (1992)
Qian-Ping Gu, Akira Maruoka
Learning boolean functions. Systems and Computers in Japan 22 (1) (1991)
Qian-Ping Gu, Akira Maruoka
Amplification of Bounded Depth Monotone Read-Once Boolean Formulae. SIAM J. Comput. 20 (1) (1991)
Qian-Ping Gu, Tadao Takaoka
A sharper analysis of a parallel algorithm for the all pairs shortest path problem. Parallel Comput. 16 (1) (1990)