Mohammad Roghani

According to our database, Mohammad Roghani authored at least 20 papers between 2020 and 2025.

Collaborative distances:

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

2025

Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance.

Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein

CoRR, October, 2025

Sublinear Metric Steiner Forest via Maximal Independent Set.

Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian

CoRR, October, 2025

A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time.

Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski

CoRR, June, 2025

Sublinear Metric Steiner Tree via Improved Bounds for Set Cover.

Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian

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

Stable Matching with Interviews.

Itai Ashlagi, Jiale Chen, Mohammad Roghani, Amin Saberi

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

A 0.51-Approximation of Maximum Matching in Sublinear n^{1.5} Time.

Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski

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

2024

Approximating Maximum Matching Requires Almost Quadratic Time.

Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Fully Dynamic Matching: -Approximation in Polylog Update Time.

Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS.

Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Sublinear Algorithms for TSP via Path Covers.

Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi

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

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting.

Ruiquan Gao, Mohammad Roghani, Aviad Rubinstein, Amin Saberi

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Fully Dynamic Matching: (2-√2)-Approximation in Polylog Update Time.

Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani

CoRR, 2023

Sublinear Time Algorithms and Complexity of Approximate Maximum Matching.

Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Beating Greedy Matching in Sublinear Time.

Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Local Computation Algorithms for Maximum Matching: New Lower Bounds.

Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Some Results on Dominating Induced Matchings.

Saieed Akbari, Hossein Baktash, Amin Behjati, Afshin Behmaram, Mohammad Roghani

Graphs Comb., 2022

Improved Online Contention Resolution for Matchings and Applications to the Gig Economy.

Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Beating the Folklore Algorithm for Dynamic Matching.

Mohammad Roghani, Amin Saberi, David Wajc

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Sequential importance sampling for estimating expectations over the space of perfect matchings.

Yeganeh Alimohammadi, Persi Diaconis, Mohammad Roghani, Amin Saberi

CoRR, 2021

2020

Complexity of Computing the Anti-Ramsey Numbers for Paths.

Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020