49 citations · 118 across the 24 of their papers we have counts for
4 papers · 1 filter
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…
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…
Graph Isomorphism Restricted by Lists
Pavel Klavik, Dušan Knop, Peter Zeman
The complexity of graph isomorphism (GraphIso) is a famous unresolved problem in theoretical computer science. For graphs and , it asks whether they are the same up to a rel…
Scheduling meets n-fold Integer Programming
Dušan Knop, Martin Koutecký
Scheduling problems are fundamental in combinatorial optimization. Much work has been done on approximation algorithms for NP-hard cases, but relatively little is known about exact…