Local linear set on graphs with bounded twin cover number von Knop, Dušan

Volltext

Partitioning graphs into induced subgraphs von Knop, Dušan

Volltext

Combinatorial n-fold integer programming and applications von Knop, Dušan, Koutecký, Martin, Mnich, Matthias

Volltext

Scheduling meets n-fold integer programming von Knop, Dušan, Koutecký, Martin

Volltext

Multivariate algorithmics for eliminating envy by donating goods von Boehmer, Niclas, Bredereck, Robert, Heeger, Klaus, Knop, Dušan, Luo, Junjie

Volltext

Fine-grained view on bribery for group identification von Boehmer, Niclas, Bredereck, Robert, Knop, Dušan, Luo, Junjie

Volltext

Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters von Bredereck, Robert, Heeger, Klaus, Knop, Dušan, Niedermeier, Rolf

Volltext

High-multiplicity N-fold IP via configuration LP von Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

Volltext

Parameterized Complexity of Length-bounded Cuts and Multicuts von Dvořák, Pavel, Knop, Dušan

Volltext

The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints von Dvořák, Pavel, Eiben, Eduard, Ganian, Robert, Knop, Dušan, Ordyniak, Sebastian

Volltext

Length-bounded cuts: Proper interval graphs and structural parameters von Bentert, Matthias, Heeger, Klaus, Knop, Dušan

Volltext

Hedonic diversity games: A complexity picture with more than two colors von Ganian, Robert, Hamm, Thekla, Knop, Dušan, Schierreich, Šimon, Suchý, Ondřej

Volltext

Graph isomorphism restricted by lists von Klavík, Pavel, Knop, Dušan, Zeman, Peter

Volltext

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints von Knop, Dušan, Pilipczuk, Michał, Wrochna, Marcin

Volltext

Target Set Selection in Dense Graph Classes von Dvořák, Pavel, Knop, Dušan, Toufar, Tomáš

Volltext

Voting and Bribing in Single-Exponential Time von Knop, Dušan, Koutecký, Martin, Mnich, Matthias

Volltext

Integer programming in parameterized complexity: Five miniatures von Gavenčiak, Tomáš, Koutecký, Martin, Knop, Dušan

Volltext

Parameterized complexity of configuration integer programs von Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

Volltext

On the Complexity of Target Set Selection in Simple Geometric Networks von Dvořák, Michal, Knop, Dušan, Šimon Schierreich

Volltext

Computational complexity of distance edge labeling von Knop, Dušan, Masařík, Tomáš

Volltext