Back to authors
Dong Wen
- Author ID
- 20830
- 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.098082993
- Overall Rank
- 630 | 97.03%
- 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,436 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
8.8252104e-05 |
| 4,139 |
On Querying Historical K-Cores |
2021 |
VLDB |
6.415046e-05 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 6,503 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.0357715e-05 |
| 6,657 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
4.9720132e-05 |
| 7,576 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
4.7064285e-05 |
| 7,735 |
AeonG: An Efficient Built-in Temporal Support in Graph Databases |
2024 |
VLDB |
4.6644355e-05 |
| 9,146 |
Accelerating Core Decomposition in Billion-Scale Hypergraphs |
2025 |
SIGMOD |
4.3849295e-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 |
| 10,383 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,985 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
4.1945683e-05 |
| 11,060 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs |
2024 |
VLDB |
4.1945683e-05 |
| 11,141 |
Expanding Reverse Nearest Neighbors |
2024 |
VLDB |
4.1945683e-05 |
Frequent Co-authors
Co-authored at least 5 papers.