Browsing Bergen Open Research Archive by Author "Sloper, Christian"

Now showing items 1-4 of 4

    • Finding k Disjoint Triangles in an Arbitrary Graph 

      Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne (Journal article; Peer reviewed, 2004)
      We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H=K 3 (the triangle) we give an O(22klog k + 1.869k n 2) algorithm, and for general ...

    • Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time 

      Lokshtanov, Daniel; Sloper, Christian (Chapter, 2005)

    • Looking at the Stars 

      Prieto, Elena; Sloper, Christian (Journal article, 2006-02-28)
      The problem of packing k vertex-disjoint copies of a graph H into another graph G is NP-complete if H has more than two vertices in some connected component. In the framework of parameterized complexity we analyze a ...

    • Techniques in parameterized algorithm design 

      Sloper, Christian (Doctoral thesis, 2006-03-06)
      In this thesis we give a novel classification of techniques for designing parameterized algorithms, together with research publications applying these techniques, in particular Crown Decompositions, to various problems. ...