• 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 ...