default search action
Qian-Ping Gu
Qianping Gu
Person information
- affiliation: Simon Fraser University, Burnaby, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j51]Qian-Ping Gu, Jiajian Leo Liang:
Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles. Comput. Oper. Res. 164: 106529 (2024) - [j50]Anxiao He
, Kai Bu
SwiftParade: Anti-Burst Multipath Validation. IEEE Trans. Dependable Secur. Comput. 21(4): 2720-2734 (2024) - 2023
- [c45]Qian-Ping Gu, Jiajian Leo Liang:
Algorithms for the Ridesharing with Profit Constraint Problem. COCOA (1) 2023: 366-379 - [i6]Qian-Ping Gu, Jiajian Leo Liang:
Algorithms and Computational Study on a Transportation System Integrating Public Transit and Ridesharing of Personal Vehicles. CoRR abs/2308.09191 (2023) - [i5]Qian-Ping Gu, Jiajian Leo Liang:
Algorithms for the Ridesharing with Profit Constraint Problem. CoRR abs/2310.04933 (2023) - 2022
- [j49]Ye Gong, Qian-Ping Gu:
An efficient oracle for counting shortest paths in planar graphs. Theor. Comput. Sci. 921: 75-85 (2022) - 2021
- [j48]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Approximate ridesharing of personal vehicles problem. Theor. Comput. Sci. 871: 30-50 (2021) - [c44]Ye Gong, Qian-Ping Gu:
An Efficient Oracle for Counting Shortest Paths in Planar Graphs. AAIM 2021: 406-417 - [c43]Qian-Ping Gu, Jiajian Leo Liang:
Multimodal Transportation with Ridesharing of Personal Vehicles. ISAAC 2021: 39:1-39:16 - [i4]Qian-Ping Gu, Jiajian Leo Liang:
Multimodal Transportation with Ridesharing of Personal Vehicles. CoRR abs/2106.00232 (2021) - 2020
- [j47]Anxiao He, Kai Bu
Atomos: Constant-Size Path Validation Proof. IEEE Trans. Inf. Forensics Secur. 15: 3832-3847 (2020) - [c42]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Approximate Ridesharing of Personal Vehicles Problem. COCOA 2020: 3-18 - [i3]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang:
Approximate Ridesharing of Personal Vehicles Problem. CoRR abs/2007.15154 (2020)
2010 – 2019
- 2019
- [j46]Qian-Ping Gu, Gengchun Xu
Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs. Discret. Appl. Math. 257: 186-205 (2019) - [j45]Qian-Ping Gu, Gengchun Xu:
Constant query time (1 + ϵ)-approximate distance oracle for planar graphs. Theor. Comput. Sci. 761: 78-88 (2019) - [j44]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Efficient algorithms for ridesharing of personal vehicles. Theor. Comput. Sci. 788: 79-94 (2019) - 2018
- [j43]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Algorithmic analysis for ridesharing of personal vehicles. Theor. Comput. Sci. 749: 36-46 (2018) - 2017
- [c41]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Efficient Algorithms for Ridesharing of Personal Vehicles. COCOA (1) 2017: 340-354 - [i2]Qian-Ping Gu, Gengchun Xu:
Constant Query Time $(1 + ε)$-Approximate Distance Oracle for Planar Graphs. CoRR abs/1706.03108 (2017) - 2016
- [j42]Zhengbing Bian, Qian-Ping Gu, Mingzhe Zhu:
Practical algorithms for branch-decompositions of planar graphs. Discret. Appl. Math. 199: 156-171 (2016) - [j41]Jiahua Yu, Qian-Ping Gu:
A Practical Algorithm for Embedding Graphs on Torus. Int. J. Netw. Comput. 6(2): 149-166 (2016) - [j40]Yingjie Xia, Mingzhe Zhu, Qianping Gu, Luming Zhang, Xuelong Li
Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs. Inf. Sci. 374: 164-178 (2016) - [j39]Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
New analysis and computational study for the planar connected dominating set problem. J. Comb. Optim. 32(1): 198-225 (2016) - [c40]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Algorithmic Analysis for Ridesharing of Personal Vehicles. COCOA 2016: 438-452 - 2015
- [j38]Qian-Ping Gu, Pavol Hell, Boting Yang:
Preface. Theor. Comput. Sci. 607: 1 (2015) - [c39]Jiahua Yu, Qian-Ping Gu:
A Practical Algorithm for Embedding Graphs on Torus. CANDAR 2015: 50-57 - [c38]Qian-Ping Gu, Gengchun Xu:
Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs. ISAAC 2015: 625-636 - 2014
- [c37]Qian-Ping Gu, Gengchun Xu:
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs. WG 2014: 238-249 - [e1]Qianping Gu, Pavol Hell, Boting Yang:
Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings. Lecture Notes in Computer Science 8546, Springer 2014, ISBN 978-3-319-07955-4 [contents] - [i1]Qianping Gu, Gengchun Xu:
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs. CoRR abs/1407.6761 (2014) - 2013
- [j37]Marjan Marzban, Qian-Ping Gu:
Computational Study on a PTAS for Planar Dominating Set Problem. Algorithms 6(1): 43-59 (2013) - 2012
- [j36]Qian-Ping Gu, Hisao Tamaki:
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. Algorithmica 64(3): 416-453 (2012) - [c36]Mehwish Bashir, Qian-Ping Gu:
Carving-decomposition based algorithms for the maximum path coloring problem. ICC 2012: 2977-2982 - 2011
- [j35]Qian-Ping Gu, Hisao Tamaki:
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+ϵ) time. Theor. Comput. Sci. 412(32): 4100-4109 (2011) - [c35]Chunhao Wang, Qian-Ping Gu:
Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem. ISAAC 2011: 364-373 - 2010
- [j34]Zhengbing Bian, Qian-Ping Gu:
Wavelength assignment in multifiber star networks. Networks 56(1): 30-38 (2010) - [c34]Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
Computational Study for Planar Connected Dominating Set Problem. COCOA (2) 2010: 107-116 - [c33]Qian-Ping Gu, Hisao Tamaki:
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. ISAAC (2) 2010: 85-96 - [c32]Qianping Gu, Navid Imani:
Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set. LATIN 2010: 26-37
2000 – 2009
- 2009
- [j33]Zhengbing Bian, Qian-Ping Gu, Xiao Zhou:
Efficient algorithms for wavelength assignment on trees of rings. Discret. Appl. Math. 157(5): 875-889 (2009) - [j32]Zhengbing Bian, Qian-Ping Gu:
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings. Inf. Process. Lett. 109(8): 400-404 (2009) - [j31]Yong Wang, Qian-Ping Gu:
Minimizing SONET Add-Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths. Networks 53(3): 276-286 (2009) - [j30]Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
Computational study on planar dominating set problem. Theor. Comput. Sci. 410(52): 5455-5466 (2009) - [c31]Qian-Ping Gu, Hisao Tamaki:
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time. ISAAC 2009: 984-993 - 2008
- [j29]Yong Wang, Qian-Ping Gu:
On the complexity and algorithm of grooming regular traffic in WDM optical networks. J. Parallel Distributed Comput. 68(6): 877-886 (2008) - [j28]Qian-Ping Gu, Hisao Tamaki:
Optimal branch-decomposition of planar graphs in O(n3) Time. ACM Trans. Algorithms 4(3): 30:1-30:13 (2008) - [c30]Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake:
Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. ALENEX 2008: 152-165 - [c29]Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
Computational Study on Dominating Set Problem of Planar Graphs. COCOA 2008: 89-102 - [c28]Zhengbing Bian, Qian-Ping Gu:
Computing Branch Decomposition of Large Planar Graphs. WEA 2008: 87-100 - 2007
- [c27]Yong Wang, Qian-Ping Gu:
Maximizing Throughput for Traffic Grooming with Limited Grooming Resources. GLOBECOM 2007: 2337-2341 - [c26]Zhengbing Bian, Qian-Ping Gu:
Wavelength Assignment in Multifiber WDM Star and Spider Networks. ICC 2007: 2430-2435 - [c25]Yong Wang, Qian-Ping Gu:
A Min-Max Optimization Problem on Traffic Grooming in WDM Optical Networks. ICCCN 2007: 228-233 - 2006
- [j27]Qian-Ping Gu, Yong Wang:
Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle. IEEE Trans. Parallel Distributed Syst. 17(3): 205-214 (2006) - [c24]Yong Wang, Qian-Ping Gu:
Grooming of Symmetric Traffic in Unidirectional SONET/WDM Rings. ICC 2006: 2407-2414 - [c23]Yong Wang, Qian-Ping Gu:
Efficient Algorithms for Traffic Grooming in SONET/WDM Networks. ICPP 2006: 355-364 - 2005
- [j26]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): 285-309 (2005) - [c22]Qian-Ping Gu, Hisao Tamaki:
Optimal Branch-Decomposition of Planar Graphs in O(n3) Time. ICALP 2005: 373-384 - [c21]Zhengbing Bian, Qian-Ping Gu, Xiao Zhou:
Tight Bounds for Wavelength Assignment on Trees of Rings. IPDPS 2005 - 2004
- [c20]Zhengbing Bian, Qian-Ping Gu, Xiao Zhou:
Wavelength Assignment on Bounded Degree Trees of Rings. ICPADS 2004: 73-80 - 2003
- [j25]Qian-Ping Gu, Shietung Peng:
Multihop All-to-All Broadcast on WDM Optical Networks. IEEE Trans. Parallel Distributed Syst. 14(5): 477-486 (2003) - [c19]Qian-Ping Gu, Yong Wang:
Efficient Algorithm for Embedding Hypergraphs in a Cycle. HiPC 2003: 85-94 - 2002
- [j24]Xinchen Liu, Qian-Ping Gu:
Multicasts on WDM All-Optical Butterfly Networks. J. Inf. Sci. Eng. 18(6): 1049-1058 (2002) - [c18]Qian-Ping Gu:
On-line Permutation Routing on WDM All-Optical Networks. ICPP 2002: 419-428 - 2001
- [c17]Xinchen Liu, Qian-Ping Gu:
Multicasts on WDM All-Optical Multistage Interconnection Networks. ICPADS 2001: 601-608 - [c16]Qian-Ping Gu, Shietung Peng:
Multi-hop All-to-All Broadcast on WDM Optical Networks. ICPP Workshops 2001: 291-296 - 2000
- [j23]Qian-Ping Gu, Hisao Tamaki:
Multicolor routing in the undirected hypercube. Discret. Appl. Math. 100(3): 169-181 (2000) - [j22]Qian-Ping Gu, Shietung Peng:
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. J. Parallel Distributed Comput. 60(6): 764-774 (2000) - [j21]Qian-Ping Gu, Shietung Peng:
Cluster fault-tolerant routing in star graphs. Networks 35(1): 83-90 (2000) - [c15]Qian-Ping Gu, Shietung Peng:
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. ICPP 2000: 513-520 - [c14]Qian-Ping Gu, Shietung Peng:
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. IPDPS 2000: 761-768
1990 – 1999
- 1999
- [j20]Jun Gu, Qian-Ping Gu, Ding-Zhu Du:
On optimizing the satisfiability (SAT) problem. J. Comput. Sci. Technol. 14(1): 1-17 (1999) - [j19]Qian-Ping Gu, Shietung Peng, Ivan Hal Sudborough:
A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. Theor. Comput. Sci. 210(2): 327-339 (1999) - [j18]Qian-Ping Gu, Shietung Peng:
Unicast in Hypercubes with Large Number of Faulty Nodes. IEEE Trans. Parallel Distributed Syst. 10(10): 964-975 (1999) - 1998
- [j17]Qian-Ping Gu, Shietung Peng:
An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs. Inf. Process. Lett. 67(6): 283-287 (1998) - [j16]Qian-Ping Gu, Shietung Peng:
Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes. Parallel Comput. 24(8): 1245-1261 (1998) - [c13]Qian-Ping Gu, Shietung Peng:
Routing in Hypercubes with Large Number of Faulty Nodes. ICPADS 1998: 718- - [c12]Qian-Ping Gu, Shietung Peng:
Cluster Fault Tolerant Routing in Hypercubes. ICPP 1998: 148-155 - 1997
- [j15]Qian-Ping Gu, Shietung Peng:
Node-To-Set Disjoint Paths Problem in Star Graphs. Inf. Process. Lett. 62(4): 201-207 (1997) - [j14]Qian-Ping Gu, Hisao Tamaki:
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths. J. Parallel Distributed Comput. 44(2): 147-152 (1997) - [j13]Qian-Ping Gu, Shietung Peng:
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. IEEE Trans. Computers 46(9): 1042-1049 (1997) - [c11]Qian-Ping Gu, Hisao Tamaki:
Multi-Color Routing in the Undirected Hypercube. ISAAC 1997: 72-81 - [c10]Qian-Ping Gu, Shietung Peng:
Node-to-Node Cluster Fault Tolerant Routing in Hypercubes. ISPAN 1997: 404-409 - [c9]Zixue Cheng, Qian-Ping Gu:
A Distributed Algorithm for Leader Election from a Partially Ordered Set on a Coterie. PDPTA 1997: 825-847 - 1996
- [j12]Qian-Ping Gu, Shietung Peng:
An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters. Comput. J. 39(1): 14-19 (1996) - [j11]Qian-Ping Gu, Shietung Peng:
Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes. Comput. J. 39(7): 626-629 (1996) - [j10]Qian-Ping Gu, Shietung Peng:
Fault Tolerant Routing in Hypercubes and Star Graphs. Parallel Process. Lett. 6(1): 127-136 (1996) - [j9]Jun Gu, Qian-Ping Gu, Ding-Zhu Du:
Convergence Properties of Optimization Algorithms for the SAT Problem. IEEE Trans. Computers 45(2): 209-219 (1996) - [c8]Qian-Ping Gu, Shietung Peng:
An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. ICPADS 1996: 98-105 - [c7]Qian-Ping Gu, Hisao Tamaki:
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. IPPS 1996: 561-567 - 1995
- [j8]Qian-Ping Gu, Shietung Peng:
Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs. IEICE Trans. Inf. Syst. 78-D(9): 1171-1177 (1995) - [j7]Qian-Ping Gu, Shietung Peng:
Node-to-Node Cluster Fault Tolerant Routing in Star Graphs. Inf. Process. Lett. 56(1): 29-35 (1995) - [j6]Qian-Ping Gu, Jun Gu:
Two Packet Routing Algorithms on a Mesh-Connected Computer. IEEE Trans. Parallel Distributed Syst. 6(4): 436-440 (1995) - [c6]Qian-Ping Gu, Shietung Peng:
Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters. Parallel and Distributed Computing and Systems 1995: 229-233 - [c5]Qian-Ping Gu, Shietung Peng:
An efficient algorithm for k-pairwise node disjoint path problem in hypercubes. SPDP 1995: 673-680 - 1994
- [j5]Qian-Ping Gu, Jun Gu:
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer. IEEE Trans. Parallel Distributed Syst. 5(3): 308-315 (1994) - [c4]Qian-Ping Gu, Shietung Peng:
Algorithms for Node Disjoint Paths in Incomplete Star Networks. ICPADS 1994: 296-303 - [c3]Jun Gu, Qian-Ping Gu:
Average Time Complexity of the SAT 1.2 Algorithm. ISAAC 1994: 146-154 - [c2]Qian-Ping Gu, Shietung Peng:
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. ISAAC 1994: 342-350 - [c1]Qian-Ping Gu, Shietung Peng:
Advanced fault tolerant routing in hypercubes. ISPAN 1994: 189-196 - 1992
- [j4]Qian-Ping Gu, Akira Maruoka:
Learning Monotone Boolean Functions by Uniformly Distributed Examples. SIAM J. Comput. 21(3): 587-599 (1992) - 1991
- [j3]Qian-Ping Gu, Akira Maruoka:
Learning boolean functions. Syst. Comput. Jpn. 22(1): 1-9 (1991) - [j2]Qian-Ping Gu, Akira Maruoka:
Amplification of Bounded Depth Monotone Read-Once Boolean Formulae. SIAM J. Comput. 20(1): 41-55 (1991) - 1990
- [j1]Qian-Ping Gu, Tadao Takaoka:
A sharper analysis of a parallel algorithm for the all pairs shortest path problem. Parallel Comput. 16(1): 61-67 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-27 16:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: