21 citations · 35 across the 5 of their papers we have counts for
Showing 2017Show 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.CC2017★ 21 cited
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
Dušan Knop, Martin Koutecký, Tomáš Masařík +1
This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidt…