| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time | Eberle, Franziska et al. | 2021 |
| 2 | Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics | Böhm, Martin et al. | 2020 |
| 3 | Online Minimum Cost Matching with Recourse on the Line | Megow, Nicole et al. | 2020 |
| 4 | On the Complexity of Anchored Rectangle Packing | Antoniadis, Antonios et al. | 2019 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 4 |