Back to authors
Wenjie Zhang
- Author ID
- 5524
- 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.59719415
- Overall Rank
- 40 | 99.81%
- Paper Count
- 76
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 26 of 76 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 9,622 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
5.2434488e-05 |
| 9,625 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
5.2434488e-05 |
| 9,673 |
High-Ratio Compression for Machine-Generated Data |
2023 |
SIGMOD |
5.2383683e-05 |
| 9,688 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
5.2351259e-05 |
| 10,084 |
MAVIS: Materialized View for Subgraph Matching |
2026 |
SIGMOD |
5.1573064e-05 |
| 10,266 |
Maintaining Biconnected Components in Streaming Graphs |
2026 |
SIGMOD |
5.093636e-05 |
| 10,273 |
Nucleus Decomposition Revisited: An Efficient Counting-Based Approach |
2026 |
SIGMOD |
5.093636e-05 |
| 10,408 |
Time-Critical Influence Minimization via Node Blocking |
2026 |
SIGMOD |
5.093636e-05 |
| 10,411 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
5.093636e-05 |
| 10,428 |
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] |
2026 |
SIGMOD |
5.093636e-05 |
| 10,446 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
5.093636e-05 |
| 10,520 |
Efficient Temporal Subgraph Management: A New Interval Index |
2026 |
VLDB |
5.093636e-05 |
| 10,606 |
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching |
2026 |
VLDB |
5.093636e-05 |
| 10,620 |
Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation |
2026 |
VLDB |
5.093636e-05 |
| 10,749 |
AJOSC: Adaptive Join Order Selection for Continuous Queries |
2025 |
SIGMOD |
5.093636e-05 |
| 10,802 |
Most Similar Biclique Search at Scale |
2025 |
VLDB |
5.093636e-05 |
| 10,851 |
ACE: A Cardinality Estimator for Set-Valued Queries |
2025 |
VLDB |
5.093636e-05 |
| 10,885 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
5.093636e-05 |
| 10,924 |
On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing |
2025 |
VLDB |
5.093636e-05 |
| 10,946 |
LogLite: Lightweight Plug-and-Play Streaming Log Compression |
2025 |
VLDB |
5.093636e-05 |
| 11,067 |
Machine Learning for Graph Data Management and Query Processing |
2025 |
VLDB |
5.093636e-05 |
| 11,094 |
Efficient Computation of Hyper-triangles on Hypergraphs |
2025 |
VLDB |
5.093636e-05 |
| 11,178 |
Graph Summarization: Compactness Meets Efficiency |
2024 |
SIGMOD |
5.093636e-05 |
| 11,272 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
5.093636e-05 |
| 11,456 |
Efficient Non-Learning Similar Subtrajectory Search |
2023 |
VLDB |
5.093636e-05 |
| 11,611 |
Online Ridesharing with Meeting Points |
2022 |
VLDB |
5.093636e-05 |
Frequent Co-authors
Co-authored at least 5 papers.