Now showing items 1-2 of 2

    • Gaspers, Serge; Liedloff, Mathieu; Stein, Maya; Suchane, Karol (Elsevier, 2015)
      Given a vertex-weighted tree T , the split of an edge e in T is the minimum over the weights of the two trees obtained by removing e from T , where the weight of a tree is the sum of weights of its vertices. Given a set ...
    • Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket (2010)
      Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponential time algorithms to solve NP-hard ...