Anand Louis - RankMe

82 papers A* 17A 8B 3C 1Journal 40Unranked 12

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