Anand Louis

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
New approximation bounds for small-set vertex expansion	2024-11-28	Paper
Approximating CSPs with outliers	2024-08-22	Paper
Exact recovery algorithm for planted bipartite graph in semi-random graphs	2024-06-24	Paper
https://portal.mardi4nfdi.de/entity/Q6147275	2024-01-15	Paper
Planted Models for k-Way Edge and Vertex Expansion	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5875482	2023-02-03	Paper
Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes	2022-12-27	Paper
Independent sets in semi-random hypergraphs	2022-03-25	Paper
Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery	2021-07-28	Paper
Finding Pseudorandom Colorings of Pseudorandom Graphs	2020-11-25	Paper
Approximation Algorithm for Sparsest k-Partitioning	2019-06-20	Paper
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms	2018-12-06	Paper
Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion	2017-03-22	Paper
Approximation algorithms for hypergraph small-set expansion and small-set vertex expansion	2016-11-01	Paper
Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms	2015-08-21	Paper
Linear Programming Hierarchies Suffice for Directed Steiner Tree	2014-06-02	Paper
Many sparse cuts via higher eigenvalues	2014-05-13	Paper
A 3-approximation algorithm for the facility location problem with uniform capacities	2013-11-11	Paper
Algorithmic extensions of Cheeger's inequality to higher eigenvalues and partitions	2011-08-17	Paper
Improved algorithm for degree bounded survivable network design problem	2010-06-22	Paper

Research outcomes over time

This page was built for person: Anand Louis