21 citations · 35 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017★ 9 cited
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
Pavel Dvořák, Andreas Emil Feldmann, Dušan Knop +3
We study the Steiner Tree problem, in which a set of terminal vertices needs to be connected in the cheapest possible way in an edge-weighted graph. This problem has been extensive…
cs.DS2016
Target Set Selection in Dense Graph Classes
Pavel Dvořák, Dušan Knop, Tomáš Toufar
In this paper, we study the Target Set Selection problem from a parameterized complexity perspective. Here for a given graph and a threshold for each vertex, the task is to find a…