default search action
Mohammad Roghani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc:
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. Math. Oper. Res. 49(3): 1582-1606 (2024) - [c11]Ruiquan Gao, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting. FOCS 2024: 1294-1331 - [c10]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Sublinear Algorithms for TSP via Path Covers. ICALP 2024: 19:1-19:16 - [c9]Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani:
Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS. ICML 2024 - [c8]Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani:
Fully Dynamic Matching: -Approximation in Polylog Update Time. SODA 2024: 3040-3061 - [c7]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein:
Approximating Maximum Matching Requires Almost Quadratic Time. STOC 2024: 444-454 - [i12]Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani:
Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS. CoRR abs/2406.07630 (2024) - [i11]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein:
Approximating Maximum Matching Requires Almost Quadratic Time. CoRR abs/2406.08595 (2024) - [i10]Ruiquan Gao, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting. CoRR abs/2409.15713 (2024) - 2023
- [c6]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein:
Local Computation Algorithms for Maximum Matching: New Lower Bounds. FOCS 2023: 2322-2335 - [c5]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Beating Greedy Matching in Sublinear Time. SODA 2023: 3900-3945 - [c4]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein:
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching. STOC 2023: 267-280 - [i9]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Sublinear Algorithms for TSP via Path Covers. CoRR abs/2301.05350 (2023) - [i8]Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani:
Fully Dynamic Matching: (2-√2)-Approximation in Polylog Update Time. CoRR abs/2307.08772 (2023) - [i7]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein:
Local Computation Algorithms for Maximum Matching: New Lower Bounds. CoRR abs/2311.09359 (2023) - 2022
- [j1]Saieed Akbari, Hossein Baktash, Amin Behjati, Afshin Behmaram, Mohammad Roghani:
Some Results on Dominating Induced Matchings. Graphs Comb. 38(3): 73 (2022) - [c3]Mohammad Roghani, Amin Saberi, David Wajc:
Beating the Folklore Algorithm for Dynamic Matching. ITCS 2022: 111:1-111:23 - [c2]Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc:
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. EC 2022: 321-322 - [i6]Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc:
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. CoRR abs/2205.08667 (2022) - [i5]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Beating Greedy Matching in Sublinear Time. CoRR abs/2206.13057 (2022) - [i4]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein:
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching. CoRR abs/2211.15843 (2022) - 2021
- [i3]Mohammad Roghani, Amin Saberi, David Wajc:
Beating the Folklore Algorithm for Dynamic Matching. CoRR abs/2106.10321 (2021) - [i2]Yeganeh Alimohammadi, Persi Diaconis, Mohammad Roghani, Amin Saberi:
Sequential importance sampling for estimating expectations over the space of perfect matchings. CoRR abs/2107.00850 (2021) - 2020
- [c1]Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi:
Complexity of Computing the Anti-Ramsey Numbers for Paths. MFCS 2020: 6:1-6:14
2010 – 2019
- 2019
- [i1]Saieed Akbari, Hossein Baktash, Amin Behjati, Afshin Behmaram, Mohammad Roghani:
Some Results on Dominating Induced Matchings. CoRR abs/1912.00511 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint