| Improved approximations for capacitated vehicle routing with unsplittable client demands Z Friggstad, R Mousavi, M Rahgoshay, MR Salavatipour International Conference on Integer Programming and Combinatorial …, 2022 | 10 | 2022 |
| Fair correlation clustering with global and local guarantees Z Friggstad, R Mousavi Algorithms and Data Structures: 17th International Symposium, WADS 2021 …, 2021 | 10 | 2021 |
| Parameterized approximation algorithms for k-center clustering and variants S Bandyapadhyay, Z Friggstad, R Mousavi Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3895-3903, 2022 | 8 | 2022 |
| Improved approximations for CVRP with unsplittable demands Z Friggstad, R Mousavi, M Rahgoshay, MR Salavatipour arXiv preprint arXiv:2111.08138, 2021 | 6 | 2021 |
| A constant-factor approximation for quasi-bipartite directed steiner tree on minor-free graphs Z Friggstad, R Mousavi arXiv preprint arXiv:2111.02572, 2021 | 3 | 2021 |
| An -Approximation for Directed Steiner Tree in Planar Graphs Z Friggstad, R Mousavi arXiv preprint arXiv:2302.04747, 2023 | 2 | 2023 |
| A Parameterized Approximation Scheme for Generalized Partial Vertex Cover S Bandyapadhyay, Z Friggstad, R Mousavi Algorithms and Data Structures Symposium, 93-105, 2023 | 1 | 2023 |
| Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP Z Friggstad, R Mousavi 33rd International Symposium on Algorithms and Computation (ISAAC 2022), 2022 | 1 | 2022 |
| Thin trees in some families of distance-regular graphs R Mousavi Linear and Multilinear Algebra 68 (7), 1374-1383, 2020 | 1 | 2020 |
| Thin trees in 8-edge-connected planar graphs R Mousavi Information Processing Letters 143, 51-55, 2019 | | 2019 |
