Chenhao Ma

Proc. VLDB Endow., June, 2024

Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, February, 2024

Accelerating directed densest subgraph queries with software and hardware approaches.

[BibT_eX]

[DOI]

Xiaolin Han

VLDB J., January, 2024

A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2024

On Efficient Large Sparse Matrix Chain Multiplication.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2024

FDM: Effective and efficient incident detection on sparse trajectory data.

[BibT_eX]

[DOI]

Inf. Syst., 2024

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework.

[BibT_eX]

[DOI]

CoRR, 2024

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index.

[BibT_eX]

[DOI]

CoRR, 2024

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

[BibT_eX]

[DOI]

CoRR, 2024

A Similarity-based Approach for Efficient Large Quasi-clique Detection.

[BibT_eX]

[DOI]

Jiayang Pang

Proceedings of the ACM on Web Conference 2024, 2024

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

[BibT_eX]

[DOI]

Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Efficient Core Decomposition Over Large Heterogeneous Information Networks.

[BibT_eX]

[DOI]

Yucan Guo

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Effective Job-market Mobility Prediction with Attentive Heterogeneous Knowledge Learning and Synergy.

[BibT_eX]

[DOI]

Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, 2024

Before Generation, Align it! A Novel and Effective Strategy for Mitigating Hallucinations in Text-to-SQL Generation.

[BibT_eX]

[DOI]

Proceedings of the Findings of the Association for Computational Linguistics, 2024

Influential Exemplar Replay for Incremental Learning in Recommender Systems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

TRoute: Dynamic Time-Dependent Route Recommendation on Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems and Applications, 2024

2023

MOSER: Scalable Network Motif Discovery using Serial Test.

[BibT_eX]

[DOI]

Mohammad Matin Najafi

Proc. VLDB Endow., November, 2023

Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

On Querying Connected Components in Large Temporal Graphs.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

A Survey of Densest Subgraph Discovery on Large Graphs.

[BibT_eX]

[DOI]

Wensheng Luo

CoRR, 2023

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

[BibT_eX]

[DOI]

Kevin Chen-Chuan Chang

Fei Huang

Yongbin Li

CoRR, 2023

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

[BibT_eX]

[DOI]

Kevin Chen-Chuan Chang

Fei Huang

Yongbin Li

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

SIGMOD Rec., 2022

Finding Locally Densest Subgraphs: A Convex Programming Approach.

[BibT_eX]

[DOI]

Xiaolin Han

Proc. VLDB Endow., 2022

Effective Community Search over Large Star-Schema Heterogeneous Information Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques.

[BibT_eX]

[DOI]

Wensheng Luo

Proc. VLDB Endow., 2022

A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery.

[BibT_eX]

[DOI]

Xiaolin Han

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.

[BibT_eX]

[DOI]

Proceedings of the 2022 SIAM International Conference on Data Mining, 2022

2021

On Directed Densest Subgraph Discovery.

[BibT_eX]

[DOI]

Wenjie Zhang

Xuemin Lin

ACM Trans. Database Syst., 2021

Efficient Directed Densest Subgraph Discovery.

[BibT_eX]

[DOI]

Wenjie Zhang

Xuemin Lin

SIGMOD Rec., 2021

On Analyzing Graphs with Motif-Paths.

[BibT_eX]

[DOI]

Kevin Chen-Chuan Chang

Caihua Shan

Hongtai Cao

Proc. VLDB Endow., 2021

2020

Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs.

[BibT_eX]

[DOI]

Wenjie Zhang

Xuemin Lin

Proceedings of the 2020 International Conference on Management of Data, 2020

2019

LINC: A Motif Counting Algorithm for Uncertain Graphs.

[BibT_eX]

[DOI]

Tobias Grubenmann