13 citations · 13 across the 1 of their papers we have counts for
7 papers
FPT Algorithms for Diverse Collections of Hitting Sets
Julien Baste, Lars Jaffke, Tomáš Masařík +2
In this work, we study the -Hitting Set and Feedback Vertex Set problems through the paradigm of finding diverse collections of solutions of size at most each, which has…
Flexibility of planar graphs without 4-cycles
Tomáš Masařík
Proper graph coloring assigns different colors to adjacent vertices of the graph. Usually, the number of colors is fixed or as small as possible. Consider applications (e.g. varian…
Flexibility of planar graphs of girth at least six
Zdeněk Dvořák, Tomáš Masařík, Jan Musílek +1
Let G be a planar graph with a list assignment L. Suppose a preferred color is given for some of the vertices. We prove that if G has girth at least six and all lists have size at…
Flexibility of triangle-free planar graphs
Zdeněk Dvořák, Tomáš Masařík, Jan Musílek +1
Let G be a planar graph with a list assignment L. Suppose a preferred color is given for some of the vertices. We prove that if G is triangle-free and all lists have size at least…
On difference graphs and the local dimension of posets
Jinha Kim, Ryan R. Martin, Tomáš Masařík +4
The dimension of a partially-ordered set (poset), introduced by Dushnik and Miller (1941), has been studied extensively in the literature. Recently, Ueckerdt (2016) proposed a vari…
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…