21 citations · 35 across the 5 of their papers we have counts for
6 papers
Parameterized Complexity of Fair Vertex Evaluation Problems
Dušan Knop, Tomáš Masařík, Tomáš Toufar
A prototypical graph problem is centered around a graph-theoretic property for a set of vertices and a solution to it is a set of vertices for which the desired property holds. The…
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…
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…
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…
Quantization of canonical bases and the quantum symplectic double
Dylan G. L. Allegretti
We describe a natural -deformation of Fock and Goncharov's canonical basis for the algebra of regular functions on a cluster variety associated to a quiver of type . We then…
Amalgam width of matroids
Lukas Mach, Tomas Toufar
We introduce a new matroid width parameter based on the operation of matroid amalgamation, which we call amalgam-width. The parameter is linearly related to branch-width on finitel…