Now showing items 1-2 of 2

• #### Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves ﻿

(Dagstuhl Publishing, 2009)
The {\sc $k$-Leaf Out-Branching} problem is to find an out-branching, that is a rooted oriented spanning tree, with at least $k$ leaves in a given digraph. The problem has recently received much attention from the viewpoint ...
Conference object
• #### Parameterized complexity of the spanning tree congestion problem ﻿

(Springer, 2012-09)
We study the problem of determining the spanning tree congestion of a graph. We present some sharp contrasts in the parameterized complexity of this problem. First, we show that on apex-minor-free graphs, a general class ...
Journal article