Back to authors
Kaiqiang Yu
- Author ID
- o0000-0003-1153-2902
- ORCID
-
0000-0003-1153-2902
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Nanyang Technological University
- Pagerank
- 0.10013951
- Overall Rank
- 695 | 96.80%
- 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 |
| 1,995 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
40 |
9.2189157e-05 |
| 2,314 |
Efficient Algorithms for Maximal k-Biplex Enumeration |
2022 |
SIGMOD |
16 |
8.6412801e-05 |
| 3,597 |
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy |
2024 |
SIGMOD |
11 |
7.1598365e-05 |
| 4,606 |
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach |
2023 |
SIGMOD |
9 |
6.4898086e-05 |
| 5,895 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
3 |
5.9387634e-05 |
| 7,017 |
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach |
2023 |
SIGMOD |
8 |
5.6041834e-05 |
| 9,713 |
Efficient Maximum s-Bundle Search via Local Vertex Connectivity |
2025 |
SIGMOD |
3 |
5.124163e-05 |
| 9,714 |
Maximum k-Plex Search: An Alternated Reduction-and-Bound Method |
2025 |
VLDB |
3 |
5.124163e-05 |
| 10,395 |
Efficient Querying of Maximum Connectivity-Based Quasi-Cliques in Large Graphs |
2027 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,558 |
Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,572 |
Querying Cohesive Subgraphs in Temporal Graphs |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,639 |
Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,868 |
Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound |
2026 |
VLDB |
0 |
4.9605343e-05 |
Frequent Co-authors
Co-authored at least 5 papers.