Skip to content

Mohammad Roghani

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

13

Venues

6

Active years

2020–2026

Best venue rank

A*

Where they publish

Papers

13 indexed papers, newest first.

YearVenueTitleAuthors
2026SODAImproved Approximation for Ranking on General Graphs.Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu
2026SODASublinear Metric Steiner Forest via Maximal Independent Set.Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
2025FOCSTight Pair Query Lower Bounds for Matching and Earth Mover's Distance.Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2025ICALPA 0.51-Approximation of Maximum Matching in Sublinear n^{1.5} Time.Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski
2024FOCSHardness of Approximate Sperner and Applications to Envy-Free Cake Cutting.Ruiquan Gao, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
2024ICALPSublinear Algorithms for TSP via Path Covers.Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
2024ICMLBipartite Matching in Massive Graphs: A Tight Analysis of EDCS.Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani
2024SODAFully Dynamic Matching: -Approximation in Polylog Update Time.Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani
2024STOCApproximating Maximum Matching Requires Almost Quadratic Time.Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2023FOCSLocal Computation Algorithms for Maximum Matching: New Lower Bounds.Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2023SODABeating Greedy Matching in Sublinear Time.Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
2023STOCSublinear Time Algorithms and Complexity of Approximate Maximum Matching.Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2020MFCSComplexity of Computing the Anti-Ramsey Numbers for Paths.Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi