| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Computing Smallest Convex Intersecting Polygons | Antoniadis, Antonios et al. | 2022 |
| 2 | On the Approximability of the Traveling Salesman Problem with Line Neighborhoods | Antoniadis, Antonios et al. | 2022 |
| 3 | Clique-Based Separators for Geometric Intersection Graphs | de Berg, Mark et al. | 2021 |
| 4 | A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSP | Kisfaludi-Bak, Sándor | 2020 |
| 5 | Euclidean TSP in Narrow Strips | Alkema, Henk et al. | 2020 |
| 6 | How Does Object Fatness Impact the Complexity of Packing in d Dimensions? | Kisfaludi-Bak, Sándor et al. | 2019 |
| 7 | On Geometric Set Cover for Orthants | Bringmann, Karl et al. | 2019 |
| 8 | On One-Round Discrete Voronoi Games | de Berg, Mark et al. | 2019 |
| 9 | The Dominating Set Problem in Geometric Intersection Graphs | de Berg, Mark et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |