Shayan Oveis Gharan

Shayan Oveis Gharan
Name	Shayan Oveis Gharan
Occupation	Computer scientist, researcher
Employer	Microsoft Research
Alma mater	University of Tehran; Massachusetts Institute of Technology
Known for	Algorithms, spectral graph theory, optimization

Shayan Oveis Gharan is a computer scientist notable for work in theoretical computer science, algorithms, and spectral graph theory. He has held research positions at major institutions and contributed to algorithmic foundations influencing practice in networking and machine learning. His research intersects with combinatorics, probability, and optimization.

Early life and education

Born in Iran, Oveis Gharan received early schooling that led to studies at the University of Tehran where he completed undergraduate work before moving to the United States for graduate study. He undertook doctoral research at the Massachusetts Institute of Technology under advisors associated with the Theory of Computation community and engaged with seminars linked to researchers from the Simons Institute for the Theory of Computing and the Institute for Advanced Study. During his training he interacted with scholars from institutions such as Stanford University, Princeton University, Harvard University, and the University of California, Berkeley.

Career and research

Oveis Gharan has held positions at corporate and academic research centers including Microsoft Research and visiting appointments connected to the Carnegie Mellon University and the University of Washington. His research program connects to landmark problems addressed by figures at the Clay Mathematics Institute, the European Research Council, and collaborations with faculty from the University of Chicago, Columbia University, and the California Institute of Technology. He has presented at venues including the ACM Symposium on Theory of Computing, the IEEE Symposium on Foundations of Computer Science, and workshops at the International Congress of Mathematicians.

His work draws on techniques associated with the Lovász Local Lemma, the Probabilistic Method as used by Paul Erdős and Alfréd Rényi, and the Spectral Graph Theory tradition originating with Fiedler and advanced by researchers at Princeton University and MIT. Collaborations and citations connect to authors from Google Research, Facebook AI Research, the National Science Foundation, and institutes such as the Max Planck Institute for Informatics and the Weizmann Institute of Science.

Major contributions and publications

Oveis Gharan's contributions include results on approximation algorithms for combinatorial optimization problems historically studied alongside work on the Traveling Salesman Problem, the Minimum Spanning Tree, and the Steiner Tree Problem. He produced advances in understanding eigenvalue-based methods related to the Cheeger inequality and to spectral sparsification themes developed in papers from researchers at Microsoft Research and Stanford University. His publications appear in proceedings of the ACM STOC, the IEEE FOCS, and journals associated with the American Mathematical Society and the SIAM Journal on Computing.

He has coauthored papers with scholars who have ties to the ETH Zurich, the University of Toronto, and the University of British Columbia, and his work is frequently cited alongside that of Noga Alon, Michael Mitzenmacher, Amin Saberi, and David Karger. Specific contributions address randomized rounding techniques linked to methods from Raghavan and Thompson and matrix concentration inequalities connected to research by Joel Tropp and Nikhil Srivastava.

Awards and honors

Oveis Gharan has received recognition from organizations that award excellence in theoretical computer science, including prizes and fellowships associated with the ACM, the National Science Foundation Graduate Research Fellowship Program, and honors with ties to the Simons Foundation. He has been invited to give talks at international meetings such as the International Colloquium on Automata, Languages and Programming and has held visiting fellowships akin to appointments at the Institute for Advanced Study.

Personal life and affiliations

Outside research, he maintains affiliations with professional societies including the Association for Computing Machinery and the IEEE Computer Society and collaborates with academic networks spanning the European Association for Theoretical Computer Science and the International Mathematical Union community. He has participated in outreach and mentorship activities linked to programs at the Massachusetts Institute of Technology, the University of Tehran, and research internships coordinated with Microsoft Research and university laboratories.

Category:Computer scientists Category:Theoretical computer scientists