Qian-Ping Gu
Affiliations: | Simon Fraser University, Burnaby, British Columbia, Canada |
Area:
Computer ScienceGoogle:
"Qian-Ping Gu"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Gu Q, Liang JL, Zhang G. (2019) Efficient algorithms for ridesharing of personal vehicles Theoretical Computer Science. 788: 79-94 |
| Gu Q, Xu G. (2019) Constant query time (1 + ϵ)-approximate distance oracle for planar graphs Theoretical Computer Science. 761: 78-88 |
| Gu Q, Xu G. (2019) Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs Discrete Applied Mathematics. 257: 186-205 |
| Gu Q, Liang JL, Zhang G. (2017) Algorithmic analysis for ridesharing of personal vehicles Theoretical Computer Science. 749: 36-46 |
| Bian Z, Gu QP, Zhu M. (2016) Practical algorithms for branch-decompositions of planar graphs Discrete Applied Mathematics. 199: 156-171 |
| Marzban M, Gu QP, Jia X. (2016) New analysis and computational study for the planar connected dominating set problem Journal of Combinatorial Optimization. 32: 198-225 |
| Marzban M, Gu QP. (2013) Computational study on a PTAS for planar dominating set problem Algorithms. 6: 43-59 |
| Gu Q, Tamaki H. (2012) Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size Algorithmica. 64: 416-453 |
| Gu Q, Tamaki H. (2011) Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n 1+ ) time Theoretical Computer Science. 412: 4100-4109 |
| Marzban M, Gu QP, Jia X. (2009) Computational study on planar dominating set problem Theoretical Computer Science. 410: 5455-5466 |