| 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 | 95 | 2019 |
| Scheduling meets n-fold integer programming D Knop, M Koutecký Journal of Scheduling 21, 493-503, 2018 | 95 | 2018 |
| Combinatorial n-fold integer programming and applications D Knop, M Koutecký, M Mnich Mathematical Programming 184 (1), 1-34, 2020 | 83 | 2020 |
| A parameterized strongly polynomial algorithm for block structured integer programs M Koutecký, A Levin, S Onn arXiv preprint arXiv:1802.05859, 2018 | 83 | 2018 |
| Opinion diffusion and campaigning on society graphs P Faliszewski, R Gonen, M Koutecký, N Talmon Journal of Logic and Computation 32 (6), 1162-1194, 2022 | 66 | 2022 |
| 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 | 63 | 2020 |
| Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity D Knop, M Koutecký, T Masařík, T Toufar Logical Methods in Computer Science 15, 2019 | 48 | 2019 |
| Integer programming in parameterized complexity: Five miniatures T Gavenčiak, M Koutecký, D Knop Discrete Optimization 44, 100596, 2022 | 35* | 2022 |
| Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming TF Chan, JW Cooper, M Koutecky, D Král, K Pekarkova SIAM Journal on Computing 51 (3), 664-700, 2022 | 23 | 2022 |
| Evaluating and Tuning n-fold Integer Programming K Altmanová, D Knop, M Koutecký Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019 | 22 | 2019 |
| Extension complexity, MSO logic, and treewidth P Kolman, M Koutecký, HR Tiwary Discrete Mathematics & Theoretical Computer Science 22 (Discrete Algorithms), 2020 | 21* | 2020 |
| 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 | 20* | 2018 |
| A unifying framework for manipulation problems D Knop, M Koutecký, M Mnich arXiv preprint arXiv:1801.09584, 2018 | 18 | 2018 |
| Extended formulation for CSP that is compact for instances of bounded treewidth P Kolman, M Koutecký arXiv preprint arXiv:1502.05361, 2015 | 17 | 2015 |
| Parameterized algorithms for MILPs with small treedepth C Brand, M Koutecký, S Ordyniak Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12249 …, 2021 | 16 | 2021 |
| Scheduling kernels via configuration LP D Knop, M Koutecký arXiv preprint arXiv:2003.02187, 2020 | 14 | 2020 |
| Complexity of scheduling few types of jobs on related and unrelated machines M Koutecký, J Zink Journal of Scheduling, 1-18, 2025 | 13 | 2025 |
| Multitype integer monoid optimization and applications D Knop, M Koutecký, A Levin, M Mnich, S Onn arXiv preprint arXiv:1909.07326, 2019 | 13 | 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 | 13 | 2018 |
| High-multiplicity N-fold IP via configuration LP D Knop, M Koutecký, A Levin, M Mnich, S Onn Mathematical programming 200 (1), 199-227, 2023 | 12 | 2023 |
Dusan KnopCzech Technical University in Pragueยืนยันอีเมลแล้วที่ fit.cvut.cz