Combinatorial n-fold integer programming and applications von Knop, Dušan, Koutecký, Martin, Mnich, Matthias

Volltext

Scheduling meets n-fold integer programming von Knop, Dušan, Koutecký, Martin

Volltext

High-multiplicity N-fold IP via configuration LP von Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

Volltext

Uniform and monotone line sum optimization von Koutecký, Martin, Onn, Shmuel

Volltext

Sparse Integer Programming Is Fixed-Parameter Tractable von Eisenbrand, Friedrich, Hunkenschröder, Christoph, Klein, Kim-Manuel, Koutecký, Martin, Levin, Asaf, Onn, Shmuel

Volltext

Parameterized resiliency problems von Crampton, Jason, Gutin, Gregory, Koutecký, Martin, Watrigant, Rémi

Volltext

Voting and Bribing in Single-Exponential Time von Knop, Dušan, Koutecký, Martin, Mnich, Matthias

Volltext

Integer programming in parameterized complexity: Five miniatures von Gavenčiak, Tomáš, Koutecký, Martin, Knop, Dušan

Volltext

Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming von Chan, Timothy F., Cooper, Jacob W., Koutecký, Martin, Král, Daniel, Pekárková, Kristýna

Volltext

Reducibility bounds of objective functions over the integers von Eisenbrand, Friedrich, Hunkenschröder, Christoph, Klein, Kim-Manuel, Koutecký, Martin, Levin, Asaf, Onn, Shmuel

Volltext

Parameterized complexity of configuration integer programs von Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

Volltext

A note on the approximability of deepest-descent circuit steps von Borgwardt, Steffen, Brand, Cornelius, Feldmann, Andreas Emil, Koutecký, Martin

Volltext

Parameterized complexity of distance labeling and uniform channel assignment problems von Fiala, Jiří, Gavenčiak, Tomáš, Knop, Dušan, Koutecký, Martin, Kratochvíl, Jan

Volltext

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity von Dušan Knop, Martin Koutecký, Tomáš Masařík, Tomáš Toufar

Volltext

Evaluating and Tuning n -fold Integer Programming von Altmanová, Kateřina, Knop, Dušan, Koutecký, Martin

Volltext

Extension Complexity, MSO Logic, and Treewidth von Kolman, Petr, Koutecký, Martin, Tiwary, Hans Raj

Volltext

Approximating max-cut under graph-MSO constraints von Koutecký, Martin, Lee, Jon, Nagarajan, Viswanath, Shen, Xiangkun

Volltext

Approximate separable multichoice optimization over monotone systems von Koutecký, Martin, Levin, Asaf, Meesum, Syed M., Onn, Shmuel

Volltext

Parameterized shifted combinatorial optimization von Gajarský, Jakub, Hliněný, Petr, Koutecký, Martin, Onn, Shmuel

Volltext

Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth von Kolman, Petr, Koutecký, Martin

Volltext