| 2026 | ICDE | Minimum $k$-Vertex Connected Graph Search (Extended Abstract). | Yang Liu, Hejiao Huang, Kaiqiang Yu, Shengxin Liu, Cheng Long |
| 2026 | ICDE | Listing Minimal Cores in Large Real-World Graphs. | Yukai Sun, Kaiqiang Yu, Shengxin Liu, Cheng Long, Raymond Chi-Wing Wong, Xun Zhou, Min Zhang |
| 2025 | ICDE | Maximal Clique Enumeration with Hybrid Branching and Early Termination. | Kaixin Wang, Kaiqiang Yu, Cheng Long |
| 2025 | KDD | Maximum Degree-Based Quasi-Clique Search via an Iterative Framework. | Hongbo Xia, Kaiqiang Yu, Shengxin Liu, Cheng Long, Xun Zhou |
| 2025 | SIGMOD | Reproducibility Report for ACM SIGMOD 2025 Paper: 'Auto-Test: Learning Semantic-Domain Constraints for Unsupervised Error Detection in Tables'. | Sebastian Baunsgaard, Kaiqiang Yu |
| 2024 | ICDE | On Searching Maximum Directed (k, 𝓁)-Plex. | Shuohao Gao, Kaiqiang Yu, Shengxin Liu, Cheng Long, Zelong Qiu |
| 2024 | SIGMOD | Reproducibility Report for ACM SIGMOD 2024 Paper: 'Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach'. | Hein Meling, Yue Gong, Kaiqiang Yu, Cheng Long |
| 2024 | SIGMOD | Reproducibility Report for ACM SIGMOD 2024 Paper: 'PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware'. | Mo Sha, Kaiqiang Yu, Shuangyu Cai, Boyu Tian, Huanchen Zhang, Mingyu Gao |
| 2022 | ICDE | On Efficient Large Maximal Biplex Discovery (Extended abstract). | Kaiqiang Yu, Cheng Long, Deepak P, Tanmoy Chakraborty |
| 2022 | SIGMOD | Efficient Algorithms for Maximal k-Biplex Enumeration. | Kaiqiang Yu, Cheng Long, Shengxin Liu, Da Yan |
| 2020 | VTC | Phase Retrieval via Difference of Convex Programming. | Jinglian He, Min Fu, Kaiqiang Yu, Yuanming Shi |
| 2020 | VTC | Coordinated Passive Beamforming for Distributed Intelligent Reflecting Surfaces Network. | Jinglian He, Kaiqiang Yu, Yuanming Shi |
| 2020 | VTC | Reconfigurable Intelligent Surface Enhanced Cognitive Radio Networks. | Jinglian He, Kaiqiang Yu, Yong Zhou, Yuanming Shi |
| 2019 | APWEB | Iterative Hypergraph Computation Based on Hyperedge-Connected Graphs. | Kaiqiang Yu, Yu Gu, Shuo Yao, Zhen Song, Ge Yu |