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.096120215
- Overall Rank
- 730 | 96.63%
- 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 all 13 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 3,376 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
14 |
7.3556068e-05 |
| 4,224 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
7 |
6.7185455e-05 |
| 6,292 |
QTCS: Efficient Query-Centered Temporal Community Search |
2024 |
VLDB |
7 |
5.8197041e-05 |
| 8,025 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
6 |
5.4035905e-05 |
| 8,232 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
4 |
5.3714879e-05 |
| 8,428 |
Truss Decomposition in Hypergraphs |
2025 |
VLDB |
1 |
5.3324907e-05 |
| 9,579 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
3 |
5.154741e-05 |
| 9,872 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
1 |
5.115241e-05 |
| 9,922 |
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs |
2024 |
VLDB |
2 |
5.1079647e-05 |
| 10,334 |
Parallel Colorful h-star Core Maintenance in Dynamic Graphs |
2023 |
VLDB |
2 |
5.0309635e-05 |
| 10,544 |
Scaling Up k-Clique Percolation Community Detection |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,839 |
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 10,869 |
Maximum Defective Biclique Search in Large Bipartite Graphs |
2026 |
VLDB |
0 |
4.9769913e-05 |
Frequent Co-authors
Co-authored at least 5 papers.