I am a third-year Ph.D. student at Stanford University, where I am very fortunate to be advised by Amin Saberi and Aviad Rubinstein. Before joining Stanford University, I received my B.Sc. in Computer Engineering from Sharif University of Technology. I am broadly interested in theoretical computer science. More specifically, I am working on designing algorithms for large-scale graph problems and graph problems in an uncertain environment, which includes sublinear algorithms, dynamic algorithms, local computation algorithm (LCA), and online algorithms.
In the summer of 2022 and 2023, I was an intern in the dynamic pricing team at Uber working on riders’ surge pricing.
Publications
Sublinear Algorithms for TSP via Path Covers
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
(ICALP 2024) International Colloquium on Automata, Languages and Programming 2024 – Full Version
Approximating Maximum Matching Requires Almost Quadratic Time
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
(STOC 2024) ACM Symposium on Theory of Computing 2024
Fully Dynamic Matching: $(2-\sqrt{2})$-Approximation in Polylog Update Time
Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani
(SODA 2024) ACM-SIAM Symposium on Discrete Algorithms 2024 – Full Version
Local Computation Algorithms for Maximum Matching: New Lower Bounds
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
(FOCS 2023) IEEE Symposium on Foundations of Computer Science 2023 – Full Version
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
(STOC 2023) ACM Symposium on Theory of Computing 2023 – Full Version
Beating Greedy Matching in Sublinear Time
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
(SODA 2023) ACM-SIAM Symposium on Discrete Algorithms 2023 – Full Version
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy
Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc
(EC 2022) ACM Conference on Economics and Computation 2022 – Full Version
Sequential Importance Sampling for Estimating Expectations over the Space of Perfect Matchings
Yeganeh Alimohammadi, Persi Diaconis, Mohammad Roghani, Amin Saberi
Annals of Applied Probability – Full Version
Beating the Folklore Algorithm for Dynamic Matching
Mohammad Roghani, Amin Saberi, David Wajc
(ITCS 2022) Innovations in Theoretical Computer Science 2022 – Full Version
Complexity of Computing the Anti-Ramsey Numbers for Paths
Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi
(MFCS 2020) International Symposium on Mathematical Foundations of Computer Science 2020 – Full Version
Some Results on Dominating Induced Matching
Saieed Akbari, Hossein Baktash, Amin Behjati, Afshin Behmaram, Mohammad Roghani
Graphs and Combinatorics – Full Version
TPS (Task Preparation System): A Tool for Developing Tasks in Programming Contests
Kian Mirjalali, Amirkeivan Mohtashami, Mohammad Roghani, Hamid Zarrabi-Zadeh
Olympiads in Informatics 2019 – Full Version
Fellowships & Awards
Recipient of the Krishnan Shah Graduate Fellowship 2023.
Recipient of the Charles and Katharine Lin Graduate Fellowship 2022.
Recipient of the Eltoukhy Family Graduate Fellowship 2021.
Gold Medal in the Iran National Olympiad in Informatics (INOI), 2014.
Silver Medal in the Asia Pacific Olympiad in Informatics (APIO), Indonesia, 2015.
2nd and 3rd team in the ACM-ICPC West Asia Regional Contest 2015 and 2017, respectively.