Qingyun Chen     Computer Science and Engineering     University of California at Santa Cruz     Email: qchen161 at ucsc dot edu

Bio

Research Interests

Publications

1. 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)
   


2. 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)
   


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


4. 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)
   


5. 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)
   


6. 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)
   


7. 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