Back to authors
Renchi Yang
- Author ID
- 19833
- ORCID
-
0000-0002-7284-3096
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Hong Kong Baptist University
- Pagerank
- 0.086639098
- Overall Rank
- 817 | 96.12%
- Paper Count
- 12
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 12 of 12 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 1,968 |
Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank |
2020 |
VLDB |
9.3752727e-05 |
| 3,896 |
Scaling Attributed Network Embedding to Massive Graphs |
2021 |
VLDB |
7.0406415e-05 |
| 4,225 |
Realtime Top-k Personalized PageRank over Large Graphs on GPUs |
2020 |
VLDB |
6.821373e-05 |
| 5,157 |
Efficient Estimation of Pairwise Effective Resistance |
2023 |
SIGMOD |
6.3409526e-05 |
| 5,432 |
Scalable and Effective Bipartite Network Embedding |
2022 |
SIGMOD |
6.2211042e-05 |
| 5,826 |
Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs |
2020 |
VLDB |
6.074674e-05 |
| 5,913 |
Efficient Estimation of Heat Kernel PageRank for Local Clustering |
2019 |
SIGMOD |
6.0439971e-05 |
| 8,188 |
Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation |
2023 |
SIGMOD |
5.4703528e-05 |
| 9,849 |
Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization |
2021 |
VLDB |
5.2094004e-05 |
| 11,163 |
Efficient High-Quality Clustering for Large Bipartite Graphs |
2024 |
SIGMOD |
5.093636e-05 |
| 11,390 |
Effective and Efficient PageRank-based Positioning for Graph Visualization |
2023 |
SIGMOD |
5.093636e-05 |
| 13,289 |
Effective Clustering for Large Multi-Relational Graphs |
2026 |
SIGMOD |
- |
Frequent Co-authors
Co-authored at least 5 papers.