Follow
Dusan Knop
Title
Cited by
Cited by
Year
Scheduling meets n-fold integer programming
D Knop, M Koutecký
Journal of Scheduling 21, 493-503, 2018
702018
Combinatorial n-fold integer programming and applications
D Knop, M Koutecký, M Mnich
arXiv preprint arXiv:1705.08657, 2017
592017
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
482020
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
T Toufar, T Masařík, M Koutecký, D Knop
Logical Methods in Computer Science 15, 2019
312019
Parameterized complexity of length-bounded cuts and multicuts
P Dvořák, D Knop
Algorithmica 80 (12), 3597-3617, 2018
282018
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
262020
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
262017
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 Vesely
SIAM Journal on Discrete Mathematics 35 (1), 546-574, 2021
232021
Evaluating and Tuning n-fold Integer Programming
K Altmanová, D Knop, M Koutecký
Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019
172019
Target set selection in dense graph classes
P Dvořák, D Knop, T Toufar
arXiv preprint arXiv:1610.07530, 2016
172016
Multidimensional stable roommates with master list
R Bredereck, K Heeger, D Knop, R Niedermeier
Web and Internet Economics: 16th International Conference, WINE 2020 …, 2020
152020
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
152019
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
15*2018
A unifying framework for manipulation problems
D Knop, M Koutecký, M Mnich
arXiv preprint arXiv:1801.09584, 2018
152018
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
142020
Parameterized complexity of fair vertex evaluation problems
D Knop, T Masařík, T Toufar
arXiv preprint arXiv:1803.06878, 2018
142018
Kernelization of Graph Hamiltonicity: Proper -Graphs
S Chaplick, FV Fomin, PA Golovach, D Knop, P Zeman
SIAM Journal on Discrete Mathematics 35 (2), 840-892, 2021
132021
Integer programming in parameterized complexity: Three miniatures
T Gavenčiak, D Knop, M Koutecký
arXiv preprint arXiv:1711.02032, 2017
122017
Integer programming in parameterized complexity: Five miniatures
T Gavenčiak, M Koutecký, D Knop
Discrete Optimization 44, 100596, 2022
112022
Fine-grained view on bribery for group identification
N Boehmer, R Bredereck, D Knop, J Luo
arXiv preprint arXiv:2105.08376, 2021
102021
The system can't perform the operation now. Try again later.
Articles 1–20