Dusan Knop
Dusan Knop
Technische Universität Berlin
Verified email at kam.mff.cuni.cz
Cited by
Cited by
Scheduling meets n-fold integer programming
D Knop, M Koutecký
Journal of Scheduling 21 (5), 493-503, 2018
Combinatorial n-fold integer programming and applications
D Knop, M Koutecký, M Mnich
arXiv preprint arXiv:1705.08657, 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
Parameterized complexity of length-bounded cuts and multicuts
P Dvořák, D Knop
Algorithmica 80 (12), 3597-3617, 2018
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
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
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
Target set selection in dense graph classes
P Dvořák, D Knop, T Toufar
arXiv preprint arXiv:1610.07530, 2016
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
Evaluating and Tuning n-fold Integer Programming
K Altmanová, D Knop, M Koutecký
Journal of Experimental Algorithmics (JEA) 24, 1-22, 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
A unifying framework for manipulation problems
D Knop, M Koutecký, M Mnich
arXiv preprint arXiv:1801.09584, 2018
Parameterized complexity of fair vertex evaluation problems
D Knop, T Masařík, T Toufar
arXiv preprint arXiv:1803.06878, 2018
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
Unary Integer Linear Programming with Structural Restrictions.
E Eiben, R Ganian, D Knop, S Ordyniak
IJCAI, 1284-1290, 2018
Integer programming in parameterized complexity: three miniatures
T Gavenčiak, D Knop, M Koutecký
arXiv preprint arXiv:1711.02032, 2017
Graph isomorphism restricted by lists
P Klavik, D Knop, P Zeman
Theoretical Computer Science 860, 51-71, 2021
Kernelization of Graph Hamiltonicity: Proper H-Graphs
S Chaplick, FV Fomin, PA Golovach, D Knop, P Zeman
Workshop on Algorithms and Data Structures, 296-310, 2019
Multitype integer monoid optimization and applications
D Knop, M Koutecký, A Levin, M Mnich, S Onn
arXiv preprint arXiv:1909.07326, 2019
Parameterized algorithms for finding a collective set of items
R Bredereck, P Faliszewski, A Kaczmarczyk, D Knop, R Niedermeier
Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1838-1845, 2020
The system can't perform the operation now. Try again later.
Articles 1–20