Efficient algorithms for densest subgraph discovery Y Fang, K Yu, R Cheng, LVS Lakshmanan, X Lin
Proceedings of the VLDB Endowment 12 (11), 1719-1732, 2019
122 2019 Reconfigurable intelligent surface assisted massive MIMO with antenna selection J He, K Yu, Y Shi, Y Zhou, W Chen, KB Letaief
IEEE Transactions on Wireless Communications 21 (7), 4769-4783, 2021
41 2021 Coordinated passive beamforming for distributed intelligent reflecting surfaces network J He, K Yu, Y Shi
2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring), 1-5, 2020
34 2020 Reconfigurable Intelligent Surface Enhanced Cognitive Radio Networks J He, K Yu, Y Zhou, Y Shi
2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall), 1-5, 2020
29 2020 Efficient Algorithms for Maximal k-Biplex Enumeration K Yu, C Long, S Liu, D Yan
Proceedings of the 2022 International Conference on Management of Data, 860-873, 2022
26 2022 On Efficient Large Maximal Biplex Discovery K Yu, C Long, P Deepak, T Chakraborty
IEEE Transactions on Knowledge and Data Engineering, 2021
22 2021 Maximum k-biplex search on bipartite graphs: A symmetric-bk branching approach K Yu, C Long
Proceedings of the ACM on Management of Data 1 (1), 1-26, 2023
14 2023 Efficient K Wang, K Yu, C Long
Proceedings of the ACM on Management of Data 2 (1), 1-26, 2024
8 2024 Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach K Yu, C Long
Proceedings of the ACM on Management of Data 1 (3), 1-26, 2023
8 2023 Graph mining meets fake news detection K Yu, C Long
Data Science for Fake News: Surveys and Perspectives, 169-189, 2021
7 2021 On Searching Maximum Directed S Gao, K Yu, S Liu, C Long, Z Qiu
2024 IEEE 40th International Conference on Data Engineering (ICDE), 2570-2583, 2024
2 2024 Phase retrieval via difference of convex programming J He, M Fu, K Yu, Y Shi
2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring), 1-5, 2020
1 2020 Stochastic submodular maximization for scalable network adaptation in dense cloud-RAN K Yu, J He, Y Shi
ICC 2019-2019 IEEE International Conference on Communications (ICC), 1-6, 2019
1 2019 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach K Yu, K Wang, C Long, L Lakshmanan, R Cheng
arXiv preprint arXiv:2502.11557, 2025
2025 Efficient Maximum s -Bundle Search via Local Vertex Connectivity Y Liu, H Huang, K Yu, S Liu, C Long
Proceedings of the ACM on Management of Data 3 (1), 1-27, 2025
2025 Maximal Clique Enumeration with Hybrid Branching and Early Termination K Wang, K Yu, C Long
arXiv preprint arXiv:2412.08218, 2024
2024 Maximum S Gao, K Yu, S Liu, C Long
arXiv preprint arXiv:2406.00617, 2024
2024 Cohesive Subgraph Mining in Large Graphs K Yu
Nanyang Technological University, 2023
2023 
Cheng LongNanyang Technological UniversityПотвърден имейл адрес: ntu.edu.sg