12 citations · 23 across the 13 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DS2022
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…
cs.DM2022
Efficient attack sequences in m-eternal domination
Václav Blažej, Jan Matyáš Křišťan, Tomáš Valla
We study the m-eternal domination problem from the perspective of the attacker. For many graph classes, the minimum required number of guards to defend eternally is known. By defin…
cs.DS2022
Polynomial Kernels for Tracking Shortest Paths
Václav Blažej, Pratibha Choudhary, Dušan Knop +3
Given an undirected graph , vertices , and an integer , Tracking Shortest Paths requires deciding whether there exists a set of vertices su…