Iterative Hypergraph Computation Based on Hyperedge-Connected Graphs. - Kaiqiang Yu; Yu Gu 002; Shuo Yao; Zhen Song; Ge Yu 001 (APWeb/WAIM (1), 2019)

Stochastic Submodular Maximization for Scalable Network Adaptation in Dense Cloud-RAN. - Kaiqiang Yu; Jinglian He; Yuanming Shi (ICC, 2019)

Efficient Algorithms for Densest Subgraph Discovery. - Yixiang Fang; Kaiqiang Yu; Reynold Cheng; Laks V. S. Lakshmanan; Xuemin Lin 001 (Proc. VLDB Endow., 2019)

Phase Retrieval via Difference of Convex Programming. - Jinglian He; Min Fu 003; Kaiqiang Yu; Yuanming Shi (VTC Spring, 2020)

Coordinated Passive Beamforming for Distributed Intelligent Reflecting Surfaces Network. - Jinglian He; Kaiqiang Yu; Yuanming Shi (VTC Spring, 2020)

Reconfigurable Intelligent Surface Enhanced Cognitive Radio Networks. - Jinglian He; Kaiqiang Yu; Yong Zhou 006; Yuanming Shi (VTC Fall, 2020)

A partition approach for robust gait recognition based on gait template fusion. - Kejun Wang; Liangliang Liu; Xinnan Ding; Kaiqiang Yu; Gang Hu (Frontiers Inf. Technol. Electron. Eng., 2021)

On Efficient Large Maximal Biplex Discovery (Extended abstract). - Kaiqiang Yu; Cheng Long 001; Deepak P 001; Tanmoy Chakraborty 002 (ICDE, 2022)

Efficient Algorithms for Maximal k-Biplex Enumeration. - Kaiqiang Yu; Cheng Long 001; Shengxin Liu; Da Yan 001 (SIGMOD Conference, 2022)

Distributed Hypergraph Processing Using Intersection Graphs. - Yu Gu 002; Kaiqiang Yu; Zhen Song; Jianzhong Qi 001; Zhigang Wang 001; Ge Yu 001; Rui Zhang 003 (IEEE Trans. Knowl. Data Eng., 2022)

Reconfigurable Intelligent Surface Assisted Massive MIMO With Antenna Selection. - Jinglian He; Kaiqiang Yu; Yuanming Shi; Yong Zhou 006; Wei Chen 002; Khaled B. Letaief (IEEE Trans. Wirel. Commun., 2022)

Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach. - Kaiqiang Yu; Cheng Long 001 (Proc. ACM Manag. Data, 2023)

On Efficient Large Maximal Biplex Discovery. - Kaiqiang Yu; Cheng Long 001; Deepak P 001; Tanmoy Chakraborty 002 (IEEE Trans. Knowl. Data Eng., 2023)

Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach. - Kaiqiang Yu; Cheng Long 001 (Proc. ACM Manag. Data, 2023)

On Searching Maximum Directed (k, 𝓁)-Plex. - Shuohao Gao; Kaiqiang Yu; Shengxin Liu; Cheng Long 001; Zelong Qiu (ICDE, 2024)

Maximum k-Plex Search: An Alternated Reduction-and-Bound Method. - Shuohao Gao; Kaiqiang Yu; Shengxin Liu; Cheng Long 001 (CoRR, 2024)

Maximal Clique Enumeration with Hybrid Branching and Early Termination. - Kaixin Wang; Kaiqiang Yu; Cheng Long 001 (CoRR, 2024)

Efficient k-Clique Listing: An Edge-Oriented Branching Strategy. - Kaixin Wang; Kaiqiang Yu; Cheng Long 001 (Proc. ACM Manag. Data, 2024)

Maximum k-Plex Search: An Alternated Reduction-and-Bound Method. - Shuohao Gao; Kaiqiang Yu; Shengxin Liu; Cheng Long 001 (Proc. VLDB Endow., 2024)

Maximal Clique Enumeration with Hybrid Branching and Early Termination. - Kaixin Wang; Kaiqiang Yu; Cheng Long (ICDE, 2025)

Efficient Maximum s-Bundle Search via Local Vertex Connectivity. - Yang Liu 227; Hejiao Huang; Kaiqiang Yu; Shengxin Liu; Cheng Long 001 (Proc. ACM Manag. Data, 2025)

Maximum Degree-Based Quasi-Clique Search via an Iterative Framework. - Hongbo Xia; Kaiqiang Yu; Shengxin Liu; Cheng Long 001; Xun Zhou 001 (CoRR, 2025)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach. - Kaiqiang Yu; Kaixin Wang; Cheng Long 001; Laks V. S. Lakshmanan; Reynold Cheng (Proc. ACM Manag. Data, 2025)

Minimum $k$k-Vertex Connected Graph Search. - Yang Liu 227; Hejiao Huang; Kaiqiang Yu; Shengxin Liu; Cheng Long 001 (IEEE Trans. Knowl. Data Eng., 2025)

Temporal k-Core Query, Revisited. - Yinyu Liu; Kaiqiang Yu; Shengxin Liu; Cheng Long 001; Zhaoquan Gu (CoRR, 2025)

On Searching and Querying Maximum Directed $(k, ell )$(k,ℓ)-Plex. - Shuohao Gao; Kaiqiang Yu; Shengxin Liu; Cheng Long 001; Xun Zhou 001 (IEEE Trans. Knowl. Data Eng., 2025)