Back to authors
Qiangqiang Dai
- Author ID
- o0000-0002-8569-6558
- ORCID
-
0000-0002-8569-6558
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Beijing Institute of Technology
- Pagerank
- 0.10475077
- Overall Rank
- 648 | 97.02%
- Paper Count
- 14
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 14 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 4,155 |
Maximal Defective Clique Enumeration |
2023 |
SIGMOD |
10 |
6.7613076e-05 |
| 4,244 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
7 |
6.6963298e-05 |
| 4,753 |
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach |
2022 |
SIGMOD |
8 |
6.4218566e-05 |
| 5,500 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
8 |
6.0910824e-05 |
| 5,569 |
Theoretically and Practically Efficient Maximum Defective Clique Search |
2024 |
SIGMOD |
7 |
6.0630474e-05 |
| 6,416 |
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach |
2022 |
SIGMOD |
10 |
5.7744984e-05 |
| 8,008 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
7 |
5.3916283e-05 |
| 8,251 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
5 |
5.3537264e-05 |
| 8,655 |
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach |
2024 |
SIGMOD |
6 |
5.2794257e-05 |
| 10,407 |
Scaling Up Density Decomposition on Massive Graphs |
2027 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,671 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,900 |
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 10,930 |
Maximum Defective Biclique Search in Large Bipartite Graphs |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,573 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
2 |
4.9605343e-05 |
Frequent Co-authors
Co-authored at least 5 papers.