default search action
Chenhao Ma 0001
Person information
- affiliation: The Chinese University of Hong Kong, Shenzhen, China
Other persons with the same name
- Chenhao Ma 0002 — Yanshan University, Qinhuangdao, China
- Chenhao Ma 0003 — Jilin University, Changchun, China
- Chenhao Ma 0004
— Beijing Institute of Technology, China
- Chenhao Ma 0005
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Xiaolin Han
FDM: Effective and efficient incident detection on sparse trajectory data. Inf. Syst. 125: 102418 (2024) - [j20]Yuanyuan Zeng
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs. Proc. ACM Manag. Data 2(1): 22:1-22:25 (2024) - [j19]Yingli Zhou
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery. Proc. ACM Manag. Data 2(3): 119 (2024) - [j18]Chunxu Lin
On Efficient Large Sparse Matrix Chain Multiplication. Proc. ACM Manag. Data 2(3): 156 (2024) - [j17]Yuanyuan Zeng, Chenhao Ma, Yixiang Fang:
Distributed Shortest Distance Labeling on Large-Scale Graphs. Proc. VLDB Endow. 17(10): 2641-2653 (2024) - [j16]Yingli Zhou, Yixiang Fang, Chenhao Ma, Tianci Hou, Xin Huang:
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks. Proc. VLDB Endow. 17(11): 2946-2959 (2024) - [j15]Yankai Chen, Yixiang Fang, Yifei Zhang, Chenhao Ma, Yang Hong, Irwin King:
Towards Effective Top-N Hamming Search via Bipartite Graph Contrastive Hashing. IEEE Trans. Knowl. Data Eng. 36(12): 9418-9432 (2024) - [j14]Chenhao Ma
Accelerating directed densest subgraph queries with software and hardware approaches. VLDB J. 33(1): 207-230 (2024) - [j13]Yichen Xu, Chenhao Ma
Efficient and effective algorithms for densest subgraph discovery and maintenance. VLDB J. 33(5): 1427-1452 (2024) - [c13]Xiaolin Han, Xiurui Hu, Chenhao Ma, Xuequn Shang:
TRoute: Dynamic Time-Dependent Route Recommendation on Road Networks. WISA 2024: 573-585 - [c12]Xinni Zhang, Yankai Chen, Chenhao Ma, Yixiang Fang, Irwin King:
Influential Exemplar Replay for Incremental Learning in Recommender Systems. AAAI 2024: 9368-9376 - [c11]Ge Qu, Jinyang Li, Bowen Li, Bowen Qin, Nan Huo, Chenhao Ma, Reynold Cheng:
Before Generation, Align it! A Novel and Effective Strategy for Mitigating Hallucinations in Text-to-SQL Generation. ACL (Findings) 2024: 5456-5471 - [c10]Sida Lin
Effective Job-market Mobility Prediction with Attentive Heterogeneous Knowledge Learning and Synergy. CIKM 2024: 3897-3901 - [c9]Yucan Guo, Chenhao Ma, Yixiang Fang:
Efficient Core Decomposition Over Large Heterogeneous Information Networks. ICDE 2024: 2393-2406 - [c8]Jingbang Chen
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks. KDD 2024: 278-287 - [c7]Jiayang Pang
A Similarity-based Approach for Efficient Large Quasi-clique Detection. WWW 2024: 401-409 - [i9]Jingbang Chen, Qiuyang Mang, Hangrui Zhou, Richard Peng, Yu Gao, Chenhao Ma:
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks. CoRR abs/2402.05006 (2024) - [i8]Jinyang Li, Nan Huo, Yan Gao, Jiayi Shi, Yingxiu Zhao, Ge Qu, Yurong Wu, Chenhao Ma, Jian-Guang Lou, Reynold Cheng:
Tapilot-Crossing: Benchmarking and Evolving LLMs Towards Interactive Data Analysis Agents. CoRR abs/2403.05307 (2024) - [i7]Ge Qu, Jinyang Li, Bowen Li, Bowen Qin, Nan Huo, Chenhao Ma, Reynold Cheng:
Before Generation, Align it! A Novel and Effective Strategy for Mitigating Hallucinations in Text-to-SQL Generation. CoRR abs/2405.15307 (2024) - [i6]Qiuyang Mang, Jingbang Chen, Hangrui Zhou, Yu Gao, Yingli Zhou, Richard Peng, Yixiang Fang, Chenhao Ma:
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index. CoRR abs/2406.00344 (2024) - [i5]Yingli Zhou, Qingshuo Guo, Yi Yang, Yixiang Fang, Chenhao Ma, Laks V. S. Lakshmanan:
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework. CoRR abs/2406.04738 (2024) - [i4]Yankai Chen, Yixiang Fang, Yifei Zhang, Chenhao Ma, Yang Hong, Irwin King:
Towards Effective Top-N Hamming Search via Bipartite Graph Contrastive Hashing. CoRR abs/2408.09239 (2024) - 2023
- [j12]Yichen Xu
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery. Proc. ACM Manag. Data 1(2): 169:1-169:27 (2023) - [j11]Haoxuan Xie
On Querying Connected Components in Large Temporal Graphs. Proc. ACM Manag. Data 1(2): 170:1-170:27 (2023) - [j10]Mohammad Matin Najafi, Chenhao Ma, Xiaodong Li, Reynold Cheng, Laks V. S. Lakshmanan:
MOSER: Scalable Network Motif Discovery using Serial Test. Proc. VLDB Endow. 17(3): 591-603 (2023) - [c6]Jinyang Li, Binyuan Hui, Reynold Cheng
Graphix-T5: Mixing Pre-trained Transformers with Graph-Aware Layers for Text-to-SQL Parsing. AAAI 2023: 13076-13084 - [c5]Wensheng Luo, Zhuo Tang, Yixiang Fang
Scalable Algorithms for Densest Subgraph Discovery. ICDE 2023: 287-300 - [c4]Jinyang Li, Binyuan Hui, Ge Qu, Jiaxi Yang, Binhua Li, Bowen Li, Bailin Wang, Bowen Qin, Ruiying Geng, Nan Huo, Xuanhe Zhou, Chenhao Ma, Guoliang Li, Kevin Chen-Chuan Chang, Fei Huang, Reynold Cheng, Yongbin Li:
Can LLM Already Serve as A Database Interface? A BIg Bench for Large-Scale Database Grounded Text-to-SQLs. NeurIPS 2023 - [i3]Jinyang Li, Binyuan Hui, Reynold Cheng, Bowen Qin, Chenhao Ma
Graphix-T5: Mixing Pre-Trained Transformers with Graph-Aware Layers for Text-to-SQL Parsing. CoRR abs/2301.07507 (2023) - [i2]Jinyang Li, Binyuan Hui, Ge Qu, Binhua Li, Jiaxi Yang, Bowen Li, Bailin Wang, Bowen Qin, Rongyu Cao, Ruiying Geng, Nan Huo, Xuanhe Zhou, Chenhao Ma, Guoliang Li, Kevin Chen-Chuan Chang, Fei Huang, Reynold Cheng, Yongbin Li:
Can LLM Already Serve as A Database Interface? A BIg Bench for Large-Scale Database Grounded Text-to-SQLs. CoRR abs/2305.03111 (2023) - [i1]Wensheng Luo, Chenhao Ma, Yixiang Fang, Laks V. S. Lakshmanan:
A Survey of Densest Subgraph Discovery on Large Graphs. CoRR abs/2306.07927 (2023) - 2022
- [j9]Xiaolin Han, Reynold Cheng, Chenhao Ma
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection. Proc. VLDB Endow. 15(7): 1493-1505 (2022) - [j8]Yangqin Jiang, Yixiang Fang
Effective Community Search over Large Star-Schema Heterogeneous Information Networks. Proc. VLDB Endow. 15(11): 2307-2320 (2022) - [j7]Chenhao Ma
Finding Locally Densest Subgraphs: A Convex Programming Approach. Proc. VLDB Endow. 15(11): 2719-2732 (2022) - [j6]Yixiang Fang
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques. Proc. VLDB Endow. 15(12): 3766-3769 (2022) - [j5]Reynold Cheng
The Social Technology and Research (STAR) Lab in the University of Hong Kong. SIGMOD Rec. 51(2): 63-68 (2022) - [c3]Xiaolin Han, Reynold Cheng
Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks. SDM 2022: 64-72 - [c2]Chenhao Ma
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery. SIGMOD Conference 2022: 845-859 - 2021
- [j4]Xiaodong Li, Reynold Cheng
On Analyzing Graphs with Motif-Paths. Proc. VLDB Endow. 14(6): 1111-1123 (2021) - [j3]Chenhao Ma
Efficient Directed Densest Subgraph Discovery. SIGMOD Rec. 50(1): 33-40 (2021) - [j2]Chenhao Ma
On Directed Densest Subgraph Discovery. ACM Trans. Database Syst. 46(4): 13:1-13:45 (2021) - 2020
- [c1]Chenhao Ma
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs. SIGMOD Conference 2020: 1051-1066
2010 – 2019
- 2019
- [j1]Chenhao Ma
LINC: A Motif Counting Algorithm for Uncertain Graphs. Proc. VLDB Endow. 13(2): 155-168 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: