Qingyun Chen

    Email: qingyun.chen152 at gmail dot com

Bio

I will join the Operations Research group at the Technical University of Munich as a postdoctoral researcher, hosted by Prof. Andreas S. Schulz. I graduated with a Ph.D. in the Department of Computer Science and Engineering at UC Santa Cruz, where I was fortunate to be advised by Prof. Sungjin Im.

Research Interests

My main research focus is on the design and analysis of algorithms for combinatorial optimization. Specifically, I work on approximation algorithms, online algorithms, beyond-worst-case analysis, learning-augmented algorithms, and hardness of approximation. I am also broadly interested in theoretical computer science.

Publications

  1. Survivable Network Design with Group-to-Group Requirement
    with Bundit Laekhanukit, Chao Liao, and Yuhao Zhang
    Journal of the ACM '26 (Preliminary versions appeared in FOCS '22 and ICALP '22)

  2. A Beyond-Worst-Case Analysis of Greedy k-means++
    with Sungjin Im, Ryan Milstrey, Benjamin Moseley, Chenyang Xu, and Ruilong Zhang
    The Thirty-Ninth Annual Conference on Neural Information Processing Systems (NeurIPS '25)

  3. Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
    with Sungjin Im, and Aditya Petety
    The 36th ACM-SIAM Symposium on Discrete Algorithms (SODA '25)

  4. Strategic Facility Location via Predictions
    with Nick Gravin, and Sungjin Im
    The 20th Conference on Web and Internet Economics (WINE '24)

  5. Sampling for Beyond-Worst-Case Online Ranking.
    with Sungjin Im, Benjamin Moseley, Chenyang Xu, and Ruilong Zhang
    The 38th AAAI Conference on Artificial Intelligence (AAAI '24)

  6. Min-max Submodular Ranking for Multiple Agents.
    with Sungjin Im, Benjamin Moseley, Chenyang Xu, and Ruilong Zhang
    The 37th AAAI Conference on Artificial Intelligence (AAAI '23)

  7. Survivable Network Design Revisited: Group-Connectivity.
    with Bundit Laekhanukit, Chao Liao, and Yuhao Zhang
    The 63rd Annual Symposium on Foundations of Computer Science (FOCS '22)

  8. Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity.
    with Bundit Laekhanukit, Chao Liao, and Yuhao Zhang
    The 49th International Colloquium on Automata, Languages and Programming (ICALP '22)

Professional Service

Review: SODA 2026, FOCS 2025, ESA 2025, STOC 2025, SODA 2025, ESA 2024, FOCS 2024, SPAA 2024, STOC 2024, ITCS 2024, IPCO 2023, SODA 2023, ISAAC 2022, APPROX 2022