Dian Ouyang

According to our database, Dian Ouyang authored at least 22 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

TRIM: An Efficient Framework for Exact Eccentricity Computation on Large-Scale Graphs.

Dian Ouyang, Jiajie Lin, Li Wentao, Fan Zhang, Jianye Yang, Xi Luo

Proc. VLDB Endow., December, 2025

Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks.

Weihao Yu, Dian Ouyang, Fan Zhang, Xiang Zhao, Shen Su, Xuemin Lin, Zhihong Tian

Proc. ACM Manag. Data, 2025

Graph-based Approximate Nearest Neighbor Search by Deep Reinforcement Routing.

Mingjie Li, Junhao Lin, Dian Ouyang, Ying Zhang, Wei Wang

Proceedings of the 33rd ACM International Conference on Multimedia, 2025

Weight-Constrained Simple Path Enumeration in Weighted Graph.

Dian Ouyang, Dong Wen, Jianye Yang, Wentao Li, Xuemin Lin

Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, V.1, 2025

Efficient Route and Area Matching Query in Dynamic Road Networks.

Yikun Wang, Dian Ouyang, Zhuoran Wang, Dong Wen, Xuemin Lin

Proceedings of the 41st IEEE International Conference on Data Engineering, 2025

Fairness-Aware Ride-Sharing Assignment.

Leshu Yuan, Ting Wang, Jianye Yang, Dian Ouyang

Proceedings of the Database Systems for Advanced Applications, 2025

2024

Multi-Source Shortest Path Query With Assembly Points on Large Graphs.

Dian Ouyang, Zhuoran Wang, Fan Zhang, Shiyu Yang, Jianye Yang, Xuemin Lin

IEEE Trans. Knowl. Data Eng., December, 2024

Efficient Maximal Biclique Enumeration on Large Signed Bipartite Graphs.

Jianhua Wang, Jianye Yang, Zhaoquan Gu, Dian Ouyang, Zhihong Tian, Xuemin Lin

IEEE Trans. Knowl. Data Eng., September, 2024

Efficient Regular Simple Path Queries under Transitive Restricted Expressions.

Qi Liang, Dian Ouyang, Fan Zhang, Jianye Yang, Xuemin Lin, Zhihong Tian

Proc. VLDB Endow., March, 2024

Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution.

Fan Zhang, Haicheng Guo, Dian Ouyang, Shiyu Yang, Xuemin Lin, Zhihong Tian

IEEE Trans. Knowl. Data Eng., January, 2024

2023

When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks.

Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang

VLDB J., November, 2023

(p,q)-biclique counting and enumeration for large sparse bipartite graphs.

Jianye Yang, Yun Peng, Dian Ouyang, Wenjie Zhang, Xuemin Lin, Xiang Zhao

VLDB J., September, 2023

Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs.

Jiujing Zhang, Shiyu Yang, Dian Ouyang, Fan Zhang, Xuemin Lin, Long Yuan

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Parallelize Accelerated Triangle Counting Using Bit-Wise on GPU.

Li Lin, Dian Ouyang, Zhipeng He, Chengqian Li

Proceedings of the Web Information Systems and Applications, 2023

2022

Learning Hypersphere for Few-shot Anomaly Detection on Attributed Networks.

Qiuyu Guo, Xiang Zhao, Yang Fang, Shiyu Yang, Xuemin Lin, Dian Ouyang

Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

2021

Truss Decomposition on Multilayer Graphs.

Hongxuan Huang, Qingyuan Linghu, Fan Zhang, Dian Ouyang, Shiyu Yang

Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), 2021

2020

Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees.

Dian Ouyang, Long Yuan, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin

Proc. VLDB Endow., 2020

Progressive Top-K Nearest Neighbors Search in Large Road Networks.

Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin

Proceedings of the 2020 International Conference on Management of Data, 2020

Speeding Up GED Verification for Graph Similarity Search.

Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin, Wenjie Zhang, Dian Ouyang

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

2019

Efficient shortest distance query processing and indexing on large road network

Dian Ouyang

PhD thesis, 2019

2018

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

Proceedings of the 2018 International Conference on Management of Data, 2018

Towards Efficient Path Skyline Computation in Bicriteria Networks.

Dian Ouyang, Long Yuan, Fan Zhang, Lu Qin, Xuemin Lin

Proceedings of the Database Systems for Advanced Applications, 2018