Martin Koutecký

According to our database1, Martin Koutecký authored at least 31 papers between 2015 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Voting and Bribing in Single-Exponential Time.
ACM Trans. Economics and Comput., 2020

Combinatorial n-fold integer programming and applications.
Math. Program., 2020

Extension Complexity, MSO Logic, and Treewidth.
Discret. Math. Theor. Comput. Sci., 2020

A Note on the Approximability of Deepest-Descent Circuit Steps.
CoRR, 2020

Multi-Party Campaigning.
CoRR, 2020

Scheduling Kernels via Configuration LP.
CoRR, 2020

Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

New Bounds on Augmenting Steps of Block-Structured Integer Programs.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Parameterized resiliency problems.
Theor. Comput. Sci., 2019

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.
Log. Methods Comput. Sci., 2019

Evaluating and Tuning <i>n</i>-fold Integer Programming.
ACM J. Exp. Algorithmics, 2019

Parameterized shifted combinatorial optimization.
J. Comput. Syst. Sci., 2019

Parameterized Algorithms for MILPs with Small Treedepth.
CoRR, 2019

Multitype Integer Monoid Optimization and Applications.
CoRR, 2019

A row-invariant parameterized algorithm for integer programming.
CoRR, 2019

An Algorithmic Theory of Integer Programming.
CoRR, 2019

Scheduling meets n-fold integer programming.
J. Sched., 2018

Approximating max-cut under graph-MSO constraints.
Oper. Res. Lett., 2018

Parameterized complexity of distance labeling and uniform channel assignment problems.
Discret. Appl. Math., 2018

Evaluating and Tuning n-fold Integer Programming.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Integer Programming in Parameterized Complexity: Three Miniatures.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Opinion Diffusion and Campaigning on Society Graphs.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

A Unifying Framework for Manipulation Problems.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

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

Approximate Shifted Combinatorial Optimization.
CoRR, 2017

Parameterized Resiliency Problems via Integer Linear Programming.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract).
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Distance constrained labeling on graphs with bounded neighborhood diversity.
CoRR, 2015

Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth.
Electron. J. Comb., 2015