Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth. - Petr Kolman; Martin Koutecký (Electron. J. Comb., 2015)

Distance constrained labeling on graphs with bounded neighborhood diversity. - Jirí Fiala 001; Tomas Gavenciak; Dusan Knop; Martin Koutecký; Jan Kratochvíl (CoRR, 2015)

Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). - Jirí Fiala 001; Tomas Gavenciak; Dusan Knop; Martin Koutecký; Jan Kratochvíl (COCOON, 2016)

Parameterized Resiliency Problems via Integer Linear Programming. - Jason Crampton; Gregory Z. Gutin; Martin Koutecký; Rémi Watrigant (CIAC, 2017)

Approximate Shifted Combinatorial Optimization. - Martin Koutecký; Asaf Levin; Syed Mohammad Meesum; Shmuel Onn (CoRR, 2017)

Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity. - Tomas Gavenciak; Dusan Knop; Martin Koutecký (CoRR, 2017)

A Unifying Framework for Manipulation Problems. - Dusan Knop; Martin Koutecký; Matthias Mnich (AAMAS, 2018)

A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. - Martin Koutecký; Asaf Levin; Shmuel Onn (ICALP, 2018)

Integer Programming in Parameterized Complexity: Three Miniatures. - Tomas Gavenciak; Dusan Knop; Martin Koutecký (IPEC, 2018)

Evaluating and Tuning n-fold Integer Programming. - Katerina Altmanová; Dusan Knop; Martin Koutecký (SEA, 2018)

Parameterized complexity of distance labeling and uniform channel assignment problems. - Jirí Fiala 001; Tomas Gavenciak; Dusan Knop; Martin Koutecký; Jan Kratochvíl (Discret. Appl. Math., 2018)

Approximating max-cut under graph-MSO constraints. - Martin Koutecký; Jon Lee 001; Viswanath Nagarajan; Xiangkun Shen (Oper. Res. Lett., 2018)

Scheduling meets n-fold integer programming. - Dusan Knop; Martin Koutecký (J. Sched., 2018)

An Algorithmic Theory of Integer Programming. - Friedrich Eisenbrand; Christoph Hunkenschröder; Kim-Manuel Klein; Martin Koutecký; Asaf Levin; Shmuel Onn (CoRR, 2019)

A row-invariant parameterized algorithm for integer programming. - Martin Koutecký; Daniel Král (CoRR, 2019)

Multitype Integer Monoid Optimization and Applications. - Dusan Knop; Martin Koutecký; Asaf Levin; Matthias Mnich; Shmuel Onn (CoRR, 2019)

Parameterized shifted combinatorial optimization. - Jakub Gajarský; Petr Hlinený; Martin Koutecký; Shmuel Onn (J. Comput. Syst. Sci., 2019)

Evaluating and Tuning n-fold Integer Programming. - Katerina Altmanová; Dusan Knop; Martin Koutecký (ACM J. Exp. Algorithmics, 2019)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. - Dusan Knop; Martin Koutecký; Tomás Masarík; Tomás Toufar (Log. Methods Comput. Sci., 2019)

Parameterized resiliency problems. - Jason Crampton; Gregory Z. Gutin; Martin Koutecký; Rémi Watrigant (Theor. Comput. Sci., 2019)

New Bounds on Augmenting Steps of Block-Structured Integer Programs. - Lin Chen 009; Martin Koutecký; Lei Xu 012; Weidong Shi (ESA, 2020)

Extension Complexity, MSO Logic, and Treewidth. - Petr Kolman; Martin Koutecký; Hans Raj Tiwary (Discret. Math. Theor. Comput. Sci., 2020)

Combinatorial n-fold integer programming and applications. - Dusan Knop; Martin Koutecký; Matthias Mnich (Math. Program., 2020)

Voting and Bribing in Single-Exponential Time. - Dusan Knop; Martin Koutecký; Matthias Mnich (ACM Trans. Economics and Comput., 2020)

Parameterized Algorithms for MILPs with Small Treedepth. - Cornelius Brand; Martin Koutecký; Sebastian Ordyniak (AAAI, 2021)

Multi-Party Campaigning. - Martin Koutecký; Nimrod Talmon (AAAI, 2021)

Improved Analysis of Online Balanced Clustering. - Marcin Bienkowski; Martin Böhm 001; Martin Koutecký; Thomas Rothvoß; Jirí Sgall; Pavel Veselý 001 (WAOA, 2021)

Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises. - Cornelius Brand; Martin Koutecký; Alexandra Lassota; Sebastian Ordyniak (CoRR, 2021)

Uniform and monotone line sum optimization. - Martin Koutecký; Shmuel Onn (Discret. Appl. Math., 2021)

Sparse Integer Programming is FPT. - Martin Koutecký; Shmuel Onn (Bull. EATCS, 2021)

A note on the approximability of deepest-descent circuit steps. - Steffen Borgwardt; Cornelius Brand; Andreas Emil Feldmann; Martin Koutecký (Oper. Res. Lett., 2021)

Parameterized complexity of configuration integer programs. - Dusan Knop; Martin Koutecký; Asaf Levin; Matthias Mnich; Shmuel Onn (Oper. Res. Lett., 2021)

Scheduling Kernels via Configuration LP. - Dusan Knop; Martin Koutecký (ESA, 2022)

Integer programming in parameterized complexity: Five miniatures. - Tomas Gavenciak; Martin Koutecký; Dusan Knop (Discret. Optim., 2022)

Approximate separable multichoice optimization over monotone systems. - Martin Koutecký; Asaf Levin; Syed Mohammad Meesum; Shmuel Onn (Discret. Optim., 2022)

A Note on Coloring (4K1, C4, C6)-Free Graphs with a C7. - Martin Koutecký (Graphs Comb., 2022)

Opinion diffusion and campaigning on society graphs. - Piotr Faliszewski; Rica Gonen; Martin Koutecký; Nimrod Talmon (J. Log. Comput., 2022)

Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming. - Timothy F. N. Chan; Jacob W. Cooper; Martin Koutecký; Daniel Král; Kristýna Pekárková (SIAM J. Comput., 2022)

A Polyhedral Perspective on Tropical Convolutions. - Cornelius Brand; Martin Koutecký; Alexandra Lassota (IWOCA, 2023)

Heuristics for Opinion Diffusion via Local Elections. - Rica Gonen; Martin Koutecký; Roei Menashof; Nimrod Talmon (SOFSEM, 2023)

High-multiplicity N-fold IP via configuration LP. - Dusan Knop; Martin Koutecký; Asaf Levin; Matthias Mnich; Shmuel Onn (Math. Program., 2023)

Correction to: Opinion diffusion and campaigning on society graphs. - Piotr Faliszewski; Rica Gonen; Martin Koutecký; Nimrod Talmon (J. Log. Comput., 2023)

Reducibility bounds of objective functions over the integers. - Friedrich Eisenbrand; Christoph Hunkenschröder; Kim-Manuel Klein; Martin Koutecký; Asaf Levin; Shmuel Onn (Oper. Res. Lett., 2023)

Fine-Grained Liquid Democracy for Cumulative Ballots. - Matthias Köppe; Martin Koutecký; Krzysztof Sornat; Nimrod Talmon (AAMAS, 2024)

Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds. - Cornelius Brand; Martin Koutecký; Alexandra Lassota; Sebastian Ordyniak (ESA, 2024)

Tight Lower Bounds for Block-Structured Integer Programs. - Christoph Hunkenschröder; Kim-Manuel Klein; Martin Koutecký; Alexandra Lassota; Asaf Levin (IPCO, 2024)

Experimental Analysis of LP Scaling Methods Based on Circuit Imbalance Minimization. - Jakub Komárek; Martin Koutecký (SEA, 2024)

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. - Marcin Brianski; Martin Koutecký; Daniel Král'; Kristýna Pekárková; Felix Schröder (Math. Program., 2024)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs. - Christoph Hunkenschröder; Martin Koutecký; Asaf Levin; Tung Anh Vu (IPCO, 2025)

Sparse Integer Programming Is Fixed-Parameter Tractable. - Friedrich Eisenbrand; Christoph Hunkenschröder; Kim-Manuel Klein; Martin Koutecký; Asaf Levin; Shmuel Onn (Math. Oper. Res., 2025)

Parameterized algorithms for block-structured integer programs with large entries. - Jana Cslovjecsek; Martin Koutecký; Alexandra Lassota; Michal Pilipczuk; Adam Polak 001 (TheoretiCS, 2025)

Complexity of scheduling few types of jobs on related and unrelated machines. - Martin Koutecký; Johannes Zink 001 (J. Sched., 2025)