92 citations · 156 across the 18 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013★ 11 cited
On the parameterized complexity of cutting a few vertices from a graph
Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen
We study the parameterized complexity of separating a small set of vertices from a graph by a small vertex-separator. That is, given a graph and integers , , the task is…
cs.DS2012★ 1 cited
Fast Monotone Summation over Disjoint Sets
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
We study the problem of computing an ensemble of multiple sums where the summands in each sum are indexed by subsets of size of an -element ground set. More precisely, the t…