| 2026 | ICDE | Reverse K Nearest Neighbor Query in Large Road Networks: a Tree Decomposition Based Approach. | Dian Ouyang, Boyu Zhang, Jianye Yang, Shiyu Yang, Chonghua Wang, Xuemin Lin |
| 2026 | ICDE | Maximum Balanced Clique Search on Large Directed Graphs. | Jianhua Wang, Jianye Yang, Zhaoquan Gu, Dian Ouyang, Ziyi Ma, Ying Zhang |
| 2025 | DASFAA | Fairness-Aware Ride-Sharing Assignment. | Leshu Yuan, Ting Wang, Jianye Yang, Dian Ouyang |
| 2025 | ICDE | Efficient Route and Area Matching Query in Dynamic Road Networks. | Yikun Wang, Dian Ouyang, Zhuoran Wang, Dong Wen, Xuemin Lin |
| 2025 | KDD | Weight-Constrained Simple Path Enumeration in Weighted Graph. | Dian Ouyang, Dong Wen, Jianye Yang, Wentao Li, Xuemin Lin |
| 2023 | ICDE | Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs. | Jiujing Zhang, Shiyu Yang, Dian Ouyang, Fan Zhang, Xuemin Lin, Long Yuan |
| 2022 | CIKM | Learning Hypersphere for Few-shot Anomaly Detection on Attributed Networks. | Qiuyu Guo, Xiang Zhao, Yang Fang, Shiyu Yang, Xuemin Lin, Dian Ouyang |
| 2020 | ICDE | Speeding Up GED Verification for Graph Similarity Search. | Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin, Wenjie Zhang, Dian Ouyang |
| 2020 | SIGMOD | Progressive Top-K Nearest Neighbors Search in Large Road Networks. | Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin |
| 2018 | DASFAA | Towards Efficient Path Skyline Computation in Bicriteria Networks. | Dian Ouyang, Long Yuan, Fan Zhang, Lu Qin, Xuemin Lin |
| 2018 | SIGMOD | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. | Dian Ouyang, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang, Qing Zhu |