49 citations · 185 across the 18 of their papers we have counts for
5 papers · 1 filter
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…
Approximate Shifted Combinatorial Optimization
Martin Koutecky, Asaf Levin, Syed M. Meesum +1
Shifted combinatorial optimization is a new nonlinear optimization framework, which is a broad extension of standard combinatorial optimization, involving the choice of several fea…
Combinatorial n-fold Integer Programming and Applications
Dušan Knop, Martin Koutecký, Matthias Mnich
Many fundamental NP-hard problems can be formulated as integer linear programs (ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the dimension o…
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
Dušan Knop, Martin Koutecký, Tomáš Masařík +1
This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidt…
Parameterized Shifted Combinatorial Optimization
Jakub Gajarský, Petr Hliněný, Martin Koutecký +1
Shifted combinatorial optimization is a new nonlinear optimization framework which is a broad extension of standard combinatorial optimization, involving the choice of several feas…