Weihao Zhu
weihaoz3 [at] illinois [dot] edu
I am a third-year Ph.D. student at the University of Illinois at Urbana Champaign, where I am fortunate to be advised by Chandra Chekuri and Karthekeyan Chandrasekaran. My research interests lie in approximation algorithms, graph algorithms, combinatorial optimization, and submodular optimization.
Previously, I did my undergrad at Shanghai Jiao Tong University. During my junior year, I worked as an undergraduate researcher at Shanghai University of Finance and Economics, where I worked closely with Bundit Laekhanukit.
You can see my CV here. Please feel free to reach out if you have any question!
Teaching
I have been a teaching assistant for the following courses:
University of Illinois at Urbana-Champaign
Shanghai Jiao Tong University
- CS3334: Advanced Combinatorics (Fall 2022)
- CS2962: Graph Theory and Combinatorics (Spring 2022, Spring 2023)
Publications
- On the generalized mean densest subgraph problem: Complexity and algorithmsIn Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), 2024
- From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar GraphsIn 32nd Annual European Symposium on Algorithms (ESA), 2024
- Randomized algorithm for MPMD on two sourcesIn International Conference on Web and Internet Economics (WINE), 2023
- Time-space tradeoffs for element distinctness and set intersection via pseudorandomnessIn Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023