| Efficient size-bounded community search over large networks K Yao, L Chang Proceedings of the VLDB Endowment 14 (8), 1441-1453, 2021 | 40 | 2021 |
| Identifying similar-bicliques in bipartite graphs K Yao, L Chang, JX Yu Proceedings of the VLDB Endowment 15 (11), 3085-3097, 2022 | 16 | 2022 |
| Density-based community detection in geo-social networks K Yao, D Papadias, S Bakiras Proceedings of the 16th international symposium on spatial and temporal …, 2019 | 16 | 2019 |
| Accelerating graph similarity search via efficient GED computation L Chang, X Feng, K Yao, L Qin, W Zhang IEEE Transactions on Knowledge and Data Engineering 35 (5), 4485-4498, 2022 | 12 | 2022 |
| Computing maximum structural balanced cliques in signed graphs K Yao, L Chang, L Qin 2022 IEEE 38th International Conference on Data Engineering (ICDE), 1004-1016, 2022 | 8 | 2022 |
| Verification-free approaches to efficient locally densest subgraph discovery TB Trung, L Chang, NT Long, K Yao, HTT Binh 2023 IEEE 39th International Conference on Data Engineering (ICDE), 1-13, 2023 | 4 | 2023 |
| Maximum k-Plex Computation: Theory and Practice L Chang, K Yao Proceedings of the ACM on Management of Data 2 (1), 1-26, 2024 | 3 | 2024 |
| Identifying similar-bicliques in bipartite graphs K Yao, L Chang, JX Yu The VLDB Journal, 1-24, 2024 | 3 | 2024 |
| Identifying Large Structural Balanced Cliques in Signed Graphs K Yao, L Chang, L Qin IEEE Transactions on Knowledge and Data Engineering, 2023 | 1 | 2023 |
| On Directed Densest Subgraph Detection K Yao, X Yang, L Chang Australasian Database Conference, 371-384, 2023 | | 2023 |
| Cohesive subgraph identification in large graphs K Yao | | 2023 |
Lijun ChangUniversity of SydneyE-mailová adresa ověřena na: sydney.edu.au