Approximating Unique Games Using Low Diameter Graph Decomposition. - Vedat Levi Alev; Lap Chi Lau (APPROX-RANDOM, 2017)

Graph Clustering using Effective Resistance. - Vedat Levi Alev; Nima Anari; Lap Chi Lau; Shayan Oveis Gharan (ITCS, 2018)

Approximating Constraint Satisfaction Problems on High-Dimensional Expanders. - Vedat Levi Alev; Fernando Granha Jeronimo; Madhur Tulsiani (FOCS, 2019)

List Decoding of Direct Sum Codes. - Vedat Levi Alev; Fernando Granha Jeronimo; Dylan Quintana; Shashank Srivastava; Madhur Tulsiani (SODA, 2020)

Improved analysis of higher order random walks and applications. - Vedat Levi Alev; Lap Chi Lau (STOC, 2020)

Sequential Sweeps and High Dimensional Expansion. - Vedat Levi Alev; Ori Parzanchevski (CoRR, 2023)

Expanderizing Higher Order Random Walks. - Vedat Levi Alev; Shravas Rao (APPROX/RANDOM, 2024)