| 2025 | IWOCA | Average Sensitivity of Breadth-First Search Algorithms on Grids. | Ryan Assari, Qian-Ping Gu |
| 2025 | IWOCA | Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile. | Qian-Ping Gu, Jiajian Leo Liang |
| 2023 | COCOA | Algorithms for the Ridesharing with Profit Constraint Problem. | Qian-Ping Gu, Jiajian Leo Liang |
| 2021 | AAIM | An Efficient Oracle for Counting Shortest Paths in Planar Graphs. | Ye Gong, Qian-Ping Gu |
| 2021 | ISAAC | Multimodal Transportation with Ridesharing of Personal Vehicles. | Qian-Ping Gu, Jiajian Leo Liang |
| 2020 | COCOA | Approximate Ridesharing of Personal Vehicles Problem. | Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang |
| 2017 | COCOA | Efficient Algorithms for Ridesharing of Personal Vehicles. | Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang |
| 2016 | COCOA | Algorithmic Analysis for Ridesharing of Personal Vehicles. | Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang |
| 2015 | ISAAC | Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs. | Qian-Ping Gu, Gengchun Xu |
| 2014 | WG | Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs. | Qian-Ping Gu, Gengchun Xu |
| 2011 | ISAAC | Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem. | Chunhao Wang, Qian-Ping Gu |
| 2010 | COCOA | Computational Study for Planar Connected Dominating Set Problem. | Marjan Marzban, Qian-Ping Gu, Xiaohua Jia |
| 2010 | ISAAC | Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. | Qian-Ping Gu, Hisao Tamaki |
| 2009 | ISAAC | Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in | Qian-Ping Gu, Hisao Tamaki |
| 2008 | ALENEX | Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. | Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake |
| 2008 | COCOA | Computational Study on Dominating Set Problem of Planar Graphs. | Marjan Marzban, Qian-Ping Gu, Xiaohua Jia |
| 2007 | GLOBECOM | Maximizing Throughput for Traffic Grooming with Limited Grooming Resources. | Yong Wang, Qian-Ping Gu |
| 2007 | ICCCN | A Min-Max Optimization Problem on Traffic Grooming in WDM Optical Networks. | Yong Wang, Qian-Ping Gu |
| 2006 | ICPP | Efficient Algorithms for Traffic Grooming in SONET/WDM Networks. | Yong Wang, Qian-Ping Gu |
| 2005 | ICALP | Optimal Branch-Decomposition of Planar Graphs in | Qian-Ping Gu, Hisao Tamaki |
| 2004 | ICPADS | Wavelength Assignment on Bounded Degree Trees of Rings. | Zhengbing Bian, Qian-Ping Gu, Xiao Zhou |
| 2003 | HiPC | Efficient Algorithm for Embedding Hypergraphs in a Cycle. | Qian-Ping Gu, Yong Wang |
| 2002 | ICPP | On-line Permutation Routing on WDM All-Optical Networks. | Qian-Ping Gu |
| 2001 | ICPADS | Multicasts on WDM All-Optical Multistage Interconnection Networks. | Xinchen Liu, Qian-Ping Gu |
| 2000 | ICPP | Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. | Qian-Ping Gu, Shietung Peng |
| 1998 | ICPADS | Routing in Hypercubes with Large Number of Faulty Nodes. | Qian-Ping Gu, Shietung Peng |
| 1998 | ICPP | Cluster Fault Tolerant Routing in Hypercubes. | Qian-Ping Gu, Shietung Peng |
| 1997 | ISAAC | Multi-Color Routing in the Undirected Hypercube. | Qian-Ping Gu, Hisao Tamaki |
| 1997 | PDPTA | A Distributed Algorithm for Leader Election from a Partially Ordered Set on a Coterie. | Zixue Cheng, Qian-Ping Gu |
| 1996 | ICPADS | An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. | Qian-Ping Gu, Shietung Peng |
| 1994 | ICPADS | Algorithms for Node Disjoint Paths in Incomplete Star Networks. | Qian-Ping Gu, Shietung Peng |
| 1994 | ISAAC | Average Time Complexity of the SAT 1.2 Algorithm. | Jun Gu, Qian-Ping Gu |
| 1994 | ISAAC | k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. | Qian-Ping Gu, Shietung Peng |