Persistent community search in temporal networks RH Li, J Su, L Qin, JX Yu, Q Dai
2018 IEEE 34th International Conference on Data Engineering (ICDE), 797-808, 2018
145 2018 Efficient signed clique search in signed networks RH Li, Q Dai, L Qin, G Wang, X Xiao, JX Yu, S Qiao
2018 IEEE 34th International Conference on Data Engineering (ICDE), 245-256, 2018
42 2018 Improved algorithms for maximal clique search in uncertain networks RH Li, Q Dai, G Wang, Z Ming, L Qin, JX Yu
2019 IEEE 35th International Conference on Data Engineering (ICDE), 1178-1189, 2019
38 2019 Scaling Up Maximal k -plex Enumeration Q Dai, RH Li, H Qin, M Liao, G Wang
Proceedings of the 31st ACM International Conference on Information …, 2022
22 2022 Efficient personalized pagerank computation: A spanning forests sampling based approach M Liao, RH Li, Q Dai, G Wang
Proceedings of the 2022 International Conference on Management of Data, 2048 …, 2022
19 2022 Fast maximal clique enumeration on uncertain graphs: A pivot-based approach Q Dai, RH Li, M Liao, H Chen, G Wang
Proceedings of the 2022 international conference on management of data, 2034 …, 2022
19 2022 Lightning fast and space efficient k-clique counting X Ye, RH Li, Q Dai, H Chen, G Wang
Proceedings of the ACM Web Conference 2022, 1191-1202, 2022
17 2022 Signed clique search in signed networks: Concepts and algorithms RH Li, Q Dai, L Qin, G Wang, X Xiao, JX Yu, S Qiao
IEEE Transactions on Knowledge and Data Engineering 33 (2), 710-727, 2019
15 2019 Efficient biclique counting in large bipartite graphs X Ye, RH Li, Q Dai, H Qin, G Wang
Proceedings of the ACM on Management of Data 1 (1), 1-26, 2023
13 2023 Maximal defective clique enumeration Q Dai, RH Li, M Liao, G Wang
Proceedings of the ACM on Management of Data 1 (1), 1-26, 2023
13 2023 Efficient personalized pagerank computation: The power of variance-reduced monte carlo approaches M Liao, RH Li, Q Dai, H Chen, H Qin, G Wang
Proceedings of the ACM on Management of Data 1 (2), 1-26, 2023
12 2023 Core decomposition on uncertain graphs revisited Q Dai, RH Li, G Wang, R Mao, Z Zhang, Y Yuan
IEEE Transactions on Knowledge and Data Engineering 35 (1), 196-210, 2021
12 2021 Hereditary cohesive subgraphs enumeration on bipartite graphs: The power of pivot-based approaches Q Dai, RH Li, X Ye, M Liao, W Zhang, G Wang
Proceedings of the ACM on Management of Data 1 (2), 1-26, 2023
9 2023 Efficient resistance distance computation: The power of landmark-based approaches M Liao, RH Li, Q Dai, H Chen, H Qin, G Wang
Proceedings of the ACM on Management of Data 1 (1), 1-27, 2023
9 2023 Scaling up distance-generalized core decomposition Q Dai, RH Li, L Qin, G Wang, W Yang, Z Zhang, Y Yuan
Proceedings of the 30th ACM International Conference on Information …, 2021
6 2021 Incremental structural clustering for dynamic networks Y Chen, RH Li, Q Dai, Z Li, S Qiao, R Mao
International Conference on Web Information Systems Engineering, 123-134, 2017
5 2017 Efficient X Ye, RH Li, Q Dai, H Chen, G Wang
IEEE Transactions on Knowledge and Data Engineering 36 (4), 1518-1536, 2023
4 2023 Efficient and Provable Effective Resistance Computation on Large Graphs: An Index-based Approach M Liao, J Zhou, RH Li, Q Dai, H Chen, G Wang
Proceedings of the ACM on Management of Data 2 (3), 1-27, 2024
2 2024 Social relationship mining algorithm by multi-dimensional graph structural clustering ZJ Li, QQ Dai, RH Li, R Mao, SJ Qiao
Ruan Jian Xue Bao/Journal of Software 29 (3), 839-852, 2018
2 2018 Theoretically and Practically Efficient Maximum Defective Clique Search Q Dai, R Li, D Cui, G Wang
Proceedings of the ACM on Management of Data 2 (4), 1-27, 2024
1 2024 
Rong-Hua LiBeijing Institute of TechnologyVahvistettu sähköpostiosoite verkkotunnuksessa bit.edu.cn