Back to authors

Dian Ouyang

Author ID: 19183
ORCID: 0000-0002-9472-4389
Links: (found by gpt-5.6-luna on jul 24 2026)
Most Frequent Institution: Guangdong University of Technology
Pagerank: 0.055990927
Overall Rank: 1,334 | 93.66%
Paper Count: 8

Affiliation Timeline

Guangdong University of Technology Most frequent 2024 - 2026 | 5 papers
University of Sydney 2020 | 2 papers
Nanjing University 2020 | 1 papers
University of Technology Sydney 2018 | 1 papers

Incoming Non-self Citations Over Time

Total yearly non-self incoming citations across all papers by this author.

Publications by Paper Pagerank

Showing 8 of 8 publications.

Rank	Title	Year	Venue	Pagerank
1,613	When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks	2018	SIGMOD	0.00010216983
2,097	Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees	2020	VLDB	9.1725037e-05
5,987	Progressive Top-K Nearest Neighbors Search in Large Road Networks	2020	SIGMOD	6.0183678e-05
10,379	Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks	2026	SIGMOD	5.093636e-05
10,460	High-Throughput k Nearest Neighbors Search in Road Networks	2026	SIGMOD	5.093636e-05
10,520	Efficient Temporal Subgraph Management: A New Interval Index	2026	VLDB	5.093636e-05
11,225	Efficient Regular Simple Path Queries under Transitive Restricted Expressions	2024	VLDB	5.093636e-05
13,294	TRIM: An Efficient Framework for Exact Eccentricity Computation on Large-Scale Graphs	2026	VLDB	-

Frequent Co-authors

Co-authored at least 5 papers.

Co-author	Shared Papers	Rank	Pagerank
Xuemin Lin	6	11	0.93439573