| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Approximating CSPs with Outliers | Ghoshal, Suprovat et al. | 2022 |
| 2 | Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs | Kumar, Akash et al. | 2022 |
| 3 | Planted Models for the Densest k-Subgraph Problem | Khanna, Yash et al. | 2020 |
| 4 | Approximation Algorithms for Partially Colorable Graphs | Ghoshal, Suprovat et al. | 2019 |
| 5 | Planted Models for k-Way Edge and Vertex Expansion | Louis, Anand et al. | 2019 |
| 6 | Finding Pseudorandom Colorings of Pseudorandom Graphs | Kumar, Akash et al. | 2018 |
| 7 | Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery | Louis, Anand et al. | 2018 |
| 8 | Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion | Louis, Anand et al. | 2014 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |