Qian-Ping Gu

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