Qianping Gu

Research Interests

• Algorithms and Computation
• Combinatorial Optimization in Networks
• Parallel/Distributed Computing

• Algorithms for Transportation Networks
• Q. Gu and J.L. Liang, Multimodal transportation with ridesharing of personal vehicles,
  Proc. of ISAAC2021, pages 39:1-39:16, 2021
• Q. Gu, J.L. Liang and G. Zhang, Approximate ridesharing of personal vehicles problem,
  Theoretical Computer Science, Vol. 871, pages 30-50, 2021
• Algorithms and Oracles for Shortest Path/Distance Problems
• Y. Gong and Q. Gu, An efficient oracle for counting shortest paths in planar graphs,
  Theoretical Computer Science, Vol. 921, pages 75-85, 2022
• Q. Gu and G. Xu, Constant query time (1+ε)-approximate distance oracle for planar graphs,
  Theoretical Computer Science, Vol. 761, pages 78-88, 2019
• Branch-decompositions of Planar Graphs
• Q. Gu and G. Xu, Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs,
  Discrete Applied Mathematics, Vol. 257, pages 186-205, 2019
• Q. Gu and H. Tamaki, Improved bounds on the planar branchwidth with respect to the largest grid minor size,
  Algorithmica, Vol. 64(3), pages 416-453, 2012
• Q. Gu and H. Tamaki, Optimal branch-decomposition of planar graphs in O(n^3) time,
  ACM Trans. Algorithms, Vol. 4(3): pages 30:1-30:13, 2008