Scheduling meets n-fold integer programming D Knop, M Koutecký Journal of Scheduling 21 (5), 493-503, 2018 | 46 | 2018 |
A parameterized strongly polynomial algorithm for block structured integer programs M Koutecký, A Levin, S Onn arXiv preprint arXiv:1802.05859, 2018 | 39 | 2018 |
Combinatorial n-fold integer programming and applications D Knop, M Koutecký, M Mnich Mathematical programming, 1-34, 2019 | 38 | 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 | 37 | 2020 |
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 | 28 | 2019 |
Opinion diffusion and campaigning on society graphs P Faliszewski, R Gonen, M Koutecký, N Talmon arXiv preprint arXiv:2010.00651, 2020 | 26 | 2020 |
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 | 16 | 2017 |
Extended formulation for CSP that is compact for instances of bounded treewidth P Kolman, M Koutecký arXiv preprint arXiv:1502.05361, 2015 | 16 | 2015 |
Evaluating and Tuning n-fold Integer Programming K Altmanová, D Knop, M Koutecký Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019 | 13 | 2019 |
A unifying framework for manipulation problems D Knop, M Koutecký, M Mnich arXiv preprint arXiv:1801.09584, 2018 | 11 | 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 | 8 | 2019 |
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 | 7 | 2018 |
Integer programming in parameterized complexity: three miniatures T Gavenčiak, D Knop, M Koutecký arXiv preprint arXiv:1711.02032, 2017 | 7 | 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 | 7 | 2016 |
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 |
Multitype integer monoid optimization and applications D Knop, M Koutecký, A Levin, M Mnich, S Onn arXiv preprint arXiv:1909.07326, 2019 | 4 | 2019 |
New bounds on augmenting steps of block-structured integer programs L Chen, L Xu, W Shi, M Koutecký arXiv preprint arXiv:1805.03741, 2018 | 4 | 2018 |
Treewidth, Extended Formulations of CSP and MSO Polytopes, and their Algorithmic Applications M Koutecký Univerzita Karlova, Matematicko-fyzikální fakulta, 2017 | 3 | 2017 |