Computing a Near-Maximum Independent Set in Dynamic Graphs. - Weiguo Zheng; Chengzhi Piao; Hong Cheng 001; Jeffrey Xu Yu (ICDE, 2019)

Maximizing the Reduction Ability for Near-maximum Independent Set Computation. - Chengzhi Piao; Weiguo Zheng; Yu Rong 001; Hong Cheng 001 (Proc. VLDB Endow., 2020)

Accelerating Set Intersections over Graphs by Reducing-Merging. - Weiguo Zheng; Yifan Yang; Chengzhi Piao (KDD, 2021)

Computing Graph Edit Distance via Neural Graph Matching. - Chengzhi Piao; Tingyang Xu; Xiangguo Sun; Yu Rong 001; Kangfei Zhao; Hong Cheng 001 (Proc. VLDB Endow., 2023)

Adaptive Truss Maximization on Large Graphs: A Minimum Cut Approach. - Zitan Sun; Xin Huang 001; Chengzhi Piao; Cheng Long 001; Jianliang Xu (ICDE, 2024)

Adaptive Coordinators and Prompts on Heterogeneous Graphs for Cross-Domain Recommendations. - Hengyu Zhang 001; Chunxu Shen; Xiangguo Sun; Jie Tan; Yu Rong 001; Chengzhi Piao; Hong Cheng 001; Lingling Yi (CoRR, 2024)

Adaptive Graph Integration for Cross-Domain Recommendation via Heterogeneous Graph Coordinators. - Hengyu Zhang 001; Chunxu Shen; Xiangguo Sun; Jie Tan; Yu Rong 001; Chengzhi Piao; Hong Cheng 001; Lingling Yi (SIGIR, 2025)

Can Large Language Models Be Query Optimizer for Relational Databases? - Jie Tan; Kangfei Zhao; Rui Li; Jeffrey Xu Yu; Chengzhi Piao; Hong Cheng 001; Helen Meng; Deli Zhao; Yu Rong 001 (CoRR, 2025)

On Graph Representation for Attributed Hypergraph Clustering. - Zijin Feng; Miao Qiao; Chengzhi Piao; Hong Cheng 001 (Proc. ACM Manag. Data, 2025)