Yixiang Fang
Associate Professor
School of Data Science and School of Artificial Intelligence
The Chinese University of Hong Kong, Shenzhen
2001 Longxiang Boulevard, Longgang District, Shenzhen City, Guangdong Province, China
Director of M.Sc. in Computer Science Programme
Director of MPhil-PhD in Artificial Intelligence Programme
Coach of CUHK-Shenzhen Programming Contest Team
[Google Scholar], [DBLP]
Yixiang Fang is an Associate Professor at the Chinese University of Hong Kong, Shenzhen. Previously, he was a Research Associate at the School of Computer Science and Engineering, the University of New South Wales (UNSW), Australia, during 2018 - 2020. He received the PhD from Department of Computer Science at the University of Hong Kong (HKU), Hong Kong, in 2017. He was a visiting scholar at Nanyang Technological University in 2016.
Yixiang Fang's general research interests mainly focus on the data management, data mining, and artificial intelligence over big data, particularly big graph data. He has published extensively in the areas of database and data mining, including One of the Best Papers in SIGMOD 2020 (a world flagship conference in database areas), and most of them are published in top-tier conferences (e.g., VLDB, SIGMOD, ICDE, KDD, NeurIPS, WWW, and AAAI) and journals (e.g., TODS, VLDBJ, and TKDE). He was awarded the 2021 ACM SIGMOD Research Highlight Award and 2025 CUHK-Shenzhen Teaching Achievement Award (Excellent Prize). Currently, he is an Editorial Board Member of the journal Information Processing & Management (IPM, IF: 6.9). He was a PC co-chair of LLM+Graph@VLDB2025 workshop and Agents+Graph@VLDB2026 workshop. He has also served on the program committees for several top conferences (e.g., VLDB, ICDE, KDD, WWW, and AAAI) and as invited reviewers for top journals (e.g., TKDE and VLDBJ) in the areas of database, data mining, and artificial intelligence. He is a member of ACM, IEEE, and CCF.
Yixiang Fang's general research interests mainly focus on the data management, data mining, and artificial intelligence over big data, particularly big graph data. Currently, he is mainly working on the research topics of graph-based retrieval augmented generation, community search, densest subgraph discovery, and so on.
Yixiang Fang's general research interests mainly focus on the data management, data mining, and artificial intelligence over big data, particularly big graph data. Currently, he is working on the following research topics:
The three most representative topics that Yixiang has studied are Retrieval-Augmented Generation (RAG), Community Search (CS) and Densest Subgraph Discovery (DSD), which are introduced as follows.
Retrieval-Augmented Generation (RAG) has emerged as a core approach for enhancing large language models (LLMs) by enabling access to domain-specific and real-time updated knowledge beyond their pre-training corpus. By improving the trust-worthiness and interpretability of LLMs, RAG has been widely adopted across a broad range of applications such as question-answering. Recently, it has received tremendous attention from the reserchers in the database, data mining, machine learning, and natural language processing communities. Yixiang has worked extensively on this topic and delivered a number of highly promising research outcomes, including graph-based RAG algorithms, RAG systems, and agent memory mechanisms.
In particular, Yixiang's works on RAG have been well recognized by leading IT companies, and his research was funded by CCF-Ant Research Fund, CCF-Huawei Populus Grove Fund, Tencent Rhino-bird Focused Research Fund, and Lalamove University-Enterprise Cooperation Fund.

As a hot topic of subgraph query in the network science, CS aims to efficiently query the most likely community that contains the query vertex. It has attracted great attention from both academic and industry areas, and found various real-world applications, such as friend recommendation, event organization, fraud detection, network analysis, and retrieval augmented generation (RAG) for LLMs. Yixiang has systematically studied this topic on attributed graphs, directed graphs, and heterogeneous graphs, and achieved significant contributions by developing new models, efficient algorithms, and innovative theories. Additinoally, he has published a book about cohesive subgraph search over heterogeneous graphs.
In particular, Yixiang's works on cohesive subgraphs have been well recognized by leading IT companies. His works on community search on knowledge
graphs and temporal graphs have been funded by CCF-Huawei Populus Grove Fund and ByteDance, respectively.

As one of the most fundamental graph mining problems, DSD aims to discover the subgraph with the highest density from a given graph. More precisely, given an undirected graph, the DSD problem asks for a subgraph with the highest density, defined as the number of edges over the number of vertices in the subgraph, and it is often termed the densest subgraph. This topic has garnered tremendous attention from both database and theory areas in recent years. It has found a broad spectrum of real applications, such as network community detection, graph index construction, regulatory motif discovery in DNA, fake follower detection, etc. Yixiang has continuously worked on this topic, and achieved a series of breakthroughs, including novel DSD algorithms, in-depth experimental study, tutorial, and survey.
In particular, Yixiang's SIGMOD'2020 paper about DSD on directed graphs was selected as One of the Best Papers in SIGMOD'2020 conference, and he was awarded The 2021 SIGMOD Research Highlight Award.
