Canadian Traveller Problem with Predictions. - Evripidis Bampis; Bruno Escoffier; Michalis Xefteris (WAOA, 2022)

Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else. - Evripidis Bampis; Bruno Escoffier; Themis Gouleakis; Niklas Hahn 001; Kostas Lakis; Golnoosh Shahkarami; Michalis Xefteris (ESA, 2023)

The Covering Canadian Traveller Problem Revisited. - Niklas Hahn 001; Michalis Xefteris (MFCS, 2023)

Online TSP with Known Locations. - Evripidis Bampis; Bruno Escoffier; Niklas Hahn 001; Michalis Xefteris (WADS, 2023)

Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems. - Evripidis Bampis; Bruno Escoffier; Michalis Xefteris (ICML, 2024)

Efficient Time-Series Clustering through Sparse Gaussian Modeling. - Dimitris Fotakis 001; Panagiotis Patsilinakos; Eleni Psaroudaki; Michalis Xefteris (Algorithms, 2024)

Improved FPT Approximation for Non-metric TSP. - Evripidis Bampis; Bruno Escoffier; Michalis Xefteris (CoRR, 2024)

Online and Approximation Algorithms : Beyond Worst-Case Paradigms. (Algorithmes en ligne et d'approximation : au-delà des paradigmes pire cas). - Michalis Xefteris (2024)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems. - Evripidis Bampis; Bruno Escoffier; Dimitris Fotakis 001; Panagiotis Patsilinakos; Michalis Xefteris (CoRR, 2025)