Anand Louis Graduate Student

I am a fifth year graduate student in the ACO program at the College of Computing. I am advised by Santosh Vempala.
Before coming here, I got my B. Tech from the Department of Computer Science and Engineering, IIT Delhi where I worked with Naveen Garg .
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 kPartitioning
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
RANDOMAPPROX, 2011
A 3approximation for facility location with uniform capacities
with Ankit Aggarwal, Naveen Garg, Shubham Gupta
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
CutMatching Games for Directed Graphs
Manuscript, 2010
Graph Partitioning Using Single Commodity Flows : An Emperical Study
Anand Louis, Vinayaka Pandit
Manuscript, 2008
The Complexity of Expansion Problems
Ph.D. Thesis, Georgia Tech