Martin Koutecký

According to our database, Martin Koutecký authored at least 50 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

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., November, 2024

Experimental Analysis of LP Scaling Methods Based on Circuit Imbalance Minimization.

Jakub Komárek, Martin Koutecký

Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

Parameterized algorithms for block-structured integer programs with large entries.

Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Tight Lower Bounds for Block-Structured Integer Programs.

Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds.

Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Fine-Grained Liquid Democracy for Cumulative Ballots.

Matthias Köppe, Martin Koutecký, Krzysztof Sornat, Nimrod Talmon

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

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., November, 2023

Correction to: Opinion diffusion and campaigning on society graphs.

Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon

J. Log. Comput., April, 2023

High-multiplicity N-fold IP via configuration LP.

Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn

Math. Program., 2023

Heuristics for Opinion Diffusion via Local Elections.

Rica Gonen, Martin Koutecký, Roei Menashof, Nimrod Talmon

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

A Polyhedral Perspective on Tropical Convolutions.

Cornelius Brand, Martin Koutecký, Alexandra Lassota

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

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

Opinion diffusion and campaigning on society graphs.

Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon

J. Log. Comput., 2022

A Note on Coloring (4K_1, C_4, C₆₎-Free Graphs with a C₇.

Martin Koutecký

Graphs Comb., 2022

Approximate separable multichoice optimization over monotone systems.

Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn

Discret. Optim., 2022

Integer programming in parameterized complexity: Five miniatures.

Tomas Gavenciak, Martin Koutecký, Dusan Knop

Discret. Optim., 2022

Scheduling Kernels via Configuration LP.

Dusan Knop, Martin Koutecký

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Parameterized complexity of configuration integer programs.

Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn

Oper. Res. Lett., 2021

A note on the approximability of deepest-descent circuit steps.

Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký

Oper. Res. Lett., 2021

Sparse Integer Programming is FPT.

Martin Koutecký, Shmuel Onn

Bull. EATCS, 2021

Uniform and monotone line sum optimization.

Martin Koutecký, Shmuel Onn

Discret. Appl. Math., 2021

Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises.

Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak

CoRR, 2021

Improved Analysis of Online Balanced Clustering.

Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

Multi-Party Campaigning.

Martin Koutecký, Nimrod Talmon

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Parameterized Algorithms for MILPs with Small Treedepth.

Cornelius Brand, Martin Koutecký, Sebastian Ordyniak

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Voting and Bribing in Single-Exponential Time.

Dusan Knop, Martin Koutecký, Matthias Mnich

ACM Trans. Economics and Comput., 2020

Combinatorial n-fold integer programming and applications.

Dusan Knop, Martin Koutecký, Matthias Mnich

Math. Program., 2020

Extension Complexity, MSO Logic, and Treewidth.

Petr Kolman, Martin Koutecký, Hans Raj Tiwary

Discret. Math. Theor. Comput. Sci., 2020

Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines.

Martin Koutecký, Johannes Zink

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

New Bounds on Augmenting Steps of Block-Structured Integer Programs.

Lin Chen, Martin Koutecký, Lei Xu, Weidong Shi

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Parameterized resiliency problems.

Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant

Theor. Comput. Sci., 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

Evaluating and Tuning <i>n</i>-fold Integer Programming.

Katerina Altmanová, Dusan Knop, Martin Koutecký

ACM J. Exp. Algorithmics, 2019

Parameterized shifted combinatorial optimization.

Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn

J. Comput. Syst. Sci., 2019

Multitype Integer Monoid Optimization and Applications.

Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn

CoRR, 2019

A row-invariant parameterized algorithm for integer programming.

Martin Koutecký, Daniel Král

CoRR, 2019

An Algorithmic Theory of Integer Programming.

Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn

CoRR, 2019

2018

Scheduling meets n-fold integer programming.

Dusan Knop, Martin Koutecký

J. Sched., 2018

Approximating max-cut under graph-MSO constraints.

Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen

Oper. Res. Lett., 2018

Parameterized complexity of distance labeling and uniform channel assignment problems.

Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl

Discret. Appl. Math., 2018

Evaluating and Tuning n-fold Integer Programming.

Katerina Altmanová, Dusan Knop, Martin Koutecký

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Integer Programming in Parameterized Complexity: Three Miniatures.

Tomas Gavenciak, Dusan Knop, Martin Koutecký

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs.

Martin Koutecký, Asaf Levin, Shmuel Onn

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

A Unifying Framework for Manipulation Problems.

Dusan Knop, Martin Koutecký, Matthias Mnich

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity.

Tomas Gavenciak, Dusan Knop, Martin Koutecký

CoRR, 2017

Approximate Shifted Combinatorial Optimization.

Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn

CoRR, 2017

Parameterized Resiliency Problems via Integer Linear Programming.

Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract).

Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Distance constrained labeling on graphs with bounded neighborhood diversity.

Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl

CoRR, 2015

Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth.

Petr Kolman, Martin Koutecký

Electron. J. Comb., 2015