Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Ramin Mousavi
Observed name:
Mousavi, Ramin
Institutions:
University of Applied Sciences and Arts of Southern Switzerland,
Dalle Molle Institute for Artificial Intelligence Research,
Università della Svizzera italiana
Observed institutions:
University of Applied Sciences and Arts of Southern Switzerland,
University of Alberta,
Dalle Molle Institute for Artificial Intelligence Research,
Università della Svizzera italiana
ORCID:
0000-0001-6843-6044
Observed ORCID:
0000-0001-6843-6044
OpenAlex ID:
A5044624091
Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands
2022
·
Zachary Friggstad
, Ramin Mousavi
, et al.
·
Lecture notes in computer science
·
23
Fair Correlation Clustering with Global and Local Guarantees
2021
·
Zachary Friggstad
, Ramin Mousavi
·
Lecture notes in computer science
·
18
Improved Approximations for a CVRP with Unsplittable Demands
2025
·
Zachary Friggstad
, Ramin Mousavi
, et al.
·
Mathematics of Operations Research
·
12
PDF
Parameterized Approximation Algorithms for K-center Clustering and Variants
2022
·
Sayan Bandyapadhyay
, Zachary Friggstad
, et al.
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
8
Breaching the 2-Approximation Barrier for Euclidean Capacitated Vehicle Routing
2026
·
Zachary Friggstad
, Fabrizio Grandoni
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
5
Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants
2024
·
Sayan Bandyapadhyay
, Zachary Friggstad
, et al.
·
Algorithmica
·
5
An $O(\log k)$-Approximation for Directed Steiner Tree in Planar Graphs
2023
·
Friggstad, Zachary
, Mousavi, Ramin
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
5
PDF
A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs
2021
·
Friggstad, Zachary
, Mousavi, Ramin
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
4
PDF
A \(\boldsymbol{O}(\textbf{log}\,\boldsymbol{k})\) -Approximation for Directed Steiner Tree in Planar Graphs
2025
·
Zachary Friggstad
, Ramin Mousavi
·
ACM Transactions on Algorithms
·
3
PDF
A Constant-Factor Approximation for Directed Latency
2026
·
Jannis Blauth
, Ramin Mousavi
·
ACM Symposium on Theory of Computing (STOC)
·
1
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover
2023
·
Sayan Bandyapadhyay
, Zachary Friggstad
, et al.
·
Lecture notes in computer science
·
1
Thin trees in 8-edge-connected planar graphs
2018
·
Ramin Mousavi
·
Information Processing Letters
·
1
Thin trees in some families of distance-regular graphs
2018
·
Ramin Mousavi
·
Linear and Multilinear Algebra
·
1
Show more works
View as search
Works count:
15
Citation count:
89
H-index:
5
I10-index:
3
Year
Topic
Type