| Beating the folklore algorithm for dynamic matching M Roghani, A Saberi, D Wajc 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022 | 31 | 2022 |
| Improved Online Contention Resolution for Matchings and Applications to the Gig Economy T Pollner, M Roghani, A Saberi, D Wajc 23rd ACM Conference on Economics and Computation (EC 22), 2022 | 25 | 2022 |
| Sublinear Time Algorithms and Complexity of Approximate Maximum Matching S Behnezhad, M Roghani, A Rubinstein Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 267-280, 2023 | 18 | 2023 |
| Fully Dynamic Matching:-Approximation in Polylog Update Time A Azarmehr, S Behnezhad, M Roghani Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 13 | 2024 |
| Beating greedy matching in sublinear time S Behnezhad, M Roghani, A Rubinstein, A Saberi Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 10 | 2023 |
| Local Computation Algorithms for Maximum Matching: New Lower Bounds S Behnezhad, M Roghani, A Rubinstein 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 5 | 2023 |
| Sequential importance sampling for estimating expectations over the space of perfect matchings Y Alimohammadi, P Diaconis, M Roghani, A Saberi The Annals of Applied Probability 33 (2), 999-1033, 2023 | 3 | 2023 |
| Sublinear Algorithms for TSP via Path Covers S Behnezhad, M Roghani, A Rubinstein, A Saberi arXiv preprint arXiv:2301.05350, 2023 | 3 | 2023 |
| Approximating Maximum Matching Requires Almost Quadratic Time S Behnezhad, M Roghani, A Rubinstein Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 444-454, 2024 | 2 | 2024 |
| Some Results on Dominating Induced Matchings S Akbari, H Baktash, A Behjati, A Behmaram, M Roghani Graphs and Combinatorics 38 (3), 73, 2022 | 1 | 2022 |
| Complexity of Computing the Anti-Ramsey Numbers for Paths S Akhoondian Amiri, A Popa, M Roghani, G Shahkarami, R Soltani, ... 45th International Symposium on Mathematical Foundations of Computer Science …, 2020 | 1* | 2020 |
| TPS (Task Preparation System): A Tool for Developing Tasks in Programming Contests K MIRJALALI, AK MOHTASHAMI, M ROGHANI, H ZARRABI-ZADEH Olympiads in Informatics 13, 209–215, 2019 | 1 | 2019 |
| Sublinear Metric Steiner Tree via Improved Bounds for Set Cover S Mahabadi, M Roghani, J Tarnawski, A Vakilian arXiv preprint arXiv:2411.09059, 2024 | | 2024 |
| Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting R Gao, M Roghani, A Rubinstein, A Saberi 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024 | | 2024 |
| Fully Dynamic Matching: -Approximation in Polylog Update Time A Azarmehr, S Behnezhad, M Roghani arXiv preprint arXiv:2307.08772, 2023 | | 2023 |
| Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS A Azarmehr, S Behnezhad, M Roghani Forty-first International Conference on Machine Learning, 0 | | |
Soheil BehnezhadStanford UniversityVerified email at stanford.edu
