2 citations · 2 across the 4 of their papers we have counts for
3 papers · 1 filter
Integer Programming and Incidence Treedepth
Eduard Eiben, Robert Ganian, Dušan Knop +3
Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matri…
Recognizing Proper Tree-Graphs
Steven Chaplick, Petr A. Golovach, Tim A. Hartmann +1
We investigate the parameterized complexity of the recognition problem for the proper -graphs. The -graphs are the intersection graphs of connected subgraphs of a subdivision…
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…