Articles with public access mandates - Chenhao MaLearn more
Available somewhere: 18
Efficient algorithms for densest subgraph discovery on large directed graphs
C Ma, Y Fang, R Cheng, LVS Lakshmanan, W Zhang, X Lin
Proceedings of the 2020 ACM SIGMOD International Conference on Management of …, 2020
Mandates: National Natural Science Foundation of China, Research Grants Council, Hong Kong
Linc: a motif counting algorithm for uncertain graphs
C Ma, R Cheng, LVS Lakshmanan, T Grubenmann, Y Fang, X Li
Proceedings of the VLDB Endowment 13 (2), 155-168, 2019
Mandates: Natural Sciences and Engineering Research Council of Canada, Research Grants …
DeepTEA: effective and efficient online time-dependent trajectory outlier detection
X Han, R Cheng, C Ma, T Grubenmann
Proceedings of the VLDB Endowment 15 (7), 1493-1505, 2022
Mandates: Federal Ministry of Education and Research, Germany
A convex-programming approach for efficient directed densest subgraph discovery
C Ma, Y Fang, R Cheng, LVS Lakshmanan, X Han
Proceedings of the 2022 International Conference on Management of Data, 845-859, 2022
Mandates: Natural Sciences and Engineering Research Council of Canada, National …
On directed densest subgraph discovery
C Ma, Y Fang, R Cheng, LVS Lakshmanan, W Zhang, X Lin
ACM Transactions on Database Systems (TODS) 46 (4), 1-45, 2021
Mandates: Natural Sciences and Engineering Research Council of Canada, National …
Effective community search over large star-schema heterogeneous information networks
Y Jiang, Y Fang, C Ma, X Cao, C Li
Proceedings of the VLDB Endowment 15 (11), 2307-2320, 2022
Mandates: National Natural Science Foundation of China
On analyzing graphs with motif-paths
X Li, R Cheng, KCC Chang, C Shan, C Ma, H Cao
Proceedings of the VLDB Endowment 14 (6), 1111-1123, 2021
Mandates: US National Science Foundation, Research Grants Council, Hong Kong
Densest subgraph discovery on large graphs: applications, challenges, and techniques
Y Fang, W Luo, C Ma
Proceedings of the VLDB Endowment 15 (12), 3766-3769, 2022
Mandates: National Natural Science Foundation of China
Finding locally densest subgraphs: a convex programming approach
C Ma, R Cheng, LVS Lakshmanan, X Han
Proceedings of the VLDB Endowment 15 (11), 2719-2732, 2022
Mandates: Natural Sciences and Engineering Research Council of Canada
Efficient directed densest subgraph discovery
C Ma, Y Fang, R Cheng, LVS Lakshmanan, W Zhang, X Lin
ACM SIGMOD Record 50 (1), 33-40, 2021
Mandates: Natural Sciences and Engineering Research Council of Canada, Research Grants …
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery
Y Xu, C Ma, Y Fang, Z Bao
Proceedings of the ACM on Management of Data 1 (2), 1-27, 2023
Mandates: National Natural Science Foundation of China
Leveraging contextual graphs for stochastic weight completion in sparse road networks
X Han, R Cheng, T Grubenmann, S Maniu, C Ma, X Li
Proceedings of the 2022 SIAM International Conference on Data Mining (SDM …, 2022
Mandates: Federal Ministry of Education and Research, Germany, National Research …
On Querying Connected Components in Large Temporal Graphs
H Xie, Y Fang, Y Xia, W Luo, C Ma
Proceedings of the ACM on Management of Data 1 (2), 1-27, 2023
Mandates: National Natural Science Foundation of China
Influential Exemplar Replay for Incremental Learning in Recommender Systems
X Zhang, Y Chen, C Ma, Y Fang, I King
Proceedings of the AAAI Conference on Artificial Intelligence 38 (8), 9368-9376, 2024
Mandates: Research Grants Council, Hong Kong
Scalable algorithms for densest subgraph discovery
W Luo, Z Tang, Y Fang, C Ma, X Zhou
2023 IEEE 39th International Conference on Data Engineering (ICDE), 287-300, 2023
Mandates: National Natural Science Foundation of China
MOSER: Scalable Network Motif Discovery Using Serial Test
MM Najafi, C Ma, X Li, R Cheng, LVS Lakshmanan
Proceedings of the VLDB Endowment 17 (3), 591-603, 2023
Mandates: Natural Sciences and Engineering Research Council of Canada, National …
The Social Technology and Research (STAR) Lab in the University of Hong Kong
R Cheng, C Ma, X Li, Y Fang, Y Liu, VYL Wong, E Lee, TH Lam, SY Ho, ...
ACM SIGMOD Record 51 (2), 63-68, 2022
Mandates: National Natural Science Foundation of China
FDM: Effective and efficient incident detection on sparse trajectory data
X Han, T Grubenmann, C Ma, X Li, W Sun, SC Wong, X Shang, R Cheng
Information Systems, 102418, 2024
Mandates: UK Science and Technology Facilities Council, UK Research & Innovation
Publication and funding information is determined automatically by a computer program