Mohammad Saneian

According to our database, Mohammad Saneian authored at least 9 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

A Simple Analysis of Ranking in General Graphs.

Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu

Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

Improved Approximation for Ranking on General Graphs.

Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Half-Approximating Maximum Dicut in the Streaming Setting.

Amir Azarmehr, Soheil Behnezhad, Shane Ferrante, Mohammad Saneian

CoRR, December, 2025

A Simple Analysis of Ranking in General Graphs.

Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu

CoRR, November, 2025

Query Complexity of Stochastic Minimum Vertex Cover.

Mahsa Derakhshan, Mohammad Saneian, Zhiyang Xun

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Query Efficient Weighted Stochastic Matching.

Mahsa Derakhshan, Mohammad Saneian

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Streaming Edge Coloring with Asymptotically Optimal Colors.

Mohammad Saneian, Soheil Behnezhad

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2022

Simple Streaming Algorithms for Edge Coloring.

Mohammad Ansari, Mohammad Saneian, Hamid Zarrabi-Zadeh

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Are socially-aware trajectory prediction models really socially-aware?

Saeed Saadatnejad, Mohammadhossein Bahari, Pedram Khorsandi, Mohammad Saneian, Seyed-Mohsen Moosavi-Dezfooli, Alexandre Alahi

CoRR, 2021