default search action
Ramin Mousavi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants. Algorithmica 86(8): 2557-2574 (2024) - 2023
- [c7]Zachary Friggstad, Ramin Mousavi:
A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs. APPROX/RANDOM 2023: 13:1-13:18 - [c6]Zachary Friggstad, Ramin Mousavi:
An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs. ICALP 2023: 63:1-63:14 - [c5]Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. WADS 2023: 93-105 - [i4]Zachary Friggstad, Ramin Mousavi:
An $O(\log k)$-Approximation for Directed Steiner Tree in Planar Graphs. CoRR abs/2302.04747 (2023) - 2022
- [c4]Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
Parameterized Approximation Algorithms for K-center Clustering and Variants. AAAI 2022: 3895-3903 - [c3]Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands. IPCO 2022: 251-261 - [c2]Zachary Friggstad, Ramin Mousavi:
Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP. ISAAC 2022: 8:1-8:17 - 2021
- [c1]Zachary Friggstad, Ramin Mousavi:
Fair Correlation Clustering with Global and Local Guarantees. WADS 2021: 414-427 - [i3]Zachary Friggstad, Ramin Mousavi:
A Constant-Factor Approximation for Quasi-bipartite Directed Steiner Tree on Minor-Free Graphs. CoRR abs/2111.02572 (2021) - [i2]Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Improved Approximations for CVRP with Unsplittable Demands. CoRR abs/2111.08138 (2021) - [i1]Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
Parameterized Approximation Algorithms for k-Center Clustering and Variants. CoRR abs/2112.10195 (2021)
2010 – 2019
- 2019
- [j1]Ramin Mousavi:
Thin trees in 8-edge-connected planar graphs. Inf. Process. Lett. 143: 51-55 (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-07-31 20:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: