Research Interests
Broadly speaking, my research area is theoretical computer science. Specifically, I am interested in designing and analyzing approximation algorithms for NP-hard combinatorial problems. Main types of problems I worked on include facility location problems, network routing and design, scheduling, resource allocation problems, etc. Currently, I am especially interested in the use of LP/SDP hierarchies in tackling these problems.
My research is supported by NSF grant CCF-1566356 (CRII), CCF-1717134 and CCF-1844890 (Career Award).
Publications
Here is the full list of my publications.
Teaching
- Currently Teaching (Spring 2019): CSE431/531: Algorithm Analysis and Design
- CSE711: Topics in Combinatorial Optimization and Linear Programming (Seminar) (Fall 2018)
- CSE431/531: Algorithm Analysis and Design (Spring 2018, Fall 2016, Spring 2016)
- CSE 632: Analysis of Algorithms II (Fall 2017)
- Advanced Topics in Algorithm Design (Seminar) (Fall 2015)
- EECS336: Design and Analysis of Algorithms (Winter 2015) at Northwestern University
- co-teaching Information and Coding Theory (Fall 2014) at TTIC with Madhur Tulsiani
PhD Advisees
- Xiangyu Guo
- Yunus Esencayi (co-advising with Prof. Roger He)
- Jiayi Xian (co-advising with Prof. Jinhui Xu)
- Alexander Stachnik
Professional Activities
PC member for APPROX+RANDOM 2017, SWAT 2018, MAPSP 2019 (upcoming)