Research Interests
I am a member of the Algorithms Research Group in Bergen. My research interests lie in graph theory. My PhD thesis contained 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. My MSc thesis mainly focused on the Three Color Problem for planar graphs. At the moment, I'm working on the project SCOPE - Exploiting Structure to Cope with Hard Problems, together with Professor Pinar Heggernes, Dr Yngve Villanger and Rémy Belmonte. The main goal of the 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 the following people:
Rémy Belmonte
Endre Boros
Dirk Briskorn
Hajo Broersma
Steven Chaplick
Jean-François Couturier
Tınaz Ekim
Aysel Erey
Jiří Fiala
Fedor Fomin
Pinar Heggernes
Bart Jansen
Marcin Kamiński
Dieter Kratsch
Stefan Kratsch
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
Johan van Rooij
Reza Saei
Stefan Szeider
Marek Tesař
Dimitrios Thilikos
Yngve Villanger
Gerhard Woeginger
These collaborations have resulted in the papers listed here.
Trivia
My Erdős number is 2, and my nerd score is 49.