| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Planted Models for k-Way Edge and Vertex Expansion | Louis, Anand et al. | 2019 |
| 2 | Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery | Louis, Anand et al. | 2018 |
| 3 | Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces | Rabani, Yuval et al. | 2017 |
| 4 | Multiplayer Parallel Repetition for Expanding Games | Dinur, Irit et al. | 2017 |
| 5 | Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1 | Deshpande, Amit et al. | 2016 |
| 6 | On Fortification of Projection Games | Bhangale, Amey et al. | 2015 |
| 7 | Guruswami-Sinop Rounding without Higher Level Lasserre | Deshpande, Amit et al. | 2014 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |