Back to authors
Hongchao Qin
- Author ID
- o0000-0003-4364-0633
- ORCID
-
0000-0003-4364-0633
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Beijing Institute of Technology
- Pagerank
- 0.096142974
- Overall Rank
- 729 | 96.64%
- Paper Count
- 13
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 13 of 13 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 3,376 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
7.3590905e-05 |
| 4,224 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.7217275e-05 |
| 6,289 |
QTCS: Efficient Query-Centered Temporal Community Search |
2024 |
VLDB |
5.8224604e-05 |
| 8,020 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
5.4061498e-05 |
| 8,226 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
5.3740319e-05 |
| 8,419 |
Truss Decomposition in Hypergraphs |
2025 |
VLDB |
5.3350162e-05 |
| 9,571 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
5.1571823e-05 |
| 9,865 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
5.1176637e-05 |
| 9,915 |
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs |
2024 |
VLDB |
5.1103839e-05 |
| 10,327 |
Parallel Colorful h-star Core Maintenance in Dynamic Graphs |
2023 |
VLDB |
5.0333462e-05 |
| 10,533 |
Scaling Up k-Clique Percolation Community Detection |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,829 |
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search |
2026 |
VLDB |
4.9793485e-05 |
| 10,860 |
Maximum Defective Biclique Search in Large Bipartite Graphs |
2026 |
VLDB |
4.9793485e-05 |
Frequent Co-authors
Co-authored at least 5 papers.