Interested in computational complexity theory with an emphasis on fixed-parameter-tractability (fpt) and approximation algorithms.

My supervisors are Vangelis Th. Paschos and Michael Lampis.

Before coming to Paris, I was in Utrecht and in Patras before that.

Keywords: computational complexity theory, parameterized complexity, fpt, approximation, graph theory, treewidth.

Here's a link to DBLP.