Finding a summary for all maximal cliques X Li, R Zhou, L Chen, Y Zhang, C Liu, Q He, Y Yang 2021 IEEE 37th International Conference on Data Engineering (ICDE), 1344-1355, 2021 | 12 | 2021 |
Mining maximal clique summary with effective sampling X Li, R Zhou, Y Dai, L Chen, C Liu, Q He, Y Yang 2019 IEEE International Conference on Data Mining (ICDM), 1198-1203, 2019 | 9 | 2019 |
One set to cover all maximal cliques approximately X Li, R Zhou, L Chen, C Liu, Q He, Y Yang Proceedings of the 2022 International Conference on Management of Data, 2006 …, 2022 | 7 | 2022 |
Efficiently finding a maximal clique summary via effective sampling X Li, R Zhou, L Chen, C Liu, Q He, Y Yang arXiv preprint arXiv:2009.10376, 2020 | 2 | 2020 |
Quantum Algorithms for the Maximum K-Plex Problem X Li, G Cong, R Zhou 2024 IEEE 40th International Conference on Data Engineering (ICDE), 2435-2448, 2024 | 1 | 2024 |
Adversarial Mask Explainer for Graph Neural Networks W Zhang, X Li, W Nejdl Proceedings of the ACM on Web Conference 2024, 861-869, 2024 | 1 | 2024 |
Quantum Algorithm for Maximum Biclique Problem X Li, P Mitra, R Zhou, W Nejdl arXiv preprint arXiv:2309.04503, 2023 | | 2023 |