Thin trees in 8-edge-connected planar graphs. - Ramin Mousavi (Inf. Process. Lett., 2019)

Fair Correlation Clustering with Global and Local Guarantees. - Zachary Friggstad; Ramin Mousavi (WADS, 2021)

Improved Approximations for CVRP with Unsplittable Demands. - Zachary Friggstad; Ramin Mousavi; Mirmahdi Rahgoshay; Mohammad R. Salavatipour (CoRR, 2021)

Parameterized Approximation Algorithms for K-center Clustering and Variants. - Sayan Bandyapadhyay; Zachary Friggstad; Ramin Mousavi (AAAI, 2022)

Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands. - Zachary Friggstad; Ramin Mousavi; Mirmahdi Rahgoshay; Mohammad R. Salavatipour (IPCO, 2022)

Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP. - Zachary Friggstad; Ramin Mousavi (ISAAC, 2022)

A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs. - Zachary Friggstad; Ramin Mousavi (APPROX/RANDOM, 2023)

An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs. - Zachary Friggstad; Ramin Mousavi (ICALP, 2023)

A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. - Sayan Bandyapadhyay; Zachary Friggstad; Ramin Mousavi (WADS, 2023)

Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants. - Sayan Bandyapadhyay; Zachary Friggstad; Ramin Mousavi (Algorithmica, 2024)