Anand Louis
Anand Louis
Indian Institute of Science
Verified email at
TitleCited byYear
Many sparse cuts via higher eigenvalues
A Louis, P Raghavendra, P Tetali, S Vempala
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
Hypergraph markov operators, eigenvalues and approximation algorithms
A Louis
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
A 3-approximation algorithm for the facility location problem with uniform capacities
A Aggarwal, A Louis, M Bansal, N Garg, N Gupta, S Gupta, S Jain
Mathematical Programming 141 (1-2), 527-547, 2013
A 3-approximation for facility location with uniform capacities
A Aggarwal, L Anand, M Bansal, N Garg, N Gupta, S Gupta, S Jain
Integer Programming and Combinatorial Optimization, 149-162, 2010
The complexity of approximating vertex expansion
A Louis, P Raghavendra, S Vempala
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 360-369, 2013
Approximation algorithm for sparsest k-partitioning
A Louis, K Makarychev
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014
Spectral properties of hypergraph Laplacian and approximation algorithms
THH Chan, A Louis, ZG Tang, C Zhang
Journal of the ACM (JACM) 65 (3), 15, 2018
Algorithmic extensions of Cheeger’s inequality to higher eigenvalues and partitions
A Louis, P Raghavendra, P Tetali, S Vempala
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011
Improved algorithm for degree bounded survivable network design problem
A Louis, NK Vishnoi
Scandinavian Workshop on Algorithm Theory, 408-419, 2010
Linear programming hierarchies suffice for directed Steiner tree
Z Friggstad, J Könemann, Y Kun-Ko, A Louis, M Shadravan, M Tulsiani
International Conference on Integer Programming and Combinatorial …, 2014
Approximation algorithms for hypergraph small set expansion and small set vertex expansion
A Louis, Y Makarychev
arXiv preprint arXiv:1404.4575, 2014
HyperGCN: A New Method For Training Graph Convolutional Networks on Hypergraphs
N Yadati, M Nimishakavi, P Yadav, V Nitin, A Louis, P Talukdar
Advances in Neural Information Processing Systems, 1509-1520, 2019
Accelerated newton iteration for roots of black box polynomials
A Louis, SS Vempala
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
On Euclidean k-Means Clustering with alpha-Center Proximity
A Deshpande, A Louis, A Singh
The 22nd International Conference on Artificial Intelligence and Statistics …, 2019
Cut-Matching Games on Directed Graphs
A Louis
Arxiv preprint arXiv:1010.1047, 2010
Stability of Linear Structural Equation Models of Causal Inference
KA Sankararaman, A Louis, N Goyal
arXiv preprint arXiv:1905.06836, 2019
Semi-Random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery
A Louis, R Venkat
arXiv preprint arXiv:1805.09747, 2018
Finding Pseudorandom Colorings of Pseudorandom Graphs
A Kumar, A Louis, M Tulsiani
37th IARCS Annual Conference on Foundations of Software Technology and …, 2018
Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion
A Louis, Y Makarychev
Theory of Computing 12 (1), 1-25, 2016
Planted Models for -way Edge and Vertex Expansion
A Louis, R Venkat
arXiv preprint arXiv:1910.08889, 2019
The system can't perform the operation now. Try again later.
Articles 1–20