| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Graph Searching with Predictions | Banerjee, Siddhartha et al. | 2023 |
| 2 | Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems | Abboud, Amir et al. | 2022 |
| 3 | On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting | Cohen-Addad, Vincent et al. | 2021 |
| 4 | Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs | Cohen-Addad, Vincent et al. | 2019 |
| 5 | Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs | Cohen-Addad, Vincent et al. | 2019 |
| 6 | On the Fixed-Parameter Tractability of Capacitated Clustering | Cohen-Addad, Vincent et al. | 2019 |
| 7 | Tight FPT Approximations for k-Median and k-Means | Cohen-Addad, Vincent et al. | 2019 |
| 8 | Diameter and k-Center in Sliding Windows | Cohen-Addad, Vincent et al. | 2016 |
| 9 | Effectiveness of Local Search for Geometric Optimization | Cohen-Addad, Vincent et al. | 2015 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |