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.093170077
- Overall Rank
- 755 | 96.52%
- Paper Count
- 12
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 12 of 12 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 2,042 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
9.1416822e-05 |
| 2,320 |
Efficient Algorithms for Maximal k-Biplex Enumeration |
2022 |
SIGMOD |
8.6448197e-05 |
| 3,610 |
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy |
2024 |
SIGMOD |
7.1643588e-05 |
| 4,612 |
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach |
2023 |
SIGMOD |
6.5021632e-05 |
| 5,880 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
5.9612878e-05 |
| 7,043 |
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach |
2023 |
SIGMOD |
5.6141221e-05 |
| 9,677 |
Efficient Maximum s-Bundle Search via Local Vertex Connectivity |
2025 |
SIGMOD |
5.1435978e-05 |
| 9,678 |
Maximum k-Plex Search: An Alternated Reduction-and-Bound Method |
2025 |
VLDB |
5.1435978e-05 |
| 10,481 |
Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,495 |
Querying Cohesive Subgraphs in Temporal Graphs |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,565 |
Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,797 |
Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound |
2026 |
VLDB |
4.9793485e-05 |
Frequent Co-authors
Co-authored at least 5 papers.