Back to authors
Qiangqiang Dai
- Author ID
- 23024
- ORCID
-
0000-0002-8569-6558
- Links
-
(found by gpt-5.2 on feb 8th, 2026)
- Most Frequent Institution
- Beijing Institute of Technology
- Pagerank
- 0.083497074
- Overall Rank
- 836 | 96.00%
- 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 11 of 11 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 4,075 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.9825002e-05 |
| 5,294 |
Maximal Defective Clique Enumeration |
2023 |
SIGMOD |
6.34833e-05 |
| 5,497 |
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach |
2022 |
SIGMOD |
6.2648243e-05 |
| 6,226 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
6.0101131e-05 |
| 6,489 |
Theoretically and Practically Efficient Maximum Defective Clique Search |
2024 |
SIGMOD |
5.9220971e-05 |
| 7,020 |
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach |
2022 |
SIGMOD |
5.7819367e-05 |
| 9,260 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
5.3572577e-05 |
| 9,335 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
5.3449422e-05 |
| 10,119 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,960 |
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach |
2024 |
SIGMOD |
5.1725247e-05 |
| 10,962 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
5.1725247e-05 |
Frequent Co-authors
Co-authored at least 5 papers.