I am a postdoctoral researcher in Computer Science at the University of Bremen as an Alexander von Humboldt Fellow, hosted by Nicole Megow. Prior to that, I was a postdoc at the Athens University of Economics and Business, hosted by Vangelis Markakis. I received my PhD in Computer Science in 2024 from Sorbonne Université, under the supervision of Evripidis Bampis and Bruno Escoffier.

My research focuses on the design and theoretical analysis of online, approximation and learning-augmented algorithms.

Michalis Xefteris

xefteris@uni-bremen.de

University of Bremen
Faculty of Mathematics and Computer Science
Bibliothekstr. 5
28359 Bremen, Germany
Office: MZH 3260

Google Scholar
DBLP

Publications

  1. Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
    with Evripidis Bampis, Bruno Escoffier, Dimitris Fotakis and Panagiotis Patsilinakos
    ICML 2025
  2. Improved FPT Approximation for Non-metric TSP
    with Evripidis Bampis and Bruno Escoffier
    Under Submission
  3. Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems
    with Evripidis Bampis and Bruno Escoffier
    ICML 2024
  4. Efficient Time-Series Clustering through Sparse Gaussian Modeling
    with Dimitris Fotakis, Panagiotis Patsilinakos and Eleni Psaroudaki
    Algorithms 2024
  5. Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else
    with Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis and Golnoosh Shahkarami
    ESA 2023
  6. The Covering Canadian Traveller Problem Revisited
    with Niklas Hahn
    MFCS 2023
  7. Online TSP with Known Locations
    with Evripidis Bampis, Bruno Escoffier and Niklas Hahn
    WADS 2023
  8. Canadian Traveller Problem with Predictions
    with Evripidis Bampis and Bruno Escoffier
    WAOA 2022
Plain Academic