4 citations · 10 across the 26 of their papers we have counts for
4 papers · 1 filter
Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
Václav Blažej, Dušan Knop, Jan Pokorný +1
We study the Equitable Connected Partition (ECP for short) problem, where we are given a graph G=(V,E) together with an integer p, and our goal is to find a partition of V into p p…
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations
Václav Blažej, Pratibha Choudhary, Dušan Knop +3
For many problems, the important instances from practice possess certain structure that one should reflect in the design of specific algorithms. As data reduction is an important a…
Balancing the Spread of Two Opinions in Sparse Social Networks
Dušan Knop, Šimon Schierreich, Ondřej Suchý
Inspired by the famous Target Set Selection problem, we propose a new discrete model to simultaneously spread two opinions within a social network and perform an initial study of i…
Waypoint Routing on Bounded Treewidth Graphs
Šimon Schierreich, Ondřej Suchý
In the \textsc{Waypoint Routing Problem} one is given an undirected capacitated and weighted graph , a source-destination pair and a set , of \emp…