## Ioannis Katsikarelis

PhD candidate at LAMSADE (CNRS UMR 7243), Université Paris-Dauphine.

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.

For the course on **Automata and Languages**, here's the sixth homework (deadlines are on Friday before class) and here's the next set of exercises.

For something else entirely, feel free to click here.