Back to authors
Dong Wen
- Author ID
- o0000-0002-0903-1503
- ORCID
-
0000-0002-0903-1503
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- University of New South Wales
- Pagerank
- 0.11987917
- Overall Rank
- 533 | 97.55%
- Paper Count
- 16
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 all 16 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 2,470 |
Efficient Structural Graph Clustering: An Index-Based Approach |
2018 |
VLDB |
14 |
8.4015437e-05 |
| 3,170 |
On Querying Historical K-Cores |
2021 |
VLDB |
23 |
7.5572564e-05 |
| 5,238 |
AeonG: An Efficient Built-in Temporal Support in Graph Databases |
2024 |
VLDB |
4 |
6.2021926e-05 |
| 5,357 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
7 |
6.1514562e-05 |
| 6,073 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
13 |
5.8780393e-05 |
| 6,209 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
8 |
5.8323161e-05 |
| 7,087 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
5 |
5.5882877e-05 |
| 9,514 |
Accelerating Core Decomposition in Billion-Scale Hypergraphs |
2025 |
SIGMOD |
2 |
5.151324e-05 |
| 10,556 |
Maintaining Biconnected Components in Streaming Graphs |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,562 |
Nucleus Decomposition Revisited: An Efficient Counting-Based Approach |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,719 |
High-Throughput k Nearest Neighbors Search in Road Networks |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,776 |
Efficient Temporal Subgraph Management: A New Interval Index |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,182 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
1 |
4.9605343e-05 |
| 11,595 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
2 |
4.9605343e-05 |
| 11,648 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs |
2024 |
VLDB |
4 |
4.9605343e-05 |
| 11,717 |
Expanding Reverse Nearest Neighbors |
2024 |
VLDB |
0 |
4.9605343e-05 |
Frequent Co-authors
Co-authored at least 5 papers.