Chenhao Ma

Orcid: 0000-0002-3243-8512

Affiliations:
  • The Chinese University of Hong Kong, Shenzhen, China


According to our database1, Chenhao Ma authored at least 24 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Accelerating directed densest subgraph queries with software and hardware approaches.
VLDB J., January, 2024

Tapilot-Crossing: Benchmarking and Evolving LLMs Towards Interactive Data Analysis Agents.
CoRR, 2024

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks.
CoRR, 2024

Influential Exemplar Replay for Incremental Learning in Recommender Systems.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
MOSER: Scalable Network Motif Discovery using Serial Test.
Proc. VLDB Endow., November, 2023

Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery.
Proc. ACM Manag. Data, 2023

On Querying Connected Components in Large Temporal Graphs.
Proc. ACM Manag. Data, 2023

A Survey of Densest Subgraph Discovery on Large Graphs.
CoRR, 2023

Can LLM Already Serve as A Database Interface? A BIg Bench for Large-Scale Database Grounded Text-to-SQLs.
CoRR, 2023

Can LLM Already Serve as A Database Interface? A BIg Bench for Large-Scale Database Grounded Text-to-SQLs.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Scalable Algorithms for Densest Subgraph Discovery.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Graphix-T5: Mixing Pre-trained Transformers with Graph-Aware Layers for Text-to-SQL Parsing.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
The Social Technology and Research (STAR) Lab in the University of Hong Kong.
SIGMOD Rec., 2022

Finding Locally Densest Subgraphs: A Convex Programming Approach.
Proc. VLDB Endow., 2022

Effective Community Search over Large Star-Schema Heterogeneous Information Networks.
Proc. VLDB Endow., 2022

DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection.
Proc. VLDB Endow., 2022

Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques.
Proc. VLDB Endow., 2022

A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks.
Proceedings of the 2022 SIAM International Conference on Data Mining, 2022

2021
On Directed Densest Subgraph Discovery.
ACM Trans. Database Syst., 2021

Efficient Directed Densest Subgraph Discovery.
SIGMOD Rec., 2021

On Analyzing Graphs with Motif-Paths.
Proc. VLDB Endow., 2021

2020
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs.
Proceedings of the 2020 International Conference on Management of Data, 2020

2019
LINC: A Motif Counting Algorithm for Uncertain Graphs.
Proc. VLDB Endow., 2019


  Loading...