Dian Ouyang - RankMe

22 papers A* 4A 1Misc 1Journal 9Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Efficient Route and Area Matching Query in Dynamic Road Networks. ICDE Yikun Wang, Dian Ouyang, Zhuoran Wang, Dong Wen, Xuemin Lin
2025	—	`conf`	Fairness-Aware Ride-Sharing Assignment. DASFAA (2) Leshu Yuan, Ting Wang, Jianye Yang, Dian Ouyang
2025	A*	`conf`	Graph-based Approximate Nearest Neighbor Search by Deep Reinforcement Routing. ACM Multimedia Mingjie Li, Junhao Lin, Dian Ouyang, Ying Zhang, Wei Wang
2025	J	`jnl`	Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks. Proc. ACM Manag. Data Weihao Yu, Dian Ouyang, Fan Zhang, Xiang Zhao, Shen Su, Xuemin Lin, Zhihong Tian
2025	J	`jnl`	TRIM: An Efficient Framework for Exact Eccentricity Computation on Large-Scale Graphs. Proc. VLDB Endow. Dian Ouyang, Jiajie Lin, Li Wentao, Fan Zhang, Jianye Yang, Xi Luo
2025	—	`conf`	Weight-Constrained Simple Path Enumeration in Weighted Graph. KDD (1) Dian Ouyang, Dong Wen, Jianye Yang, Wentao Li, Xuemin Lin
2024	J	`jnl`	Efficient Maximal Biclique Enumeration on Large Signed Bipartite Graphs. IEEE Trans. Knowl. Data Eng. Jianhua Wang, Jianye Yang, Zhaoquan Gu, Dian Ouyang, Zhihong Tian, Xuemin Lin
2024	J	`jnl`	Efficient Regular Simple Path Queries under Transitive Restricted Expressions. Proc. VLDB Endow. Qi Liang, Dian Ouyang, Fan Zhang, Jianye Yang, Xuemin Lin, Zhihong Tian
2024	J	`jnl`	Multi-Source Shortest Path Query With Assembly Points on Large Graphs. IEEE Trans. Knowl. Data Eng. Dian Ouyang, Zhuoran Wang, Fan Zhang, Shiyu Yang, Jianye Yang, Xuemin Lin
2024	J	`jnl`	Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution. IEEE Trans. Knowl. Data Eng. Fan Zhang, Haicheng Guo, Dian Ouyang, Shiyu Yang, Xuemin Lin, Zhihong Tian
2023	J	`jnl`	(p,q)-biclique counting and enumeration for large sparse bipartite graphs. VLDB J. Jianye Yang, Yun Peng, Dian Ouyang, Wenjie Zhang, Xuemin Lin, Xiang Zhao
2023	A*	`conf`	Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs. ICDE Jiujing Zhang, Shiyu Yang, Dian Ouyang, Fan Zhang, Xuemin Lin, Long Yuan
2023	Misc	`conf`	Parallelize Accelerated Triangle Counting Using Bit-Wise on GPU. WISA Li Lin, Dian Ouyang, Zhipeng He, Chengqian Li
2023	J	`jnl`	When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks. VLDB J. Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang
2022	A	`conf`	Learning Hypersphere for Few-shot Anomaly Detection on Attributed Networks. CIKM Qiuyu Guo, Xiang Zhao, Yang Fang, Shiyu Yang, Xuemin Lin, Dian Ouyang
2021	—	`conf`	Truss Decomposition on Multilayer Graphs. IEEE BigData Hongxuan Huang, Qingyuan Linghu, Fan Zhang, Dian Ouyang, Shiyu Yang
2020	J	`jnl`	Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees. Proc. VLDB Endow. Dian Ouyang, Long Yuan, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin
2020	—	`conf`	Progressive Top-K Nearest Neighbors Search in Large Road Networks. SIGMOD Conference Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin
2020	A*	`conf`	Speeding Up GED Verification for Graph Similarity Search. ICDE Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin, Wenjie Zhang, Dian Ouyang
2019	—	`—`	Efficient shortest distance query processing and indexing on large road network Dian Ouyang
2018	—	`conf`	Towards Efficient Path Skyline Computation in Bicriteria Networks. DASFAA (1) Dian Ouyang, Long Yuan, Fan Zhang, Lu Qin, Xuemin Lin
2018	—	`conf`	When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. SIGMOD Conference Dian Ouyang, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang, Qing Zhu