Mohammad Roghani

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 21

Top Topics

Maximum Matching

Orders Of Magnitude

Theoretical Analysis

Top Venues

Publications

Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
Approximating Maximum Matching Requires Almost Quadratic Time. CoRR (2024)
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
Sublinear Algorithms for TSP via Path Covers. ICALP (2024)
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
Approximating Maximum Matching Requires Almost Quadratic Time. STOC (2024)
Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani
Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS. CoRR (2024)
Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani
Fully Dynamic Matching: -Approximation in Polylog Update Time. SODA (2024)
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching. STOC (2023)
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
Sublinear Algorithms for TSP via Path Covers. CoRR (2023)
Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani
Fully Dynamic Matching: (2-√2)-Approximation in Polylog Update Time. CoRR (2023)
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
Beating Greedy Matching in Sublinear Time. SODA (2023)
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
Local Computation Algorithms for Maximum Matching: New Lower Bounds. CoRR (2023)
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
Local Computation Algorithms for Maximum Matching: New Lower Bounds. FOCS (2023)
Mohammad Roghani, Amin Saberi, David Wajc
Beating the Folklore Algorithm for Dynamic Matching. ITCS (2022)
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
Beating Greedy Matching in Sublinear Time. CoRR (2022)
Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. CoRR (2022)
Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. EC (2022)
Saieed Akbari, Hossein Baktash, Amin Behjati, Afshin Behmaram, Mohammad Roghani
Some Results on Dominating Induced Matchings. Graphs Comb. 38 (3) (2022)
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching. CoRR (2022)
Mohammad Roghani, Amin Saberi, David Wajc
Beating the Folklore Algorithm for Dynamic Matching. CoRR (2021)
Yeganeh Alimohammadi, Persi Diaconis, Mohammad Roghani, Amin Saberi
Sequential importance sampling for estimating expectations over the space of perfect matchings. CoRR (2021)
Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi
Complexity of Computing the Anti-Ramsey Numbers for Paths. MFCS (2020)
Saieed Akbari, Hossein Baktash, Amin Behjati, Afshin Behmaram, Mohammad Roghani
Some Results on Dominating Induced Matchings. CoRR (2019)