Pavel Dvořák

activity

20152023

most citedParameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices

9 citations · 14 across the 11 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

cs.DS2016★ 2 cited

Anti-Path Cover on Sparse Graph Classes

Pavel Dvořák, Dušan Knop, Tomáš Masařík

We show that it is possible to use Bondy-Chvatal closure to design an FPT algorithm that decides whether or not it is possible to cover vertices of an input graph by at most k vert…

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…

cs.DM2016

Automorphisms of the Cube $n^{d}$

Pavel Dvořák, Tomáš Valla

Consider a hypergraph $H_{n}^{d}$ where the vertices are points of the $d$ -dimensional combinatorial cube $n^{d}$ and the edges are all sets of $n$ points such that they are in one line.…

Anti-Path Cover on Sparse Graph Classes

Target Set Selection in Dense Graph Classes

Automorphisms of the Cube nd

Automorphisms of the Cube $n^{d}$