22 citations · 43 across the 9 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017★ 5 cited
Integer Programming in Parameterized Complexity: Three Miniatures
Tomáš Gavenčiak, Dušan Knop, Martin Koutecký
Powerful results from the theory of integer programming have recently led to substantial advances in parameterized complexity. However, our perception is that, except for Lenstra's…
cs.DS2011★ 2 cited
Deciding first order logic properties of matroids
Tomas Gavenciak, Daniel Kral, Sang-il Oum
Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be deci…