Jiale Chen

I am a final-year Ph.D. student at Stanford University, advised by Aaron Sidford. Previously, I was an undergraduate student at Peking University.

My research focuses on dynamic \((1-\varepsilon)\)-approximate maximum weight matching in general graphs. I develop combinatorial reductions and continuous optimization frameworks that address the challenges posed by edge weights, non-bipartite structure, and adversarial updates. These frameworks bridge the gaps between unweighted and weighted matching and between bipartite and general graphs, yielding faster algorithms in the dynamic setting and beyond.