Mohammad Roghani

40 papers A* 13A 3B 1Journal 22Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	A Simple Analysis of Ranking in General Graphs. SOSA Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu
2026	A*	`conf`	Improved Approximation for Ranking on General Graphs. SODA Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu
2026	A*	`conf`	Sublinear Metric Steiner Forest via Maximal Independent Set. SODA Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
2025	J	`jnl`	A 0.51-Approximation of Maximum Matching in Sublinear n CoRR Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski
2025	A*	`conf`	A 0.51-Approximation of Maximum Matching in Sublinear n^{1.5} Time. ICALP Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski
2025	J	`jnl`	A Simple Analysis of Ranking in General Graphs. CoRR Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu
2025	J	`jnl`	Complexity of computing the anti-Ramsey numbers for paths. Theor. Comput. Sci. Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi
2025	J	`jnl`	Improved Approximation for Ranking on General Graphs. CoRR Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu
2025	A	`conf`	Stable Matching with Interviews. ITCS Itai Ashlagi, Jiale Chen, Mohammad Roghani, Amin Saberi
2025	J	`jnl`	Stable Matching with Interviews. CoRR Itai Ashlagi, Jiale Chen, Mohammad Roghani, Amin Saberi
2025	J	`jnl`	Sublinear Metric Steiner Forest via Maximal Independent Set. CoRR Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
2025	A	`conf`	Sublinear Metric Steiner Tree via Improved Bounds for Set Cover. ITCS Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
2025	A*	`conf`	Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance. FOCS Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2025	J	`jnl`	Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance. CoRR Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2024	A*	`conf`	Approximating Maximum Matching Requires Almost Quadratic Time. STOC Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2024	J	`jnl`	Approximating Maximum Matching Requires Almost Quadratic Time. CoRR Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2024	A*	`conf`	Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS. ICML Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani
2024	J	`jnl`	Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS. CoRR Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani
2024	A*	`conf`	Fully Dynamic Matching: -Approximation in Polylog Update Time. SODA Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani
2024	A*	`conf`	Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting. FOCS Ruiquan Gao, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
2024	J	`jnl`	Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting. CoRR Ruiquan Gao, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
2024	J	`jnl`	Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. Math. Oper. Res. Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc
2024	A*	`conf`	Sublinear Algorithms for TSP via Path Covers. ICALP Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
2024	J	`jnl`	Sublinear Metric Steiner Tree via Improved Bounds for Set Cover. CoRR Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
2023	A*	`conf`	Beating Greedy Matching in Sublinear Time. SODA Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
2023	J	`jnl`	Fully Dynamic Matching: (2-√2)-Approximation in Polylog Update Time. CoRR Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani
2023	A*	`conf`	Local Computation Algorithms for Maximum Matching: New Lower Bounds. FOCS Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2023	J	`jnl`	Local Computation Algorithms for Maximum Matching: New Lower Bounds. CoRR Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2023	J	`jnl`	Sublinear Algorithms for TSP via Path Covers. CoRR Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
2023	A*	`conf`	Sublinear Time Algorithms and Complexity of Approximate Maximum Matching. STOC Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2022	J	`jnl`	Beating Greedy Matching in Sublinear Time. CoRR Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
2022	A	`conf`	Beating the Folklore Algorithm for Dynamic Matching. ITCS Mohammad Roghani, Amin Saberi, David Wajc
2022	A*	`conf`	Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. EC Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc
2022	J	`jnl`	Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. CoRR Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc
2022	J	`jnl`	Some Results on Dominating Induced Matchings. Graphs Comb. Saieed Akbari, Hossein Baktash, Amin Behjati, Afshin Behmaram, Mohammad Roghani
2022	J	`jnl`	Sublinear Time Algorithms and Complexity of Approximate Maximum Matching. CoRR Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2021	J	`jnl`	Beating the Folklore Algorithm for Dynamic Matching. CoRR Mohammad Roghani, Amin Saberi, David Wajc
2021	J	`jnl`	Sequential importance sampling for estimating expectations over the space of perfect matchings. CoRR Yeganeh Alimohammadi, Persi Diaconis, Mohammad Roghani, Amin Saberi
2020	B	`conf`	Complexity of Computing the Anti-Ramsey Numbers for Paths. MFCS Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi
2019	J	`jnl`	Some Results on Dominating Induced Matchings. CoRR Saieed Akbari, Hossein Baktash, Amin Behjati, Afshin Behmaram, Mohammad Roghani