The Path Set Packing Problem. - Chenyang Xu 002; Guochuan Zhang (COCOON, 2018)

Multiple Constrained Routing Algorithms in Large-Scaled Software Defined Networks. - Chenyang Xu 002; Liangde Tao; Huajingling Wu; Deshi Ye; Guochuan Zhang (CoRR, 2019)

Using Predicted Weights for Ad Delivery. - Thomas Lavastida; Benjamin Moseley; R. Ravi 001; Chenyang Xu 002 (ACDA, 2021)

Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. - Thomas Lavastida; Benjamin Moseley; R. Ravi 001; Chenyang Xu 002 (ESA, 2021)

Learning-Augmented Algorithms for Online Steiner Tree. - Chenyang Xu 002; Benjamin Moseley (AAAI, 2022)

Mechanism Design with Predictions. - Chenyang Xu 002; Pinyan Lu (IJCAI, 2022)

Min-Max Submodular Ranking for Multiple Agents. - Qingyun Chen; Sungjin Im; Benjamin Moseley; Chenyang Xu 002; Ruilong Zhang 001 (AAAI, 2023)

Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule. - Bo Li 037; Xiaowei Wu 001; Chenyang Xu 002; Ruilong Zhang 001 (AAAI, 2023)

Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings. - Christoph Damerius; Peter Kling; Minming Li; Chenyang Xu 002; Ruilong Zhang 001 (ESA, 2023)

FedGM: Heterogeneous Federated Learning via Generative Learning and Mutual Distillation. - Chao Peng 004; Yiming Guo; Yao Chen; Qilin Rui; Zhengfeng Yang; Chenyang Xu 002 (Euro-Par, 2023)

Online Dynamic Acknowledgement with Learned Predictions. - Sungjin Im; Benjamin Moseley; Chenyang Xu 002; Ruilong Zhang 001 (INFOCOM, 2023)

Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms. - Sungjin Im; Benjamin Moseley; Chenyang Xu 002; Ruilong Zhang 001 (ECML/PKDD (4), 2023)

Auction Design for Value Maximizers with Budget and Return-on-Spend Constraints. - Pinyan Lu; Chenyang Xu 002; Ruilong Zhang 001 (WINE, 2023)

Polylogarithmic Approximation for Robust s-t Path. - Shi Li 001; Chenyang Xu 002; Ruilong Zhang 001 (CoRR, 2023)

Scheduling with a Limited Testing Budget. - Christoph Damerius; Peter Kling; Minming Li; Chenyang Xu 002; Ruilong Zhang 001 (CoRR, 2023)

Learning-augmented algorithms for online subset sum. - Chenyang Xu 002; Guochuan Zhang (J. Glob. Optim., 2023)

Sampling for Beyond-Worst-Case Online Ranking. - Qingyun Chen; Sungjin Im; Benjamin Moseley; Chenyang Xu 002; Ruilong Zhang 001 (AAAI, 2024)

Resource-Limited Network Security Games with General Contagious Attacks. - Rufan Bai; Chao Xu; Chenyang Xu 002; Ruilong Zhang 001 (COCOON (2), 2024)

Sponsored Search Auction Design Beyond Single Utility Maximization. - Changfeng Xu; Chao Peng 004; Chenyang Xu 002; Zhengfeng Yang (COCOON (2), 2024)

Polylogarithmic Approximations for Robust s-t Path. - Shi Li 001; Chenyang Xu 002; Ruilong Zhang 001 (ICALP, 2024)

A Context-Enhanced Framework for Sequential Graph Reasoning. - Shuo Shi; Chao Peng 004; Chenyang Xu 002; Zhengfeng Yang (IJCAI, 2024)

Boundary-Aware Periodicity-based Sparsification Strategy for Ultra-Long Time Series Forecasting. - Yiying Bao; Hao Zhou; Chao Peng 004; Chenyang Xu 002; Shuo Shi; Kecheng Cai (ACM Multimedia, 2024)

Open-Book Neural Algorithmic Reasoning. - Hefei Li; Chao Peng 004; Chenyang Xu 002; Zhengfeng Yang (NeurIPS, 2024)

ATA: An Abstract-Train-Abstract approach for explanation-friendly deep reinforcement learning. - Shi Peng; Si Liu; Dapeng Zhi; Peixin Wang; Chenyang Xu 002; Cheng Chen; Min Zhang (Neural Networks, 2025)

Logarithmic Approximations for Fair k-Set Selection. - Shi Li 001; Chenyang Xu 002; Ruilong Zhang 001 (CoRR, 2025)

Fair Submodular Maximization over a Knapsack Constraint. - Lijun Li; Chenyang Xu 002; Liuyi Yang; Ruilong Zhang 001 (CoRR, 2025)