Martin Koutecký

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 74

Top Topics

Integer Program

Parameterized Complexity

Monadic Datalog

Top Venues

Oper. Res. Lett.

Publications

Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
Parameterized algorithms for block-structured integer programs with large entries. SODA (2024)
Jakub Komárek, Martin Koutecký
Experimental Analysis of LP Scaling Methods Based on Circuit Imbalance Minimization. SEA (2024)
Matthias Köppe, Martin Koutecký, Krzysztof Sornat, Nimrod Talmon
Fine-Grained Liquid Democracy for Cumulative Ballots. AAMAS (2024)
Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin
Tight Lower Bounds for Block-Structured Integer Programs. CoRR (2024)
Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin
Tight Lower Bounds for Block-Structured Integer Programs. IPCO (2024)
Rica Gonen, Martin Koutecký, Roei Menashof, Nimrod Talmon
Heuristics for Opinion Diffusion via Local Elections. SOFSEM (2023)
Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
Parameterized algorithms for block-structured integer programs with large entries. CoRR (2023)
Cornelius Brand, Martin Koutecký, Alexandra Lassota
A Polyhedral Perspective on Tropical Convolutions. IWOCA (2023)
Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
Reducibility bounds of objective functions over the integers. Oper. Res. Lett. 51 (6) (2023)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
High-multiplicity N-fold IP via configuration LP. Math. Program. 200 (1) (2023)
Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon
Correction to: Opinion diffusion and campaigning on society graphs. J. Log. Comput. 33 (3) (2023)
Marcin Brianski, Martin Koutecký, Daniel Král', Kristýna Pekárková, Felix Schröder
Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming. ICALP (2022)
Tomas Gavenciak, Martin Koutecký, Dusan Knop
Integer programming in parameterized complexity: Five miniatures. Discret. Optim. 44 (Part) (2022)
Dusan Knop, Martin Koutecký
Scheduling Kernels via Configuration LP. ESA (2022)
Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král, Kristýna Pekárková
Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming. SIAM J. Comput. 51 (3) (2022)
Matthias Köppe, Martin Koutecký, Krzysztof Sornat, Nimrod Talmon
Fine-Grained Liquid Democracy for Cumulative Ballots. CoRR (2022)
Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Approximate separable multichoice optimization over monotone systems. Discret. Optim. 44 (Part) (2022)
Martin Koutecký
. Graphs Comb. 38 (5) (2022)
Marcin Brianski, Martin Koutecký, Daniel Král, Kristýna Pekárková, Felix Schröder
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. CoRR (2022)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
Parameterized complexity of configuration integer programs. Oper. Res. Lett. 49 (6) (2021)
Martin Koutecký, Shmuel Onn
Uniform and monotone line sum optimization. Discret. Appl. Math. 298 (2021)
Cornelius Brand, Martin Koutecký, Sebastian Ordyniak
Parameterized Algorithms for MILPs with Small Treedepth. AAAI (2021)
Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký
A note on the approximability of deepest-descent circuit steps. Oper. Res. Lett. 49 (3) (2021)
Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises. CoRR (2021)
Martin Koutecký, Nimrod Talmon
Multi-Party Campaigning. AAAI (2021)
Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý
Improved Analysis of Online Balanced Clustering. WAOA (2021)
Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý
Improved Analysis of Online Balanced Clustering. CoRR (2021)
Martin Koutecký, Shmuel Onn
Sparse Integer Programming is FPT. Bull. EATCS 134 (2021)
Dusan Knop, Martin Koutecký, Matthias Mnich
Combinatorial n-fold integer programming and applications. Math. Program. 184 (1) (2020)
Martin Koutecký, Nimrod Talmon
Multi-Party Campaigning. CoRR (2020)
Dusan Knop, Martin Koutecký
Scheduling Kernels via Configuration LP. CoRR (2020)
Martin Koutecký, Johannes Zink
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines. CoRR (2020)
Dusan Knop, Martin Koutecký, Matthias Mnich
Voting and Bribing in Single-Exponential Time. ACM Trans. Economics and Comput. 8 (3) (2020)
Martin Koutecký, Shmuel Onn
Uniform and Monotone Line Sum Optimization. CoRR (2020)
Lin Chen, Martin Koutecký, Lei Xu, Weidong Shi
New Bounds on Augmenting Steps of Block-Structured Integer Programs. ESA (2020)
Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král', Kristýna Pekárková
Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming. ICALP (2020)
Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon
Opinion Diffusion and Campaigning on Society Graphs. CoRR (2020)
Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký
A Note on the Approximability of Deepest-Descent Circuit Steps. CoRR (2020)
Martin Koutecký, Johannes Zink
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines. ISAAC (2020)
Petr Kolman, Martin Koutecký, Hans Raj Tiwary
Extension Complexity, MSO Logic, and Treewidth. Discret. Math. Theor. Comput. Sci. 22 (4) (2020)
Katerina Altmanová, Dusan Knop, Martin Koutecký
-fold Integer Programming. ACM J. Exp. Algorithmics 24 (1) (2019)
Martin Koutecký, Daniel Král
A row-invariant parameterized algorithm for integer programming. CoRR (2019)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
Multitype Integer Monoid Optimization and Applications. CoRR (2019)
Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant
Parameterized resiliency problems. Theor. Comput. Sci. 795 (2019)
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
Parameterized shifted combinatorial optimization. J. Comput. Syst. Sci. 99 (2019)
Cornelius Brand, Martin Koutecký, Sebastian Ordyniak
Parameterized Algorithms for MILPs with Small Treedepth. CoRR (2019)
Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Log. Methods Comput. Sci. 15 (4) (2019)
Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
An Algorithmic Theory of Integer Programming. CoRR (2019)
Martin Koutecký, Asaf Levin, Shmuel Onn
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. ICALP (2018)
Dusan Knop, Martin Koutecký, Matthias Mnich
Voting and Bribing in Single-Exponential Time. CoRR (2018)
Tomas Gavenciak, Dusan Knop, Martin Koutecký
Integer Programming in Parameterized Complexity: Three Miniatures. IPEC (2018)
Dusan Knop, Martin Koutecký, Matthias Mnich
A Unifying Framework for Manipulation Problems. CoRR (2018)
Dusan Knop, Martin Koutecký, Matthias Mnich
A Unifying Framework for Manipulation Problems. AAMAS (2018)
Katerina Altmanová, Dusan Knop, Martin Koutecký
Evaluating and Tuning n-fold Integer Programming. CoRR (2018)
Martin Koutecký, Asaf Levin, Shmuel Onn
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. CoRR (2018)
Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon
Opinion Diffusion and Campaigning on Society Graphs. IJCAI (2018)
Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen
Approximating max-cut under graph-MSO constraints. Oper. Res. Lett. 46 (6) (2018)
Katerina Altmanová, Dusan Knop, Martin Koutecký
Evaluating and Tuning n-fold Integer Programming. SEA (2018)
Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
Parameterized complexity of distance labeling and uniform channel assignment problems. Discret. Appl. Math. 248 (2018)
Dusan Knop, Martin Koutecký
Scheduling meets n-fold integer programming. J. Sched. 21 (5) (2018)
Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen
Approximating Max-Cut under Graph-MSO Constraints. CoRR (2018)
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
Parameterized Shifted Combinatorial Optimization. CoRR (2017)
Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Approximate Shifted Combinatorial Optimization. CoRR (2017)
Dusan Knop, Martin Koutecký, Matthias Mnich
Voting and Bribing in Single-Exponential Time. STACS (2017)
Tomas Gavenciak, Dusan Knop, Martin Koutecký
Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity. CoRR (2017)
Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. WG (2017)
Dusan Knop, Martin Koutecký, Matthias Mnich
Combinatorial n-fold Integer Programming and Applications. CoRR (2017)
Dusan Knop, Martin Koutecký, Matthias Mnich
Combinatorial n-fold Integer Programming and Applications. ESA (2017)
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
Parameterized Shifted Combinatorial Optimization. COCOON (2017)
Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant
Parameterized Resiliency Problems via Integer Linear Programming. CIAC (2017)
Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. CoRR (2017)
Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). COCOON (2016)
Petr Kolman, Martin Koutecký, Hans Raj Tiwary
Extension Complexity, MSO Logic, and Treewidth . SWAT (2016)
Dusan Knop, Martin Koutecký
Scheduling meets n-fold Integer Programming. CoRR (2016)
Petr Kolman, Martin Koutecký
Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth. CoRR (2015)
Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
Distance constrained labeling on graphs with bounded neighborhood diversity. CoRR (2015)
Petr Kolman, Martin Koutecký
Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth. Electron. J. Comb. 22 (4) (2015)
Petr Kolman, Martin Koutecký, Hans Raj Tiwary
Extension Complexity, MSO Logic, and Treewidth. CoRR (2015)