Algorithms and Theory group

Department of Computer Science

University of Illinois at Urbana-Champaign

**Advisors:**Karthik Chandrasekaran and Chandra Chekuri**Research interests:**- Combinatorial optimization
- Computational geometry

**Office:**#3240 Siebel Center**Email:**`chaoxu3@illinois.edu`**Spouse:**Vanessa Li

A Faster Pseudopolynomial Time Algorithm for Subset Sum with Konstantinos Koiliaris. To appear in SODA 2017.

Computing minimum cuts in hypergraphs with Chandra Chekuri. To appear in SODA 2017.

On Element-Connectivity Preserving Graph Simplification
with
Chandra Chekuri and
Thapanapong Rukkanchanunt.
*ESA 2015.*

Detecting Weakly Simple Polygons
with
Jeff Erickson and
Hsien-Chih Chang.
*SODA 2015.*

Reconstructing edge-disjoint paths faster.
*Operations Research Letters*, 44 (2) (2016), pp. 174-176

Champion spiders in the game of Graph Nim
with
Neil J. Calkin and
Janine E. Janoski and
Allison Nelson and Sydney Ryan.
*Congr. Numer.*, 218:5-19, 2013.