Fair scheduling for time-dependent resources B Li, M Li, R Zhang Advances in Neural Information Processing Systems 34, 21744-21756, 2021 | 9 | 2021 |
Auction Design for Value Maximizers with Budget and Return-on-Spend Constraints P Lu, C Xu, R Zhang International Conference on Web and Internet Economics, 474-491, 2023 | 6 | 2023 |
Online dynamic acknowledgement with learned predictions S Im, B Moseley, C Xu, R Zhang IEEE INFOCOM 2023-IEEE Conference on Computer Communications, 1-10, 2023 | 6 | 2023 |
Minimizing the cost of batch calibrations V Chau, M Li, EY Wang, R Zhang, Y Zhao Theoretical Computer Science 828, 55-64, 2020 | 5 | 2020 |
Online state exploration: Competitive worst case and learning-augmented algorithms S Im, B Moseley, C Xu, R Zhang Joint European Conference on Machine Learning and Knowledge Discovery in …, 2023 | 2 | 2023 |
Polylogarithmic Approximation for Robust st Path S Li, C Xu, R Zhang arXiv preprint arXiv:2305.16439, 2023 | 2 | 2023 |
Minimizing the cost of batch calibrations V Chau, M Li, Y Wang, R Zhang, Y Zhao Computing and Combinatorics: 25th International Conference, COCOON 2019, Xi …, 2019 | 2 | 2019 |
Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models B Moselely, R Zhang, S Zhao Theoretical Computer Science 938, 24-38, 2022 | 1 | 2022 |
Fair allocation with interval scheduling constraints B Li, M Li, R Zhang arXiv preprint arXiv:2107.11648, 2021 | 1 | 2021 |
Improved scheduling with a shared resource via structural insights C Damerius, P Kling, M Li, F Schneider, R Zhang International Conference on Combinatorial Optimization and Applications, 168-182, 2020 | 1 | 2020 |
Public Event Scheduling with Busy Agents B Li, L Li, M Li, R Zhang arXiv preprint arXiv:2404.11879, 2024 | | 2024 |
Sampling for Beyond-Worst-Case Online Ranking Q Chen, S Im, B Moseley, C Xu, R Zhang Proceedings of the AAAI Conference on Artificial Intelligence 38 (18), 20649 …, 2024 | | 2024 |
Scheduling with a limited testing budget C Damerius, P Kling, M Li, C Xu, R Zhang arXiv preprint arXiv:2306.15597, 2023 | | 2023 |
Min-max submodular ranking for multiple agents Q Chen, S Im, B Moseley, C Xu, R Zhang Proceedings of the AAAI Conference on Artificial Intelligence 37 (6), 7061-7068, 2023 | | 2023 |
Multiagent MST cover: pleasing all optimally via a simple voting rule B Li, X Wu, C Xu, R Zhang Proceedings of the AAAI Conference on Artificial Intelligence 37 (5), 5730-5738, 2023 | | 2023 |
OnlineĀ SchedulingĀ of Paralleizable Jobs in the Directed Acyclic Graphs and Speed-Up Curves Models B Moseley, R Zhang, S Zhao SSRN Electronic Journal, 2022 | | 2022 |
A note on the online interval scheduling secretary problem B Li, C Wang, R Zhang Operations Research Letters 50 (1), 72-75, 2022 | | 2022 |
Check for updates Minimizing the Cost of Batch Calibrations V Chau¹, M Li, Y Wang, R Zhang, Y Zhao Computing and Combinatorics: 25th International Conference, COCOON 2019, Xi …, 2019 | | 2019 |
Fair Allocation with Interval Scheduling Constraints thanks: The authors thanks Warut Suksompong for reading a draft of this paper and for helpful discussions. R Zhang | | |