Back to authors
Dong Wen
- Author ID
- 20834
- ORCID
-
0000-0002-0903-1503
- Links
-
(found by gpt-5.2 on feb 8th, 2026)
- Most Frequent Institution
- University of New South Wales
- Pagerank
- 0.10699198
- Overall Rank
- 600 | 97.13%
- Paper Count
- 14
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 14 of 14 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 2,438 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.644621e-05 |
| 3,445 |
On Querying Historical K-Cores |
2021 |
VLDB |
7.4776468e-05 |
| 5,139 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
6.4143412e-05 |
| 5,952 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
6.0909845e-05 |
| 6,405 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
5.9523652e-05 |
| 7,312 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
5.703982e-05 |
| 7,845 |
AeonG: An Efficient Built-in Temporal Support in Graph Databases |
2024 |
VLDB |
5.6021364e-05 |
| 9,160 |
Accelerating Core Decomposition in Billion-Scale Hypergraphs |
2025 |
SIGMOD |
5.371468e-05 |
| 10,171 |
High-Throughput k Nearest Neighbors Search in Road Networks |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,232 |
Efficient Temporal Subgraph Management: A New Interval Index |
2026 |
VLDB |
5.1725247e-05 |
| 10,395 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
5.1725247e-05 |
| 10,988 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
5.1725247e-05 |
| 11,063 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs |
2024 |
VLDB |
5.1725247e-05 |
| 11,144 |
Expanding Reverse Nearest Neighbors |
2024 |
VLDB |
5.1725247e-05 |
Frequent Co-authors
Co-authored at least 5 papers.