Sequential importance sampling for estimating expectations over the space of perfect matchings. - Yeganeh Alimohammadi; Persi Diaconis; Mohammad Roghani; Amin Saberi (CoRR, 2021)

Beating the Folklore Algorithm for Dynamic Matching. - Mohammad Roghani; Amin Saberi; David Wajc (ITCS, 2022)

Some Results on Dominating Induced Matchings. - Saieed Akbari; Hossein Baktash; Amin Behjati; Afshin Behmaram; Mohammad Roghani (Graphs Comb., 2022)

Local Computation Algorithms for Maximum Matching: New Lower Bounds. - Soheil Behnezhad; Mohammad Roghani; Aviad Rubinstein (FOCS, 2023)

Beating Greedy Matching in Sublinear Time. - Soheil Behnezhad; Mohammad Roghani; Aviad Rubinstein; Amin Saberi (SODA, 2023)

Sublinear Time Algorithms and Complexity of Approximate Maximum Matching. - Soheil Behnezhad; Mohammad Roghani; Aviad Rubinstein (STOC, 2023)

Fully Dynamic Matching: (2-√2)-Approximation in Polylog Update Time. - Amir Azarmehr; Soheil Behnezhad; Mohammad Roghani (CoRR, 2023)

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting. - Ruiquan Gao 001; Mohammad Roghani; Aviad Rubinstein; Amin Saberi (FOCS, 2024)

Sublinear Algorithms for TSP via Path Covers. - Soheil Behnezhad; Mohammad Roghani; Aviad Rubinstein; Amin Saberi (ICALP, 2024)

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS. - Amir Azarmehr; Soheil Behnezhad; Mohammad Roghani (ICML, 2024)

Fully Dynamic Matching: -Approximation in Polylog Update Time. - Amir Azarmehr; Soheil Behnezhad; Mohammad Roghani (SODA, 2024)

Approximating Maximum Matching Requires Almost Quadratic Time. - Soheil Behnezhad; Mohammad Roghani; Aviad Rubinstein (STOC, 2024)

Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. - Tristan Pollner; Mohammad Roghani; Amin Saberi; David Wajc (Math. Oper. Res., 2024)

A 0.51-Approximation of Maximum Matching in Sublinear n^{1.5} Time. - Sepideh Mahabadi; Mohammad Roghani; Jakub Tarnawski (ICALP, 2025)

Stable Matching with Interviews. - Itai Ashlagi; Jiale Chen 003; Mohammad Roghani; Amin Saberi (ITCS, 2025)

Sublinear Metric Steiner Tree via Improved Bounds for Set Cover. - Sepideh Mahabadi; Mohammad Roghani; Jakub Tarnawski; Ali Vakilian (ITCS, 2025)

Complexity of computing the anti-Ramsey numbers for paths. - Saeed Akhoondian Amiri; Alexandru Popa 001; Mohammad Roghani; Golnoosh Shahkarami; Reza Soltani; Hossein Vahidi 001 (Theor. Comput. Sci., 2025)

A 0.51-Approximation of Maximum Matching in Sublinear n1.5 Time. - Sepideh Mahabadi; Mohammad Roghani; Jakub Tarnawski (CoRR, 2025)