Mining Maximal Clique Summary with Effective Sampling. - Xiaofan Li 004; Rui Zhou 001; Yujun Dai; Lu Chen 008; Chengfei Liu; Qiang He 001; Yun Yang 001 (ICDM, 2019)

Efficiently Finding a Maximal Clique Summary via Effective Sampling. - Xiaofan Li 004; Rui Zhou 001; Lu Chen 008; Chengfei Liu; Qiang He 001; Yun Yang 001 (CoRR, 2020)

Finding a Summary for All Maximal Cliques. - Xiaofan Li 004; Rui Zhou 001; Lu Chen 008; Yong Zhang 002; Chengfei Liu; Qiang He 001; Yun Yang 001 (ICDE, 2021)

One Set to Cover All Maximal Cliques Approximately. - Xiaofan Li 004; Rui Zhou 001; Lu Chen 008; Chengfei Liu; Qiang He 001; Yun Yang 001 (SIGMOD Conference, 2022)

Quantum Algorithm for Maximum Biclique Problem. - Xiaofan Li 004; Prasenjit Mitra; Rui Zhou 001; Wolfgang Nejdl (CoRR, 2023)

Quantum Algorithms for the Maximum K-Plex Problem. - Xiaofan Li 004; Gao Cong; Rui Zhou 001 (ICDE, 2024)

Adversarial Mask Explainer for Graph Neural Networks. - Wei Zhang; Xiaofan Li 004; Wolfgang Nejdl (WWW, 2024)

Clique Comparator: A Fundamental Operator for Finding a Concise Clique Summary. - Xiaofan Li 004; Rui Zhou 001; Lu Chen 008; Chengfei Liu (ICDE, 2025)

Finding a Summary for All Maximal Bicliques. - Xintong Yu; Rui Zhou 001; Xiaofan Li 004; Lu Chen 008; Chengfei Liu (ICDE, 2025)