About me
I recently completed my PhD at Northeastern University where I was advised by Soheil Behnezhad and Mahsa Derakhshan. My thesis is on matching algorithms under uncertainty. Here is the link to access it.
I am broadly interested in theoretical computer science. More specifically, I am interested in designing algorithms for large-scale graphs, such as the streaming model, or models with uncertainty such as the stochastic model.
Starting in 2026, I will be joining TextQL as a Research Scientist.
Publications
Improved Approximation for Ranking on General Graphs
Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu
(SODA-2026) ACM–SIAM Symposium on Discrete Algorithms.
Full VersionA Simple Analysis of Ranking in General Graphs
Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu
(SOSA-2025) Symposium on Simplicity in Algorithms.
Full VersionQuery Efficient Weighted Stochastic Matching
Mahsa Derakhshan, Mohammad Saneian
(ICALP-2025) International Colloquium on Automata, Languages, and Programming.
Full VersionQuery Complexity of Stochastic Minimum Vertex Cover
Mahsa Derakhshan, Mohammad Saneian, Zihan Xun
(ITCS-2025) Innovations in Theoretical Computer Science.
Full VersionStreaming Edge Coloring with Asymptotically Optimal Colors
Soheil Behnezhad, Mohammad Saneian
(ICALP-2024) 51st International Colloquium on Automata, Languages, and Programming.
Full VersionSimple Streaming Algorithms for Edge Coloring
Mohammad Ansari, Mohammad Saneian, Hamid Zarrabi-Zadeh
(ESA-2022) 30th Annual European Symposium on Algorithms.
Full VersionAre socially-aware trajectory prediction models really socially-aware?
Saeed Saadatnejad, Mohammadhossein Bahari, Pedram Khorsandi, Mohammad Saneian, Seyed-Mohsen Moosavi-Dezfooli, Alexandre Alahi
Transportation Research Part C, 2022
Full Version
Awards and honors
Silver medal in the International Olympiad in Informatics (IOI-2017).
Onsite contest finalist at SnackDown 2019, ranked 23 among 25,000 teams.
Gold medal in the Iran National Olympiad in Informatics 2016.
