During my time as an MSc student, PhD student, and postdoc, my research focused on graph theory, graph algorithms, and parameterized complexity.
My PhD thesis, supervised by Daniël Paulusma and Hajo Broersma, contains several polynomial and exponential time exact algorithms for (restricted versions of) NP-hard problems, dealing with partitioning the vertices of or finding certain types of paths and cycles in graphs.
As a postdoc in Bergen, I worked on the project SCOPE - Exploiting Structure to Cope with Hard Problems, under the supervision of Professor Pinar Heggernes and together with Dr Yngve Villanger and Rémy Belmonte. The main goal of this project is to identify graph classes on which NP-hard problems become fixed-parameter tractable or can be solved in polynomial time.
I have had the pleasure of collaborating with many different people. Here is a list of my coauthors:
Konrad K. Dabrowski
Pål Grønås Drange
Markus Sortland Dregi
Fedor V. Fomin
Petr A. Golovach
Bart M. P. Jansen
Erik Jan van Leeuwen
Johan M. M. van Rooij
Dimitrios M. Thilikos
Gerhard J. Woeginger
Collaborations with the above people have resulted in the papers listed here.