Finding Pseudorandom Colorings of Pseudorandom Graphs
with Akash Kumar and Madhur Tulsiani
FSTTCS, 2017
Accelerated Newton Iteration for Roots of Black Box Polynomials
with Santosh S. Vempala
FOCS, 2016
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms
with T-H. Hubert Chan, Zhihao Gavin Tang, and Chenzi Zhang
Manuscript, 2016
Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms
STOC, 2015.
(See here)
Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion
with Yury Makarychev
APPROX, 2014
Linear Programming Hierarchies Suffice for Directed Steiner Tree
with Zachary Friggstad, Young Ko, Jochen Koenemann, Mohammad Shadravan, and Madhur Tulsiani
IPCO, 2014
Approximation Algorithm for Sparsest k-Partitioning
with Konstantin Makarychev
SODA, 2014
The Complexity of Approximating Vertex Expansion
with Prasad Raghavendra and Santosh Vempala
FOCS, 2013
Many Sparse Cuts via Higher Eigenvalues
with Prasad Raghavendra, Prasad Tetali and Santosh Vempala
STOC, 2012
Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions
with Prasad Raghavendra, Prasad Tetali and Santosh Vempala
APPROX, 2011
A 3-approximation for facility location with uniform capacities
with Ankit Aggarwal, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain
The 14th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2010
Improved Algorithm for Degree Bounded Steiner Network Problem
with Nisheeth Vishnoi
12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2010
Cut-Matching Games for Directed Graphs
Manuscript, 2010