Back to authors
Fan Zhang
- Author ID
- 20816
- ORCID
-
0000-0003-0548-0130
- Links
-
(found by gpt-5.2 on feb 8th, 2026)
- Most Frequent Institution
- Guangdong University of Technology
- Pagerank
- 0.072111617
- Overall Rank
- 920 | 95.67%
- Paper Count
- 11
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 11 of 11 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 3,273 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
7.2956944e-05 |
| 3,321 |
Hierarchical Core Maintenance on Large Dynamic Graphs |
2021 |
VLDB |
7.223972e-05 |
| 4,394 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.224902e-05 |
| 4,728 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
5.968586e-05 |
| 6,588 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5.0020648e-05 |
| 10,088 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,530 |
Most Similar Biclique Search at Scale |
2025 |
VLDB |
4.1945683e-05 |
| 10,964 |
Graph Summarization: Compactness Meets Efficiency |
2024 |
SIGMOD |
4.1945683e-05 |
| 11,005 |
Influence Maximization via Vertex Countering |
2024 |
VLDB |
4.1945683e-05 |
| 11,014 |
Efficient Regular Simple Path Queries under Transitive Restricted Expressions |
2024 |
VLDB |
4.1945683e-05 |
| 13,090 |
TRIM: An Efficient Framework for Exact Eccentricity Computation on Large-Scale Graphs |
2026 |
VLDB |
- |
Frequent Co-authors
Co-authored at least 5 papers.