| Learning-augmented online TSP on rings, trees, flowers and (almost) everywhere else E Bampis, B Escoffier, T Gouleakis, N Hahn, K Lakis, G Shahkarami, ... arXiv preprint arXiv:2305.02169, 2023 | 7 | 2023 |
| Canadian traveller problem with predictions E Bampis, B Escoffier, M Xefteris International Workshop on Approximation and Online Algorithms, 116-133, 2022 | 6 | 2022 |
| Parsimonious Learning-Augmented Approximations for Dense Instances of -hard Problems E Bampis, B Escoffier, M Xefteris arXiv preprint arXiv:2402.02062, 2024 | 3 | 2024 |
| Online TSP with known locations E Bampis, B Escoffier, N Hahn, M Xefteris Algorithms and Data Structures Symposium, 65-78, 2023 | 3 | 2023 |
| Efficient time-series clustering through sparse gaussian modeling D Fotakis, P Patsilinakos, E Psaroudaki, M Xefteris Algorithms 17 (2), 61, 2024 | 2 | 2024 |
| The covering canadian traveller problem revisited N Hahn, M Xefteris arXiv preprint arXiv:2304.14319, 2023 | 2 | 2023 |
| Improved FPT Approximation for Non-metric TSP E Bampis, B Escoffier, M Xefteris arXiv preprint arXiv:2407.08392, 2024 | 1 | 2024 |
| Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems E Bampis, B Escoffier, D Fotakis, P Patsilinakos, M Xefteris arXiv preprint arXiv:2502.00841, 2025 | | 2025 |
