Weihao Zhu

weihaoz3 [at] illinois [dot] edu

I am a fourth-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

  1. Random Deletion for Girth and Approximate Shortest Cycles
    Karthekeyan Chandrasekaran, Chandra Chekuri, and Weihao Zhu
    In submission, 2026
  2. Improved Lower Bound for Steiner Point Removal
    Karthekeyan Chandrasekaran, Chandra Chekuri, Qingyun Chen, and Weihao Zhu
    In submission, 2026
  3. Multiobjective Hypergraph Min-Cut in Quasi-Polynomial Time
    Karthekeyan Chandrasekaran, Chandra Chekuri, and Weihao Zhu
    In submission, 2026
  4. A Polymatroidal Perspective on Random Contraction
    Karthekeyan Chandrasekaran, Chandra Chekuri, and Weihao Zhu
    In submission, 2026
  5. Preemptive Bipartite Matching with Secondary Chances
    Yifan Lin, Yuhao Zhang, and Weihao Zhu
    In submission, 2026
  6. Hedgegraph polymatroids
    Karthekeyan Chandrasekaran, Chandra Chekuri, Weihang Wang, and Weihao Zhu
    In International Conference on Integer Programming and Combinatorial Optimization (IPCO), 2026
    PDF
  7. Online Disjoint Spanning Trees and Polymatroid Bases
    Karthekeyan Chandrasekaran, Chandra Chekuri, and Weihao Zhu
    In 52nd International Colloquium on Automata, Languages, and Programming (ICALP), 2025
    PDF Slides
  8. On the generalized mean densest subgraph problem: Complexity and algorithms
    Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel R Torres, and Weihao Zhu
    In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), 2024
    PDF
  9. From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
    Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, and Weihao Zhu
    In 32nd Annual European Symposium on Algorithms (ESA), 2024
    PDF
  10. Randomized algorithm for MPMD on two sources
    Kun He, Sizhe Li, Enze Sun, Yuyi Wang, Roger Wattenhofer, and Weihao Zhu
    In International Conference on Web and Internet Economics (WINE), 2023
    PDF
  11. Time-space tradeoffs for element distinctness and set intersection via pseudorandomness
    Xin Lyu and Weihao Zhu
    In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023
    PDF