About me
I am currently an assistant professor of Computer Science at City University of Hong Kong (Dongguan). Previously, I was a
- postdoc in Discrete Optimization Group at the Technical University of Munich, advised by Prof. Andreas Wiese and Prof. Stefan Weltge;
- postdoc in the Department of Computer Science and Engineering at University at Buffalo, advised by Prof. Shi Li;
- Ph.D. student in the Department of Computer Science at City University of Hong Kong, advised by Prof. Minming Li;
- long-term visiting Ph.D student at Carnegie Mellon University, hosted by Prof. Ben Moseley and Prof. Sungjin Im;
- undergrad in Computer Science and Technology at the Hefei University of Technology.
Email: [email protected]
Here is my DBLP.
Research Interests
I am broadly interested in algorithm design and analysis for combinatorial optimization problems. More specifically, I study approximation and online algorithms for resource allocation, network design, and submodular optimization problems.
Publications
Per convention of the TCS community, authors of a paper in conference proceedings or journals have equal contributions and are sorted alphabetically.
- Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps.
Xiaohui Bei, Yuda Feng, Yang Hu, Shi Li, Ruilong Zhang.
STOC 2026 - A Beyond-Worst-Case Analysis of Greedy k-means++.
Qingyun Chen, Sungjin Im, Ryan Milstrey, Ben Moseley, Chenyang Xu, Ruilong Zhang.
NeurIPS 2025 - Logarithmic Approximations for Fair k-Set Selection.
Shi Li, Chenyang Xu, Ruilong Zhang.
IJCAI 2025 - Fair Submodular Maximization over a Knapsack Constraint.
Lijun Li, Chenyang Xu, Liuyi Yang, Ruilong Zhang.
IJCAI 2025 - Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations.
Yuda Feng, Yang Hu, Shi Li, Ruilong Zhang.
STOC 2025 - Scheduling with Calibrations for Multi-interval Jobs.
Vincent Chau, Christoph Damerius, Peter Kling, Minming Li, Florian Schneider, Ruilong Zhang.
INFORMS Journal on Computing (2025) - Resource-limited Network Security Games with General Contagious Attacks.
Rufan Bai, Chao Xu, Chenyang Xu, Ruilong Zhang.
COCOON 2024 - Public Events Scheduling with Busy Agents.
Bo Li, Lijun Li, Minming Li, Ruilong Zhang.
IJCAI 2024 - Polylogarithmic Approximations for Robust s-t Path.
Shi Li, Chenyang Xu, Ruilong Zhang.
ICALP 2024 - Sampling for Beyond-Worst-Case Online Ranking.
Qingyun Chen, Sungjin Im, Ben Moseley, Chenyang Xu, Ruilong Zhang.
AAAI 2024 - Auction Design for Value Maximizers with Budget Constraints and Return-on-spend Constraints.
Pinyan Lu, Chenyang Xu, Ruilong Zhang.
WINE 2023 - Scheduling with a Limited Testing Budget.
Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong Zhang.
ESA 2023 - Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms.
Sungjin Im, Ben Moseley, Chenyang Xu, Ruilong Zhang.
ECML/PKDD 2023 - Online Dynamic Acknowledgement with Learned Predictions.
Sungjin Im, Ben Moseley, Chenyang Xu, Ruilong Zhang.
INFOCOM 2023 - Min-max Submodular Ranking for Multiple Agents.
Qingyun Chen, Sungjin Im, Ben Moseley, Chenyang Xu, Ruilong Zhang.
AAAI 2023 - Multiagent MST Cover: Pleasing All Optimally via A Simple Voting Rule.
Bo Li, Xiaowei Wu, Chenyang Xu, Ruilong Zhang.
AAAI 2023 - Online Scheduling of Parallelizable Jobs in the Directed Acyclic Graphs and Speed-up Curves Models.
Ben Moseley, Ruilong Zhang, Shanjiawen Zhao.
Theoretical Computer Science (2022) - A Note on the Online Interval Scheduling Secretary Problem.
Bo Li, Chenhao Wang, Ruilong Zhang.
Operations Research Letters (2022) - Fair Scheduling for Time-dependent Resources.
Bo Li, Minming Li, Ruilong Zhang.
NeurIPS 2021 - Improved Scheduling with a Shared Resource via Structural Insights.
Christoph Damerius, Peter Kling, Minming Li, Florian Schneider, Ruilong Zhang.
COCOA 2020 - Minimizing the Cost of Batch Calibrations.
Vincent Chau, Minming Li, Yinling Wang, Ruilong Zhang, Yingchao Zhao.
COCOON 2019
Journal version in Theoretical Computer Science (2020)
Last updated: Feb 10, 2026.