Imbalanced Networked Multi-label Classification with Active Learning. - Ruilong Zhang 001; Lei Li 002; Yuhong Zhang 002; Chenyang Bu (ICBK, 2018)

Improved Scheduling with a Shared Resource via Structural Insights. - Christoph Damerius; Peter Kling; Minming Li; Florian Schneider 001; Ruilong Zhang 001 (COCOA, 2020)

Minimizing the cost of batch calibrations. - Vincent Chau; Minming Li; Elaine Yinling Wang; Ruilong Zhang 001; Yingchao Zhao 001 (Theor. Comput. Sci., 2020)

Fair Scheduling for Time-dependent Resources. - Bo Li 037; Minming Li; Ruilong Zhang 001 (NeurIPS, 2021)

Fair Allocation with Interval Scheduling Constraints. - Bo Li 037; Minming Li; Ruilong Zhang 001 (CoRR, 2021)

A note on the online interval scheduling secretary problem. - Bo Li 037; Chenhao Wang 001; Ruilong Zhang 001 (Oper. Res. Lett., 2022)

Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models. - Benjamin Moseley; Ruilong Zhang 001; Shanjiawen Zhao (Theor. Comput. Sci., 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)

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)

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)

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

Public Event Scheduling with Busy Agents. - Bo Li 037; Lijun Li; Minming Li; Ruilong Zhang 001 (IJCAI, 2024)

Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations. - Yuda Feng; Yang Hu; Shi Li 001; Ruilong Zhang 001 (STOC, 2025)

Multiplicative assignment with upgrades. - Alexander Armbruster; Lars Rohwedder; Stefan Weltge; Andreas Wiese; Ruilong Zhang 001 (CoRR, 2025)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps. - Xiaohui Bei; Yuda Feng; Yang Hu; Shi Li 001; Ruilong Zhang 001 (CoRR, 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)