Current Ph.D. students:
Adam Dunajski (expected graduation in 2028). Integer programming and algorithmic game theory .
Graduated Ph.D. students:
Xavier Cabezas (2018). Heuristic methods for solving two discrete optimization problems.
Lukas Schäfer (2018). Design of reliable aerospace system architecture.
Minerva Martín del Campo Barraza (2020). Efficient algorithms for solving p-median problems with radius constraints and its application to clustering with feature selection.
Ivona Gjeroska (2022). Solution methods for some variants of the vehicle routing problem.
Paula Fermín Cueto (2025). Exact algorithms for the single airport slot allocation problem.
Malte Billen (2025). Algorithms for electric intercity coach scheduling.
Former Postdoctoral researchers:
Maxence Delorme (2017-2020). Integer Programming for large and complex matching problems.
David Rodríguez Penas (2019-2020). High performance computing for facility location problems.