Back to authors

Dian Ouyang

Author ID: 19000
ORCID: 0000-0002-9472-4389
Links: (found by gpt-5.2 on feb 11 2026)
Most Frequent Institution: Guangdong University of Technology
Pagerank: 0.051905172
Overall Rank: 1,356 | 93.61%
Paper Count: 8

Affiliation Timeline

Guangdong University of Technology Most frequent 2024 - 2026 | 5 papers
University of Sydney 2020 | 2 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
2,201	When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks	2018	SIGMOD	9.3048105e-05
2,547	Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees	2020	VLDB	8.5683079e-05
6,503	Progressive Top-K Nearest Neighbors Search in Large Road Networks	2020	SIGMOD	5.0357715e-05
10,088	Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks	2026	SIGMOD	4.1945683e-05
10,171	High-Throughput k Nearest Neighbors Search in Road Networks	2026	SIGMOD	4.1945683e-05
10,232	Efficient Temporal Subgraph Management: A New Interval Index	2026	VLDB	4.1945683e-05
11,014	Efficient Regular Simple Path Queries under Transitive Restricted Expressions	2024	VLDB	4.1945683e-05
13,090	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	15	0.86575139