Back to authors
Kaiqiang Yu
- Author ID
- 22487
- ORCID
-
0000-0003-1153-2902
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Nanyang Technological University
- Pagerank
- 0.086484534
- Overall Rank
- 818 | 96.12%
- 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 |
| 2,024 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
9.2907829e-05 |
| 2,453 |
Efficient Algorithms for Maximal k-Biplex Enumeration |
2022 |
SIGMOD |
8.5574945e-05 |
| 3,993 |
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy |
2024 |
SIGMOD |
6.9688824e-05 |
| 5,141 |
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach |
2023 |
SIGMOD |
6.3485708e-05 |
| 5,758 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
6.0972035e-05 |
| 7,032 |
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach |
2023 |
SIGMOD |
5.7222954e-05 |
| 9,540 |
Efficient Maximum s-Bundle Search via Local Vertex Connectivity |
2025 |
SIGMOD |
5.2528121e-05 |
| 9,551 |
Maximum k-Plex Search: An Alternated Reduction-and-Bound Method |
2025 |
VLDB |
5.2528121e-05 |
| 10,268 |
Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy |
2026 |
SIGMOD |
5.093636e-05 |
| 10,283 |
Querying Cohesive Subgraphs in Temporal Graphs |
2026 |
SIGMOD |
5.093636e-05 |
| 10,367 |
Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements |
2026 |
SIGMOD |
5.093636e-05 |
Frequent Co-authors
Co-authored at least 5 papers.