49 citations · 185 across the 18 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2022
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
Marcin Brianski, Martin Koutecky, Daniel Kral +2
An intensive line of research on fixed parameter tractability of integer programming is focused on exploiting the relation between the sparsity of a constraint matrix and the n…
cs.DM2015★ 3 cited
Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems
Jiří Fiala, Tomáš Gavenčiak, Dušan Knop +2
We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view. The parameters studied are neigh…