Ramin Mousavi

Orcid: 0000-0001-6843-6044

According to our database1, Ramin Mousavi authored at least 13 papers between 2019 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
A Constant-Factor Approximation for Directed Latency.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Breaching the 2-Approximation Barrier for Euclidean Capacitated Vehicle Routing.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
A \(\boldsymbol{O}(\textbf{log}\,\boldsymbol{k})\)-Approximation for Directed Steiner Tree in Planar Graphs.
ACM Trans. Algorithms, October, 2025

2024
Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants.
Algorithmica, August, 2024

2023
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs.
Proceedings of the Approximation, 2023

2022
Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Parameterized Approximation Algorithms for K-center Clustering and Variants.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Improved Approximations for CVRP with Unsplittable Demands.
CoRR, 2021

Fair Correlation Clustering with Global and Local Guarantees.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2019
Thin trees in 8-edge-connected planar graphs.
Inf. Process. Lett., 2019


  Loading...