Qianping Gu

Professor
Computing Science

Areas of interest

Research Interests:
Algorithms and computation
Combinatorial optimization in networks
Parallel/distributed computing

Teaching Interests:
Design and analysis of algorithms
Graph algorithms

Education

  • Ph.D. Computer Science, Tohoku University, Japan, 1988
  • B.Sc. Computer Science, Shandong University, China, 1982

Selected Recent Publications

  • 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 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
  • Q. Gu and G. Xu, Constant query time (1+ε)-approximate distance oracle for planar graphs, Theoretical Computer Science, Vol. 761, pages 78-88, 2019
  • 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