• A 43k Kernel for Planar Dominating Set using Computer-Aided Reduction Rule Discovery 

      Halseth, Johan Torås (Master thesis, 2016-02-15)
      In this thesis we explore the technique of Region Decomposition for finding kernels for Planar Dominating Set. We redefine some concepts used in earlier work, fixing some ambiguities on the way. From those concepts we end ...
    • Independent Set on P5-free graphs, an empirical study 

      Haug, Håvard Karim (Master thesis, 2015-11-20)
      We implement the recent polynomial time algorithm for the independent set problem on P5-free graphs, and study the performance of this algorithm on graphs of size up to 50. Our empirical results show that the algorithm is ...