Back to authors
Wenjie Zhang
- Author ID
- o0000-0001-6572-2600
- ORCID
-
0000-0001-6572-2600
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- University of New South Wales
- Pagerank
- 0.59949158
- Overall Rank
- 39 | 99.82%
- Paper Count
- 77
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 27 of 77 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 9,474 |
Accelerating Core Decomposition in Billion-Scale Hypergraphs |
2025 |
SIGMOD |
5.1708619e-05 |
| 9,525 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates |
2015 |
SIGMOD |
5.1662415e-05 |
| 9,735 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
5.1349531e-05 |
| 9,805 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
5.1257999e-05 |
| 9,843 |
High-Ratio Compression for Machine-Generated Data |
2023 |
SIGMOD |
5.1223012e-05 |
| 9,864 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
5.1176637e-05 |
| 10,300 |
MAVIS: Materialized View for Subgraph Matching |
2026 |
SIGMOD |
5.0415903e-05 |
| 10,479 |
Maintaining Biconnected Components in Streaming Graphs |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,485 |
Nucleus Decomposition Revisited: An Efficient Counting-Based Approach |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,600 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,603 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,617 |
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,634 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,705 |
Efficient Temporal Subgraph Management: A New Interval Index |
2026 |
VLDB |
4.9793485e-05 |
| 10,806 |
Efficient Hyper-truss Decomposition over Hypergraphs |
2026 |
VLDB |
4.9793485e-05 |
| 11,053 |
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching |
2026 |
VLDB |
4.9793485e-05 |
| 11,066 |
Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation |
2026 |
VLDB |
4.9793485e-05 |
| 11,175 |
AJOSC: Adaptive Join Order Selection for Continuous Queries |
2025 |
SIGMOD |
4.9793485e-05 |
| 11,215 |
Most Similar Biclique Search at Scale |
2025 |
VLDB |
4.9793485e-05 |
| 11,257 |
ACE: A Cardinality Estimator for Set-Valued Queries |
2025 |
VLDB |
4.9793485e-05 |
| 11,286 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
4.9793485e-05 |
| 11,334 |
LogLite: Lightweight Plug-and-Play Streaming Log Compression |
2025 |
VLDB |
4.9793485e-05 |
| 11,446 |
Efficient Computation of Hyper-triangles on Hypergraphs |
2025 |
VLDB |
4.9793485e-05 |
| 11,523 |
Graph Summarization: Compactness Meets Efficiency |
2024 |
SIGMOD |
4.9793485e-05 |
| 11,600 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
4.9793485e-05 |
| 11,768 |
Efficient Non-Learning Similar Subtrajectory Search |
2023 |
VLDB |
4.9793485e-05 |
| 11,919 |
Online Ridesharing with Meeting Points |
2022 |
VLDB |
4.9793485e-05 |
Frequent Co-authors
Co-authored at least 5 papers.