Research Interests
During my time as an MSc student, PhD student, and postdoc, my research focused on graph theory, graph algorithms, and parameterized complexity.
My MSc thesis, jointly supervised by Tommy R. Jensen and Hajo Broersma, mainly focuses on the Three Color Problem for planar graphs.
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.
Coauthors
I have had the pleasure of collaborating with many different people. Here is a list of my coauthors:
Manu Basavaraju
Rémy Belmonte
Endre Boros
Dirk Briskorn
Hajo Broersma
Steven Chaplick
Jean-François Couturier
Konrad K. Dabrowski
Pål Grønås Drange
Markus Sortland Dregi
Tınaz Ekim
Aysel Erey
Henning Fernau
Jiří Fiala
Fedor V. Fomin
Petr A. Golovach
Pinar Heggernes
Bart M. P. Jansen
Marcin Kamiński
Dieter Kratsch
Stefan Kratsch
Erik Jan van Leeuwen
Benjamin Lévêque
Daniel Lokshtanov
Fredrik Manne
Dániel Marx
Daniel Meister
Martin Milanič
Neeldhara Misra
Jesper Nederlof
Christophe Paul
Daniël Paulusma
Michał Pilipczuk
Gerhard Post
Arash Rafiey
Johan M. M. van Rooij
Reza Saei
Stefan Szeider
Marek Tesař
Dimitrios M. Thilikos
Yngve Villanger
Gerhard J. Woeginger
Collaborations with the above people have resulted in the papers listed here.
Trivia
My Erdős number is 2, my nerd score is 49.