Towards Efficient Path Skyline Computation in Bicriteria Networks. - Dian Ouyang; Long Yuan 001; Fan Zhang 036; Lu Qin 001; Xuemin Lin 001 (DASFAA (1), 2018)

When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. - Dian Ouyang; Lu Qin 001; Lijun Chang; Xuemin Lin 001; Ying Zhang 001; Qing Zhu (SIGMOD Conference, 2018)

Efficient shortest distance query processing and indexing on large road network - Dian Ouyang (2019)

Speeding Up GED Verification for Graph Similarity Search. - Lijun Chang; Xing Feng; Xuemin Lin 001; Lu Qin 001; Wenjie Zhang 001; Dian Ouyang (ICDE, 2020)

Progressive Top-K Nearest Neighbors Search in Large Road Networks. - Dian Ouyang; Dong Wen 001; Lu Qin 001; Lijun Chang; Ying Zhang 001; Xuemin Lin 001 (SIGMOD Conference, 2020)

Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees. - Dian Ouyang; Long Yuan 001; Lu Qin 001; Lijun Chang; Ying Zhang 001; Xuemin Lin 001 (Proc. VLDB Endow., 2020)

Truss Decomposition on Multilayer Graphs. - Hongxuan Huang; Qingyuan Linghu; Fan Zhang 036; Dian Ouyang; Shiyu Yang (IEEE BigData, 2021)

Learning Hypersphere for Few-shot Anomaly Detection on Attributed Networks. - Qiuyu Guo; Xiang Zhao 002; Yang Fang 001; Shiyu Yang; Xuemin Lin 001; Dian Ouyang (CIKM, 2022)

Parallelize Accelerated Triangle Counting Using Bit-Wise on GPU. - Li Lin; Dian Ouyang; Zhipeng He 007; Chengqian Li (WISA, 2023)

Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs. - Jiujing Zhang; Shiyu Yang; Dian Ouyang; Fan Zhang 036; Xuemin Lin 001; Long Yuan 001 (ICDE, 2023)

(p,q)-biclique counting and enumeration for large sparse bipartite graphs. - Jianye Yang 001; Yun Peng 003; Dian Ouyang; Wenjie Zhang 001; Xuemin Lin 001; Xiang Zhao 002 (VLDB J., 2023)

When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks. - Dian Ouyang; Dong Wen 001; Lu Qin 001; Lijun Chang; Xuemin Lin 001; Ying Zhang 001 (VLDB J., 2023)

Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution. - Fan Zhang 036; Haicheng Guo; Dian Ouyang; Shiyu Yang; Xuemin Lin 001; Zhihong Tian (IEEE Trans. Knowl. Data Eng., 2024)

Efficient Regular Simple Path Queries under Transitive Restricted Expressions. - Qi Liang 006; Dian Ouyang; Fan Zhang 036; Jianye Yang 001; Xuemin Lin 001; Zhihong Tian (Proc. VLDB Endow., 2024)

Efficient Maximal Biclique Enumeration on Large Signed Bipartite Graphs. - Jianhua Wang; Jianye Yang 001; Zhaoquan Gu; Dian Ouyang; Zhihong Tian; Xuemin Lin 001 (IEEE Trans. Knowl. Data Eng., 2024)

Multi-Source Shortest Path Query With Assembly Points on Large Graphs. - Dian Ouyang; Zhuoran Wang; Fan Zhang 036; Shiyu Yang; Jianye Yang 001; Xuemin Lin 001 (IEEE Trans. Knowl. Data Eng., 2024)

Weight-Constrained Simple Path Enumeration in Weighted Graph. - Dian Ouyang; Dong Wen 001; Jianye Yang 001; Wentao Li 001; Xuemin Lin 001 (KDD (1), 2025)