Interested in complexity theory with an emphasis on fixed-parameter-tractability (fpt) and approximation algorithms.
Before coming to Paris, I finished the Master's program 'Computing Science' at Utrecht University (supervisors: Hans L. Bodlaender and Jesper Nederlof) and before that, I got a computer engineering diploma from the Computer Engineering and Informatics Department of the University of Patras (supervisor: Ioannis Caragiannis).
Keywords: computational complexity theory, parameterized complexity, fpt, approximation, graph theory.
My CV is available here.
For something else entirely, feel free to click here.