Knop, Dušan
118  Ergebnisse:
Personensuche X
?
1

Polynomial kernels for tracking shortest paths:

Blažej, Václav ; Choudhary, Pratibha ; Knop, Dušan...
Information Processing Letters.  179 (2023)  - p. 106315 , 2023
 
?
2

Establishing Herd Immunity is Hard Even in Simple Geometric..:

, In: Lecture Notes in Computer Science; Algorithms and Models for the Web Graph,
 
?
5

Fine-grained view on bribery for group identification:

Boehmer, Niclas ; Bredereck, Robert ; Knop, Dušan.
Autonomous Agents and Multi-Agent Systems.  37 (2023)  1 - p. , 2023
 
?
6

Length-bounded cuts: Proper interval graphs and structural ..:

Bentert, Matthias ; Heeger, Klaus ; Knop, Dušan
Journal of Computer and System Sciences.  126 (2022)  - p. 21-43 , 2022
 
?
8

High-multiplicity N-fold IP via configuration LP:

Knop, Dušan ; Koutecký, Martin ; Levin, Asaf..
Mathematical Programming.  200 (2022)  1 - p. 199-227 , 2022
 
?
10

Target Set Selection in Dense Graph Classes:

Dvořák, Pavel ; Knop, Dušan ; Toufar, Tomáš
SIAM Journal on Discrete Mathematics.  36 (2022)  1 - p. 536-572 , 2022
 
?
11

Constant Factor Approximation for Tracking Paths and Fault ..:

, In: Approximation and Online Algorithms; Lecture Notes in Computer Science,
 
?
12

Kernelization of Graph Hamiltonicity: Proper $H$-Graphs:

Chaplick, Steven ; Fomin, Fedor V. ; Golovach, Petr A...
SIAM Journal on Discrete Mathematics.  35 (2021)  2 - p. 840-892 , 2021
 
?
13

Local linear set on graphs with bounded twin cover number:

Knop, Dušan
Information Processing Letters.  170 (2021)  - p. 106118 , 2021
 
?
14

Parameterized complexity of configuration integer programs:

Knop, Dušan ; Koutecký, Martin ; Levin, Asaf..
Operations Research Letters.  49 (2021)  6 - p. 908-913 , 2021
 
1-15