In the name of God 

Shayan Oveis GharanAssociate ProfessorComputer Science and Engineering University of Washington A short bio and my CV 
I am mainly interested in the design and analysis of algorithms using algebraic techniques.
I am looking for strong graduate students and Postdocs in theory of computing.
If you are intersted in working with me take a look at my recent advanced courses Modern Spectral Graph Theory, The Polynomial Paradigm in Algorithms.
In Spring 2019 I coorganized a semester long program on Geometry of Polynomials. Here is a research vignette about my works on Logconcave polynomials with connections to the Geometry of Polynomials program.
F. Ebrahimnejad, A. Nagda, S. Oveis Gharan, On approximability of the Permanent of PSD matrices, submitted 2024.
D. Abdolazimi, K. Lindberg, S. Oveis Gharan, On Optimization and Counting of NonBroken Bases of Matroids, Random 2023.
A. Karlin, N. Klein, S. Oveis Gharan, A (Slightly) Improved Deterministic Approximation Algorithm for Metric TSP, IPCO, 2023.
A. Abdolazimi, S. Oveis Gharan, An Improved TrickleDown Theorem for Partite Complexes, CCC 2023.
D. Abdolazimi, A. Karlin, N. Klein, S. Oveis Gharan, Matroid Partition Property and the Secretary Problem, ITCS 2023.
A. Karlin, N. Klein, S. Oveis Gharan, A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP, FOCS 2022.
F. Ebrahimnejad, A. Nagda, S. Oveis Gharan Counting and Sampling Perfect Matchings in Regular Expanding NonBipartite Graphs, ITCS 2022.
A. Karlin, N. Klein, S. Oveis Gharan, X. Zhang An Improved Approximation Algorithm for the Minimum kEdge Connected MultiSubgraph Problem, STOC 2022.
D. Abdolazimi, K. Liu, S. Oveis Gharan, A Matrix TrickleDown Theorem on Simplicial Complexes and Applications to Sampling Colorings, FOCS 2021.
N. Anari, K. Liu, S. Oveis Gharan, Cynthia Vinzant, T. Vuong, LogConcave Polynomials IV: Approximate Exchange, Tight Mixing Times, and NearOptimal Sampling of Forests, STOC 2021.
A. Karlin, N. Klein, S. Oveis Gharan, A (Slightly) Improved Approximation Algorithm for Metric TSP, STOC 2021.
N. Anari, K. Liu, S. Oveis Gharan, Spectral Independence in HighDimensional Expanders and Applications to the Hardcore Model, FOCS 2020, invited to special issue.
N. Anari, K. Liu, S. Oveis Gharan, C. Vinzant, LogConcave Polynomials III: Mason's UltraLogConcavity Conjecture for Independent Sets of Matroids, submitted, 2018.
N. Anari, K. Liu, S. Oveis Gharan, C. Vinzant, LogConcave Polynomials II: HighDimensional Walks and an FPRAS for Counting Bases of a Matroid, STOC 2019.
N. Anari, S. Oveis Gharan, C. Vinzant, LogConcave Polynomials I: Entropy and a Deterministic Approximation Algorithm for Counting Bases of Matroids, FOCS 2018.
N. Anari, S. Oveis Gharan, EffectiveResistanceReducing Flows, Spectrally Thin Trees, and Asymmetric TSP. See also our recent extension of the proof of KadisonSinger conjecture by Marcus, Spielman, and Srivastava. See this note for a somewhat short exposition of the ideas. Also, here are short and long presentations of the ideas of the paper. See here for a nice article by Dana Mackenzie about this article.
S. Oveis Gharan, New Rounding Techniques for the Design and Analysis of Approximation Algorithms , PhD thesis, Stanford 2013, ACM Doctoral Dissertation Award Honorable Mention.
S. Oveis Gharan, A. Saberi, M. Singh, A Randomized Rounding Approach to the Traveling Salesman Problem. , FOCS 2011, best paper award.
J. R. Lee, S. Oveis Gharan, L. Trevisan, Multiway spectral partitioning and higherorder Cheeger inequalities , STOC 2012, JACM 2014.
A. Asadpour, A. Madry, M. Goemans, S. Oveis Gharan, A. Saberi, An O(log n/ log log n)approximation Algorithm for the Asymmetric Traveling Salesman Problem , SODA 2010, best paper award.
See here for a full list of my publications.Students / Mentee: