Anand Louis

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Optimizing Group-Fair Plackett-Luce Ranking Models for Relevance and Ex-Post Fairness.

[BibT_eX]

[DOI]

CoRR, 2023

Socially Fair Center-Based and Linear Subspace Clustering.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases: Research Track, 2023

Sampling Ex-Post Group-Fair Rankings.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Sampling Individually-Fair Rankings that are Always Group Fair.

[BibT_eX]

[DOI]

Proceedings of the 2023 AAAI/ACM Conference on AI, Ethics, and Society, 2023

2022

Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes.

[BibT_eX]

[DOI]

Rameesh Paul

Arka Ray

CoRR, 2022

Matchings Under Diversity Constraints.

[BibT_eX]

[DOI]

CoRR, 2022

Bipartite Matchings with Group Fairness and Individual Fairness Constraints.

[BibT_eX]

[DOI]

Atasi Panda

Prajakta Nimbhorkar

CoRR, 2022

Sampling Random Group Fair Rankings.

[BibT_eX]

[DOI]

Karthik Abinav Sankararaman

CoRR, 2022

Robust identifiability in linear structural equation models of causal inference.

[BibT_eX]

[DOI]

Navin Goyal

Proceedings of the Uncertainty in Artificial Intelligence, 2022

Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs.

[BibT_eX]

[DOI]

Akash Kumar

Rameesh Paul

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Approximating CSPs with Outliers.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2022

2021

Independent Sets in Semi-random Hypergraphs.

[BibT_eX]

[DOI]

Yash Khanna

Rameesh Paul

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Approximation Algorithms and Hardness for Strong Unique Games.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Graph Neural Networks for Soft Semi-Supervised Learning on Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2021

Matchings with Group Fairness Constraints: Online and Offline Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

On the Problem of Underranking in Group-Fair Ranking.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Group Fairness for Knapsack Problems.

[BibT_eX]

[DOI]

Deval Patel

Arindam Khan

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Ranking for Individual and Group Fairness Simultaneously.

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

Majid Farhadi

Prasad Tetali

CoRR, 2020

Planted Models for the Densest k-Subgraph Problem.

[BibT_eX]

[DOI]

Yash Khanna

Karthik Abinav Sankararaman

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

NHP: Neural Hypergraph Link Prediction.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Navin Goyal

Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

HyperGCN: A New Method For Training Graph Convolutional Networks on Hypergraphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Rakesh Venkat

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Approximation Algorithms for Partially Colorable Graphs.

[BibT_eX]

[DOI]

Rahul Raychaudhury

Proceedings of the Approximation, 2019

On Euclidean k-Means Clustering with alpha-Center Proximity.

[BibT_eX]

[DOI]

Apoorv Vikram Singh

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018

Spectral Properties of Hypergraph Laplacian and Approximation Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2018

HyperGCN: Hypergraph Convolutional Networks for Semi-Supervised Classification.

[BibT_eX]

[DOI]

Partha Pratim Talukdar

CoRR, 2018

Clustering Perturbation Resilient Instances.

[BibT_eX]

[DOI]

Apoorv Vikram Singh

CoRR, 2018

Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery.

[BibT_eX]

[DOI]

Rakesh Venkat

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Finding Pseudorandom Colorings of Pseudorandom Graphs.

[BibT_eX]

[DOI]

Akash Kumar

Madhur Tulsiani

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.

[BibT_eX]

[DOI]

Yury Makarychev

Theory Comput., 2016

Accelerated Newton Iteration for Roots of Black Box Polynomials.

[BibT_eX]

[DOI]

Santosh S. Vempala

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.

[BibT_eX]

[DOI]

Santosh S. Vempala

CoRR, 2015

Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014

Approximation Algorithm for Sparsest <i>k</i>-Partitioning.

[BibT_eX]

[DOI]

Konstantin Makarychev

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Linear Programming Hierarchies Suffice for Directed Steiner Tree.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

A 3-approximation algorithm for the facility location problem with uniform capacities.

[BibT_eX]

[DOI]

Math. Program., 2013

Approximation Algorithm for Sparsest k-Partitioning.

[BibT_eX]

[DOI]

Konstantin Makarychev

CoRR, 2013

The Complexity of Approximating Vertex Expansion.

[BibT_eX]

[DOI]

Prasad Raghavendra

Santosh S. Vempala

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Many sparse cuts via higher eigenvalues.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Cut-Matching Games on Directed Graphs

[BibT_eX]

[DOI]

CoRR, 2010

Improved Algorithm for Degree Bounded Survivable Network Design Problem.

[BibT_eX]

[DOI]