Published research in multiple top conferences and journals such as ESA (Track S) 2023, APPROX 2023, NeuRIPS 2022, SODA 2022, etc. Research areas include sparsification for submodular functions, packing and covering matroids, densest subgraph, independent sets, minimum cuts, and more.
Research Experience
Assistant Professor, Theory Group, Department of Computer Science, Purdue University; Teaching experience includes courses on randomized algorithms, undergraduate algorithms, graduate algorithms, and advanced topics (graph) algorithms.
Background
Research interests: design and analysis of algorithms, approximation algorithms, randomized algorithms, combinatorial optimization, continuous optimization, online learning, and discrete geometry. Particularly interested in highly scalable algorithms for fundamental problems in optimization.