Anand Louis

According to our database1, Anand Louis authored at least 38 papers between 2010 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Approximating CSPs with Outliers.
CoRR, 2022

Sampling Random Group Fair Rankings.
CoRR, 2022

Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Independent Sets in Semi-random Hypergraphs.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Approximation Algorithms and Hardness for Strong Unique Games.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Graph Neural Networks for Soft Semi-Supervised Learning on Hypergraphs.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2021

Matchings with Group Fairness Constraints: Online and Offline Algorithms.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

On the Problem of Underranking in Group-Fair Ranking.
Proceedings of the 38th International Conference on Machine Learning, 2021

Group Fairness for Knapsack Problems.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020
Ranking for Individual and Group Fairness Simultaneously.
CoRR, 2020

Robust Identifiability in Linear Structural Equation Models of Causal Inference.
CoRR, 2020

On the Complexity and Approximation of λ<sub>∞</sub> Spread Constant and Maximum Variance Embedding.
CoRR, 2020

Planted Models for the Densest k-Subgraph Problem.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

NHP: Neural Hypergraph Link Prediction.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019
Stability of Linear Structural Equation Models of Causal Inference.
Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

HyperGCN: A New Method For Training Graph Convolutional Networks on Hypergraphs.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Planted Models for k-Way Edge and Vertex Expansion.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Approximation Algorithms for Partially Colorable Graphs.
Proceedings of the Approximation, 2019

On Euclidean k-Means Clustering with alpha-Center Proximity.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms.
J. ACM, 2018

HyperGCN: Hypergraph Convolutional Networks for Semi-Supervised Classification.
CoRR, 2018

Clustering Perturbation Resilient Instances.
CoRR, 2018

Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Finding Pseudorandom Colorings of Pseudorandom Graphs.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016
Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion.
Theory Comput., 2016

Accelerated Newton Iteration for Roots of Black Box Polynomials.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Accelerated Newton Iteration: Roots of Black Box Polynomials and Matrix Eigenvalues.
CoRR, 2015

Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
Approximation Algorithm for Sparsest <i>k</i>-Partitioning.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Linear Programming Hierarchies Suffice for Directed Steiner Tree.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013
A 3-approximation algorithm for the facility location problem with uniform capacities.
Math. Program., 2013

Approximation Algorithm for Sparsest k-Partitioning.
CoRR, 2013

The Complexity of Approximating Vertex Expansion.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Many sparse cuts via higher eigenvalues.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011
Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Cut-Matching Games on Directed Graphs
CoRR, 2010

Improved Algorithm for Degree Bounded Survivable Network Design Problem.
Proceedings of the Algorithm Theory, 2010

A 3-Approximation for Facility Location with Uniform Capacities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010


  Loading...