Anand Louis

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 54

Top Topics

Structural Equation Models

Approximation Algorithms

Top Venues

Publications

Anand Louis, Rameesh Paul, Arka Ray
Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes. SWAT (2024)
Anand Louis, Alantha Newman, Arka Ray
Improved linearly ordered colorings of hypergraphs via SDP rounding. CoRR (2024)
Suprovat Ghoshal, Anand Louis
New Approximation Bounds for Small-Set Vertex Expansion. SODA (2024)
Sruthi Gorantla, Eshaan Bhansali, Amit Deshpande, Anand Louis
Optimizing Learning-to-Rank Models for Ex-Post Fair Relevance. SIGIR (2024)
Anand Louis, Meghana Nasre, Prajakta Nimbhorkar, Govind S. Sankar
Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints. ECAI (2023)
Sruthi Gorantla, Anay Mehrotra, Amit Deshpande, Anand Louis
Sampling Individually-Fair Rankings that are Always Group Fair. AIES (2023)
Suprovat Ghoshal, Anand Louis
New Approximation Bounds for Small-Set Vertex Expansion. CoRR (2023)
Sruthi Gorantla, Kishen N. Gowda, Amit Deshpande, Anand Louis
Socially Fair Center-Based and Linear Subspace Clustering. ECML/PKDD (1) (2023)
Sruthi Gorantla, Amit Deshpande, Anand Louis
Sampling Ex-Post Group-Fair Rankings. IJCAI (2023)
Sruthi Gorantla, Anay Mehrotra, Amit Deshpande, Anand Louis
Sampling Individually-Fair Rankings that are Always Group Fair. CoRR (2023)
Sruthi Gorantla, Eshaan Bhansali, Amit Deshpande, Anand Louis
Optimizing Group-Fair Plackett-Luce Ranking Models for Relevance and Ex-Post Fairness. CoRR (2023)
Karthik Abinav Sankararaman, Anand Louis, Navin Goyal
Robust identifiability in linear structural equation models of causal inference. UAI (2022)
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
Matchings Under Diversity Constraints. CoRR (2022)
Akash Kumar, Anand Louis, Rameesh Paul
Exact recovery algorithm for Planted Bipartite Graph in Semi-random Graphs. CoRR (2022)
Suprovat Ghoshal, Anand Louis
Approximating CSPs with Outliers. APPROX/RANDOM (2022)
Anand Louis, Rameesh Paul, Arka Ray
Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes. CoRR (2022)
Suprovat Ghoshal, Anand Louis
Approximating CSPs with Outliers. CoRR (2022)
Sruthi Gorantla, Amit Deshpande, Anand Louis
Sampling Random Group Fair Rankings. CoRR (2022)
Akash Kumar, Anand Louis, Rameesh Paul
Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs. ICALP (2022)
Sruthi Gorantla, Kishen N. Gowda, Amit Deshpande, Anand Louis
Socially Fair Center-based and Linear Subspace Clustering. CoRR (2022)
Atasi Panda, Anand Louis, Prajakta Nimbhorkar
Bipartite Matchings with Group Fairness and Individual Fairness Constraints. CoRR (2022)
Suprovat Ghoshal, Anand Louis
Approximation Algorithms and Hardness for Strong Unique Games. SODA (2021)
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
Matchings with Group Fairness Constraints: Online and Offline Algorithms. IJCAI (2021)
Yash Khanna, Anand Louis, Rameesh Paul
Independent Sets in Semi-random Hypergraphs. CoRR (2021)
Naganand Yadati, Tingran Gao, Shahab Asoodeh, Partha P. Talukdar, Anand Louis
Graph Neural Networks for Soft Semi-Supervised Learning on Hypergraphs. PAKDD (1) (2021)
Deval Patel, Arindam Khan, Anand Louis
Group Fairness for Knapsack Problems. AAMAS (2021)
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
Matchings with Group Fairness Constraints: Online and Offline Algorithms. CoRR (2021)
Sruthi Gorantla, Amit Deshpande, Anand Louis
On the Problem of Underranking in Group-Fair Ranking. ICML (2021)
Yash Khanna, Anand Louis, Rameesh Paul
Independent Sets in Semi-random Hypergraphs. WADS (2021)
Yash Khanna, Anand Louis
Planted Models for the Densest $k$-Subgraph Problem. CoRR (2020)
Majid Farhadi, Anand Louis, Prasad Tetali
Spread Constant and Maximum Variance Embedding. CoRR (2020)
Sruthi Gorantla, Amit Deshpande, Anand Louis
Ranking for Individual and Group Fairness Simultaneously. CoRR (2020)
Naganand Yadati, Vikram Nitin, Madhav Nimishakavi, Prateek Yadav, Anand Louis, Partha P. Talukdar
NHP: Neural Hypergraph Link Prediction. CIKM (2020)
Suprovat Ghoshal, Anand Louis
Approximation Algorithms and Hardness for Strong Unique Games. CoRR (2020)
Deval Patel, Arindam Khan, Anand Louis
Group Fairness for Knapsack Problems. CoRR (2020)
Yash Khanna, Anand Louis
Planted Models for the Densest k-Subgraph Problem. FSTTCS (2020)
Karthik Abinav Sankararaman, Anand Louis, Navin Goyal
Robust Identifiability in Linear Structural Equation Models of Causal Inference. CoRR (2020)
Amit Deshpande, Anand Louis, Apoorv Vikram Singh
On Euclidean k-Means Clustering with alpha-Center Proximity. AISTATS (2019)
Suprovat Ghoshal, Anand Louis, Rahul Raychaudhury
Approximation Algorithms for Partially Colorable Graphs. APPROX-RANDOM (2019)
Karthik Abinav Sankararaman, Anand Louis, Navin Goyal
Stability of Linear Structural Equation Models of Causal Inference. CoRR (2019)
Suprovat Ghoshal, Anand Louis, Rahul Raychaudhury
Approximation Algorithms for Partially Colorable Graphs. CoRR (2019)
Anand Louis, Rakesh Venkat
Planted Models for k-way Edge and Vertex Expansion. CoRR (2019)
Anand Louis, Rakesh Venkat
Planted Models for k-Way Edge and Vertex Expansion. FSTTCS (2019)
Naganand Yadati, Madhav Nimishakavi, Prateek Yadav, Vikram Nitin, Anand Louis, Partha P. Talukdar
HyperGCN: A New Method For Training Graph Convolutional Networks on Hypergraphs. NeurIPS (2019)
Karthik Abinav Sankararaman, Anand Louis, Navin Goyal
Stability of Linear Structural Equation Models of Causal Inference. UAI (2019)
Naganand Yadati, Madhav Nimishakavi, Prateek Yadav, Anand Louis, Partha Pratim Talukdar
HyperGCN: Hypergraph Convolutional Networks for Semi-Supervised Classification. CoRR (2018)
Amit Deshpande, Anand Louis, Apoorv Vikram Singh
Clustering Perturbation Resilient Instances. CoRR (2018)
Anand Louis, Rakesh Venkat
Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery. ICALP (2018)
T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. J. ACM 65 (3) (2018)
Anand Louis, Rakesh Venkat
Semi-Random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery. CoRR (2018)
Akash Kumar, Anand Louis, Madhur Tulsiani
Finding Pseudorandom Colorings of Pseudorandom Graphs. FSTTCS (2017)
T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. CoRR (2016)
Anand Louis, Yury Makarychev
Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion. Theory Comput. 12 (1) (2016)
Anand Louis, Santosh S. Vempala
Accelerated Newton Iteration for Roots of Black Box Polynomials. FOCS (2016)
Anand Louis, Santosh S. Vempala
Accelerated Newton Iteration: Roots of Black Box Polynomials and Matrix Eigenvalues. CoRR (2015)
Anand Louis
Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms. STOC (2015)
Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani
Linear Programming Hierarchies Suffice for Directed Steiner Tree. IPCO (2014)
Anand Louis
Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms. CoRR (2014)
Anand Louis, Yury Makarychev
Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion. APPROX-RANDOM (2014)
Anand Louis, Yury Makarychev
Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion. CoRR (2014)
Anand Louis, Konstantin Makarychev
-Partitioning. SODA (2014)
Anand Louis, Konstantin Makarychev
Approximation Algorithm for Sparsest k-Partitioning. CoRR (2013)
Anand Louis, Prasad Raghavendra, Santosh S. Vempala
The Complexity of Approximating Vertex Expansion CoRR (2013)
Anand Louis, Prasad Raghavendra, Santosh S. Vempala
The Complexity of Approximating Vertex Expansion. FOCS (2013)
Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain
A 3-approximation algorithm for the facility location problem with uniform capacities. Math. Program. 141 (1-2) (2013)
Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala
Many sparse cuts via higher eigenvalues. STOC (2012)
Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala
Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions. APPROX-RANDOM (2011)
Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala
Many Sparse Cuts via Higher Eigenvalues CoRR (2011)
Anand Louis
Cut-Matching Games on Directed Graphs CoRR (2010)
Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain
A 3-Approximation for Facility Location with Uniform Capacities. IPCO (2010)
Anand Louis, Nisheeth K. Vishnoi
Improved Algorithm for Degree Bounded Survivable Network Design Problem. SWAT (2010)
Anand Louis, Nisheeth K. Vishnoi
Improved Algorithm for Degree Bounded Survivable Network Design Problem CoRR (2009)