Subgraph Reconstruction via Reversible Subgraph Embedding. - Boyu Yang 003; Weiguo Zheng (DASFAA (3), 2023)

Near-optimal Steiner tree computation powered by node embeddings. - Boyu Yang 003; Weiguo Zheng (Knowl. Inf. Syst., 2023)

A Powerful Local Search Method for Minimum Steiner Tree Problem. - Boyu Yang 003; Weiguo Zheng (APWeb/WAIM (4), 2024)

Tackling Non-Stationarity in Reinforcement Learning via Causal-Origin Representation. - Wanpeng Zhang 002; Yilin Li; Boyu Yang 003; Zongqing Lu 002 (ICML, 2024)

Towards Building a Lightweight and Powerful Computation Graph for Scalable GNN. - Chang Gong 002; Boyu Yang 003; Weiguo Zheng; Xing Huang; Weiyi Huang; Jie Wen; Shijie Sun; Bohua Yang (WISE (2), 2024)

HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs. - Boyu Yang 003; Weiguo Zheng; Xiang Lian 001; Yuzheng Cai; X. Sean Wang (Proc. ACM Manag. Data, 2024)

HFLR: Optimizing GNN Training via High-Fixed-Low-Resampling. - Chang Gong 002; Boyu Yang 003; Weiguo Zheng (ICASSP, 2025)

Space-Efficient Compact Representations for Graph Analytics. - Boyu Yang 003; Weiguo Zheng; Xiang Lian 001; Lingfei Zheng (ICDE, 2025)