Back to authors
Fan Zhang
- Author ID
- o0000-0003-0548-0130
- ORCID
-
0000-0003-0548-0130
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Guangdong University of Technology
- Pagerank
- 0.076222856
- Overall Rank
- 948 | 95.63%
- 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 all 11 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 2,869 |
Hierarchical Core Maintenance on Large Dynamic Graphs |
2021 |
VLDB |
13 |
7.9197812e-05 |
| 4,095 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
13 |
6.8091843e-05 |
| 4,424 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
6 |
6.6029248e-05 |
| 4,580 |
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks |
2017 |
VLDB |
11 |
6.5195194e-05 |
| 6,468 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5 |
5.7724639e-05 |
| 10,587 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 11,224 |
Most Similar Biclique Search at Scale |
2025 |
VLDB |
0 |
4.9769913e-05 |
| 11,529 |
Graph Summarization: Compactness Meets Efficiency |
2024 |
SIGMOD |
1 |
4.9769913e-05 |
| 11,560 |
Influence Maximization via Vertex Countering |
2024 |
VLDB |
3 |
4.9769913e-05 |
| 11,567 |
Efficient Regular Simple Path Queries under Transitive Restricted Expressions |
2024 |
VLDB |
0 |
4.9769913e-05 |
| 13,622 |
TRIM: An Efficient Framework for Exact Eccentricity Computation on Large-Scale Graphs |
2026 |
VLDB |
0 |
- |
Frequent Co-authors
Co-authored at least 5 papers.