On First Fit Bin Packing for Online Cloud Server Allocation. - Xueyan Tang; Yusen Li; Runtian Ren; Wentong Cai 001 (IPDPS, 2016)

Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time. - Runtian Ren; Xueyan Tang (SPAA, 2016)

Online Flexible Job Scheduling for Minimum Span. - Runtian Ren; Xueyan Tang (SPAA, 2017)

Competitiveness of Dynamic Bin Packing for Online Cloud Server Allocation. - Runtian Ren; Xueyan Tang; Yusen Li; Wentong Cai 001 (IEEE/ACM Trans. Netw., 2017)

Combinatorial algorithms for scheduling jobs to minimize server usage time - Runtian Ren (2018)

Cloud Scheduling with Discrete Charging Units. - Ming Ming Tan; Runtian Ren; Xueyan Tang (IEEE Trans. Parallel Distributed Syst., 2019)

Busy-Time Scheduling on Heterogeneous Machines. - Runtian Ren; Xueyan Tang (IPDPS, 2020)

Interval Job Scheduling With Machine Launch Cost. - Runtian Ren; Yuqing Zhu 006; Chuanyou Li; Xueyan Tang (IEEE Trans. Parallel Distributed Syst., 2020)

Generalized Skyline Interval Coloring and Dynamic Geometric Bin Packing Problems. - Runtian Ren; Xueyan Tang (ICPP, 2021)

The Min-Cost Matching with Concave Delays Problem. - Yossi Azar; Runtian Ren; Danny Vainstein (SODA, 2021)

Multi-level Aggregation with Delays and Stochastic Arrivals. - Mathieu Mari; Michal Pawlowski; Runtian Ren; Piotr Sankowski (AAMAS, 2024)

Online Multi-Level Aggregation with Delays and Stochastic Arrivals. - Mathieu Mari; Michal Pawlowski; Runtian Ren; Piotr Sankowski (ISAAC, 2024)

Modeling Online Paging in Multi-Core Systems. - Mathieu Mari; Anish Mukherjee 001; Runtian Ren; Piotr Sankowski (CoRR, 2024)

Online Matching with Delays and Stochastic Arrival Times. - Mathieu Mari; Michal Pawlowski; Runtian Ren; Piotr Sankowski (Theory Comput. Syst., 2025)