Scheduling meets n -fold integer programming D Knop, M Koutecký
Journal of Scheduling 21, 493-503, 2018
88 2018 Combinatorial n-fold integer programming and applications D Knop, M Koutecký, M Mnich
arXiv preprint arXiv:1705.08657, 2017
78 2017 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 Tight complexity lower bounds for integer linear programming with few constraints D Knop, M Pilipczuk, M Wrochna
ACM Transactions on Computation Theory (TOCT) 12 (3), 1-19, 2020
45 2020 Parameterized complexity of length-bounded cuts and multicuts P Dvořák, D Knop
Algorithmica 80 (12), 3597-3617, 2018
32 2018 Solving integer linear programs with a small number of global variables and constraints P Dvořák, E Eiben, R Ganian, D Knop, S Ordyniak
arXiv preprint arXiv:1706.06084, 2017
32 2017 High-multiplicity fair allocation: Lenstra empowered by n-fold integer programming R Bredereck, A Kaczmarczyk, D Knop, R Niedermeier
Proceedings of the 2019 ACM Conference on Economics and Computation, 505-523, 2019
28 2019 Target set selection in dense graph classes P Dvořák, D Knop, T Toufar
arXiv preprint arXiv:1610.07530, 2016
28 * 2016 Integer programming in parameterized complexity: Five miniatures T Gavenčiak, M Koutecký, D Knop
Discrete Optimization 44, 100596, 2022
25 2022 Adapting stable matchings to evolving preferences R Bredereck, J Chen, D Knop, J Luo, R Niedermeier
Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1830-1837, 2020
22 2020 Multidimensional stable roommates with master list R Bredereck, K Heeger, D Knop, R Niedermeier
International Conference on Web and Internet Economics, 59-73, 2020
21 2020 Evaluating and Tuning n -fold Integer Programming K Altmanová, D Knop, M Koutecký
Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019
20 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
20 * 2018 Parameterized complexity of fair vertex evaluation problems D Knop, T Masařík, T Toufar
arXiv preprint arXiv:1803.06878, 2018
19 2018 Parameterized approximation schemes for steiner trees with small number of steiner vertices P Dvorák, AE Feldmann, D Knop, T Masarík, T Toufar, P Veselý
Leibniz International Proceedings in Informatics, LIPIcs 96, 26, 2018
18 2018 A unifying framework for manipulation problems D Knop, M Koutecký, M Mnich
arXiv preprint arXiv:1801.09584, 2018
18 2018 Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters R Bredereck, K Heeger, D Knop, R Niedermeier
Information and Computation 289, 104943, 2022
17 2022 Kernelization of Graph Hamiltonicity: Proper S Chaplick, FV Fomin, PA Golovach, D Knop, P Zeman
SIAM Journal on Discrete Mathematics 35 (2), 840-892, 2021
17 2021 Fine-grained view on bribery for group identification N Boehmer, R Bredereck, D Knop, J Luo
Autonomous Agents and Multi-Agent Systems 37 (1), 21, 2023
16 2023 
Martin KouteckýCharles UniversityZweryfikowany adres z iuuk.mff.cuni.cz
