Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Knop, Dušan
118  Ergebnisse:
Personensuche X
?
1

Hedonic diversity games: A complexity picture with more tha..:

Ganian, Robert ; Hamm, Thekla ; Knop, Dušan..
Artificial Intelligence.  325 (2023)  - p. 104017 , 2023
Link: https://doi.org/10.1016/..
 
?
2

Polynomial kernels for tracking shortest paths:

Blažej, Václav ; Choudhary, Pratibha ; Knop, Dušan...
Information Processing Letters.  179 (2023)  - p. 106315 , 2023
Link: https://doi.org/10.1016/..
 
?
3

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
Link: https://doi.org/10.1007/..
 
?
4

Constant factor approximation for tracking paths and fault ..:

Blažej, Václav ; Choudhary, Pratibha ; Knop, Dušan...
Discrete Optimization.  47 (2023)  - p. 100756 , 2023
Link: https://doi.org/10.1016/..
 
?
5

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

, In: Lecture Notes in Computer Science; Algorithms and Models for the Web Graph,
Dvořák, Michal ; Knop, Dušan ; Schierreich, Šimon - p. 68-82 , 2023
Link: https://doi.org/10.1007/..
 
?
6

Integer programming in parameterized complexity: Five minia..:

Gavenčiak, Tomáš ; Koutecký, Martin ; Knop, Dušan
Discrete Optimization.  44 (2022)  - p. 100596 , 2022
Link: https://doi.org/10.1016/..
 
?
7

High-multiplicity N-fold IP via configuration LP:

Knop, Dušan ; Koutecký, Martin ; Levin, Asaf..
Mathematical Programming.  200 (2022)  1 - p. 199-227 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Parameterized complexity of stable roommates with ties and ..:

Bredereck, Robert ; Heeger, Klaus ; Knop, Dušan.
Information and Computation.  289 (2022)  - p. 104943 , 2022
Link: https://doi.org/10.1016/..
 
?
9

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
Link: https://doi.org/10.1137/..
 
?
10

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
Link: https://doi.org/10.1016/..
 
?
11

Local linear set on graphs with bounded twin cover number:

Knop, Dušan
Information Processing Letters.  170 (2021)  - p. 106118 , 2021
Link: https://doi.org/10.1016/..
 
?
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
Link: https://doi.org/10.1137/..
 
?
13

High-Multiplicity Fair Allocation Made More Practical:

, In: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems,
Bredereck, Robert ; Figiel, Aleksander ; Kaczmarczyk, Andrzej.. - p. 260-268 , 2021
Link: https://dl.acm.org/doi/1..
 
?
14

Constant Factor Approximation for Tracking Paths and Fault ..:

, In: Approximation and Online Algorithms; Lecture Notes in Computer Science,
Blažej, Václav ; Choudhary, Pratibha ; Knop, Dušan... - p. 23-38 , 2021
Link: https://doi.org/10.1007/..
 
?
15

Parameterized Approximation Schemes for Steiner Trees with ..:

Dvořák, Pavel ; Feldmann, Andreas E. ; Knop, Dušan...
SIAM Journal on Discrete Mathematics.  35 (2021)  1 - p. 546-574 , 2021
Link: https://doi.org/10.1137/..
 
1-15