Dusan Knop

Czech Technical University in Prague

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

Skills and Expertise
Graph Τheory、Discrete Mathematics、Combinatorics、Theoretical Computer Science、Algorithm Analysis、Combinatorial Optimization、Algorithm Development、Optimization、Graphs、Linear Programming

Papers47 papers

Sort

By YearBy Citation

Adapting Stable Matchings to Evolving Preferences

Robert Bredereck,Jiehua Chen,Dusan Knop, Junjie Luo,Rolf Niedermeier

national conference on artificial intelligence, (2020)

Cited by2Bibtex

Graph Isomorphism Restricted by Lists

Pavel Klavík,Dusan Knop,Peter Zeman

WG, pp.106-118, (2020)

EIBibtex

Combinatorial n-fold integer programming and applications

Dusan Knop, Martin Koutecký,Matthias Mnich

MATHEMATICAL PROGRAMMING, no. 1-2 (2020): 1.0-34.0

EIBibtex

Recognizing Proper Tree-Graphs

Steven Chaplick,Petr A. Golovach, Tim A. Hartmann,Dušan Knop

IPEC, (2020)

EIBibtex

Partitioning graphs into induced subgraphs

Dušan Knop

Discrete Applied Mathematics, (2020): 31-42

Bibtex

Fine-Grained View on Bribery for Group Identification

Niclas Boehmer,Robert Bredereck,DuÅ¡an Knop,Junjie Luo

IJCAI 2020, pp.67-73, (2020)

EIBibtex

Voting and Bribing in Single-Exponential Time

Dušan Knop, Martin Koutecký,Matthias Mnich

ACM Transactions on Economics and Computation, no. 3 (2020): 1-28

EIBibtex

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

Dušan Knop,Michał Pilipczuk,Marcin Wrochna

ACM Transactions on Computation Theory, no. 3 (2020): 1-19

Cited by7EIBibtex

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming

Bredereck Robert,Kaczmarczyk Andrzej,Knop Dušan,Niedermeier Rolf

Bibtex

Scheduling Kernels via Configuration LP

Knop Dušan, Koutecký Martin

Bibtex

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View

Hušek Radek,Knop Dušan, Masařík Tomáš

IPEC, (2020)

EIBibtex

Parameterized Algorithms for Finding a Collective Set of Items

Robert Bredereck,Piotr Faliszewski,Andrzej Kaczmarczyk,Dusan Knop,Rolf Niedermeier

national conference on artificial intelligence, (2020)

Cited by3Bibtex

Parameterized Complexity of Fair Vertex Evaluation Problems

Dušan Knop, Tomáš Masařík,Tomáš Toufar

mathematical foundations of computer science, (2019)

EIBibtex

Multitype Integer Monoid Optimization and Applications

Knop Dušan, Koutecký Martin,Levin Asaf,Mnich Matthias,Onn Shmuel

Bibtex

Complexity of the Steiner Network Problem with Respect to the Number of Terminals

Eduard Eiben,Dusan Knop,Fahad Panolan,Ondrej Suchý

symposium on theoretical aspects of computer science, (2019)

Cited by2EIBibtex

Evaluating and Tuning -fold Integer Programming

Katerina Altmanová,Dusan Knop, Martin Koutecký

Journal of Experimental Algorithmics, no. 1 (2019): 1-22

EIBibtex

Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters

Robert Bredereck, Klaus Heeger,Dusan Knop,Rolf Niedermeier

ISAAC, (2019)

Cited by1EIBibtex

Kernelization of Graph Hamiltonicity - Proper H-Graphs

Steven Chaplick,Fedor V. Fomin,Petr A. Golovach,Dusan Knop,Peter Zeman

WADS, pp.296-310, (2019)

EIBibtex

Tight complexity lower bounds for integer linear programming with few constraints

Dusan Knop,Michal Pilipczuk,Marcin Wrochna

STACS, (2019)

Cited by7EIBibtex

High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming

Robert Bredereck,Andrzej Kaczmarczyk,Dušan Knop,Rolf Niedermeier

Proceedings of the 2019 ACM Conference on Economics and Computation, pp.505-523, (2019)

Cited by4EIBibtex

View All

Base Info Papers Patents Projects

Dusan KnopBinding

Papers47 papers

Dusan Knop