Back to authors
Renchi Yang
- Author ID
- o0000-0002-7284-3096
- 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.086192789
- Overall Rank
- 830 | 96.17%
- 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 all 12 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 1,836 |
Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank |
2020 |
VLDB |
18 |
9.53235e-05 |
| 3,655 |
Realtime Top-k Personalized PageRank over Large Graphs on GPUs |
2020 |
VLDB |
14 |
7.1254436e-05 |
| 3,915 |
Scaling Attributed Network Embedding to Massive Graphs |
2021 |
VLDB |
8 |
6.9259863e-05 |
| 5,277 |
Efficient Estimation of Pairwise Effective Resistance |
2023 |
SIGMOD |
5 |
6.1978354e-05 |
| 5,564 |
Scalable and Effective Bipartite Network Embedding |
2022 |
SIGMOD |
6 |
6.081296e-05 |
| 5,945 |
Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs |
2020 |
VLDB |
4 |
5.935682e-05 |
| 6,035 |
Efficient Estimation of Heat Kernel PageRank for Local Clustering |
2019 |
SIGMOD |
10 |
5.9065619e-05 |
| 8,364 |
Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation |
2023 |
SIGMOD |
3 |
5.3450813e-05 |
| 10,038 |
Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization |
2021 |
VLDB |
1 |
5.0901047e-05 |
| 10,267 |
Efficient High-Quality Clustering for Large Bipartite Graphs |
2024 |
SIGMOD |
2 |
5.0480912e-05 |
| 11,711 |
Effective and Efficient PageRank-based Positioning for Graph Visualization |
2023 |
SIGMOD |
0 |
4.9769913e-05 |
| 13,585 |
Effective Clustering for Large Multi-Relational Graphs |
2026 |
SIGMOD |
0 |
- |
Frequent Co-authors
Co-authored at least 5 papers.