| 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 | 137 | 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 | 40 | 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 | 35 | 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 | 21 | 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 | 16 | 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 | 16 | 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 |
| 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 | 14 | 2022 |
| 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 |
| 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 | 9 | 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 | 9 | 2023 |
| 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 | 8 | 2023 |
| 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 | 5 | 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 | 5 | 2023 |
| 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 |
| 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 | 4 | 2021 |
| Efficient k-Clique Counting on Large Graphs: The Power of Color-Based Sampling Approaches X Ye, RH Li, Q Dai, H Chen, G Wang IEEE Transactions on Knowledge and Data Engineering, 2023 | 2 | 2023 |
| I/o efficient max-truss computation in large static and dynamic graphs J Jiang, Q Zhang, RH Li, Q Dai, G Wang 2024 IEEE 40th International Conference on Data Engineering (ICDE), 3217-3229, 2024 | 1 | 2024 |
| Filtration-Enhanced Graph Transformation. Z Chen, RH Li, H Qin, H Duan, Y Lu, Q Dai, G Wang IJCAI, 1987-1993, 2022 | 1 | 2022 |
| 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 | | 2024 |
Rong-Hua LiBeijing Institute of TechnologyEmail verificata su bit.edu.cn
