About me

I am currently a PhD student at Northeastern University in the CS Theory Group where I am fortunate to be advised by Soheil Behnezhad and Mahsa Derakhshan.

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.

Publications

Streaming Edge Coloring with Asymptotically Optimal Colors
Soheil Behnezhad, Mohammad Saneian
(ICALP-2024) 51st International Colloquium on Automata, Languages, and Programming.
Full Version

Simple Streaming Algorithms for Edge Coloring
Mohammad Ansari, Mohammad Saneian, Hamid Zarrabi-Zadeh
(ESA-2022) 30th Annual European Symposium on Algorithms
Full Version

Are socially-aware trajectory prediction models really socially-aware?
Saeed Saadatnejad, Mohammadhossein Bahari, Pedram Khorsandi, Mohammad Saneian, Seyed-Mohsen Moosavi-Dezfooli, Alexandre Alahi
Journal of Transportation Research Part C , 2022
Full Version

Preprints

Query Efficient Weighted Stochastic Matching
Mahsa Derakhshan, Mohammad Saneian
Submitted to SODA 2024
Full Version

I have two other papers one titled A Simple Analysis of Ranking in General Graphs in submission to SOSA 2024 and one titled Query Complexity of Stochastic Minimum Vertex Cover in submission to ITCS 2025.

Awards and honors

Silver medal in the International Olympiad in Informatics IOI-2017.
Onsite contest finalist at snackdown19, Ranked 23 among 25000 teams.
Silver medal in the Asia Pacific Olympiad in Informatics APIO-2017.
Gold medal in the Iran National Olympiad in Informatics 2016.
Gold medal in the ACM ICPC regional contest 2018.