Back to authors
Ying Zhang
- Author ID
- o0000-0002-2674-1638
- ORCID
-
0000-0002-2674-1638
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- University of Technology Sydney
- Pagerank
- 0.48777407
- Overall Rank
- 67 | 99.69%
- Paper Count
- 60
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 10 of 60 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 10,634 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
4.9793485e-05 |
| 11,066 |
Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation |
2026 |
VLDB |
4.9793485e-05 |
| 11,112 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
4.9793485e-05 |
| 11,286 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
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,540 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
4.9793485e-05 |
| 11,546 |
Towards a Converged Relational-Graph Optimization Framework |
2024 |
SIGMOD |
4.9793485e-05 |
| 11,595 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs |
2024 |
VLDB |
4.9793485e-05 |
| 11,600 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
4.9793485e-05 |
Frequent Co-authors
Co-authored at least 5 papers.