Scheduling meets *n*-fold integer programmingD Knop, M Koutecký Journal of Scheduling 21 (5), 493-503, 2018 | 40 | 2018 |

A parameterized strongly polynomial algorithm for block structured integer programs M Koutecký, A Levin, S Onn arXiv preprint arXiv:1802.05859, 2018 | 37 | 2018 |

Combinatorial n-fold integer programming and applications D Knop, M Koutecký, M Mnich Mathematical Programming, 1-34, 2019 | 35 | 2019 |

Voting and bribing in single-exponential time D Knop, M Koutecký, M Mnich ACM Transactions on Economics and Computation (TEAC) 8 (3), 1-28, 2020 | 32 | 2020 |

Opinion Diffusion and Campaigning on Society Graphs. P Faliszewski, R Gonen, M Koutecký, N Talmon IJCAI, 219-225, 2018 | 21 | 2018 |

An algorithmic theory of integer programming F Eisenbrand, C Hunkenschröder, KM Klein, M Koutecký, A Levin, S Onn arXiv preprint arXiv:1904.01361, 2019 | 18 | 2019 |

Extended formulation for CSP that is compact for instances of bounded treewidth P Kolman, M Koutecký arXiv preprint arXiv:1502.05361, 2015 | 13 | 2015 |

Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity D Knop, M Koutecký, T Masařík, T Toufar International Workshop on Graph-Theoretic Concepts in Computer Science, 344-357, 2017 | 12 | 2017 |

Evaluating and Tuning *n*-fold Integer ProgrammingK Altmanová, D Knop, M Koutecký Journal of Experimental Algorithmics (JEA) 24 (1), 1-22, 2019 | 11 | 2019 |

A unifying framework for manipulation problems D Knop, M Koutecký, M Mnich arXiv preprint arXiv:1801.09584, 2018 | 10 | 2018 |

Extension complexity, MSO logic, and treewidth P Kolman, M Koutecký, HR Tiwary arXiv preprint arXiv:1507.04907, 2015 | 9 | 2015 |

Parameterized shifted combinatorial optimization J Gajarský, P Hliněný, M Koutecký, S Onn Journal of Computer and System Sciences 99, 53-71, 2019 | 7 | 2019 |

Integer programming in parameterized complexity: three miniatures T Gavenčiak, D Knop, M Koutecký arXiv preprint arXiv:1711.02032, 2017 | 7 | 2017 |

Parameterized complexity of distance labeling and uniform channel assignment problems J Fiala, T Gavenčiak, D Knop, M Koutecký, J Kratochvíl Discrete Applied Mathematics 248, 46-55, 2018 | 6 | 2018 |

Parameterized resiliency problems via integer linear programming J Crampton, G Gutin, M Koutecký, R Watrigant International Conference on Algorithms and Complexity, 164-176, 2017 | 6 | 2017 |

Parameterized resiliency problems via integer linear programming J Crampton, G Gutin, M Koutecký, R Watrigant International Conference on Algorithms and Complexity, 164-176, 2017 | 6 | 2017 |

Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems J Fiala, T Gavenčiak, D Knop, M Koutecký, J Kratochvíl International Computing and Combinatorics Conference, 67-78, 2016 | 6 | 2016 |

Approximate shifted combinatorial optimization M Koutecky, A Levin, SM Meesum, S Onn arXiv preprint arXiv:1706.02075, 2017 | 3 | 2017 |

Solving hard problems on neighborhood diversity M Koutecký Charles University in Prague, 2013 | 3 | 2013 |

Parameterized resiliency problems J Crampton, G Gutin, M Koutecký, R Watrigant Theoretical Computer Science 795, 478-491, 2019 | 2 | 2019 |