| No. | Title | Author | Year |
|---|---|---|---|
| 1 | The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet | Boria, Nicolas et al. | 2021 |
| 2 | New Algorithms for Mixed Dominating Set | Dublois, Louis et al. | 2020 |
| 3 | Multistage Matchings | Bampis, Evripidis et al. | 2018 |
| 4 | Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center | Katsikarelis, Ioannis et al. | 2017 |
| 5 | Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse | Fotakis, Dimitris et al. | 2016 |
| 6 | Time-Approximation Trade-offs for Inapproximable Problems | Bonnet, Édouard et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |