I agree that this site is using cookies. You can find further informations here.
X
Knop, Dušan
63  results:
english X
?
1

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/..
 
?
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

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/..
 
?
5

Treewidth Is NP-Complete on Cubic Graphs:

Bodlaender, Hans L ; Bonnet, Édouard ; Jaffke, Lars...
Is Part Of LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023).  , 2023
Link: https://doi.org/10.4230/..
 
?
6

Maximizing Social Welfare in Score-Based Social Distance Ga..:

Ganian, Robert ; Hamm, Thekla ; Knop, Dusan...
2075-2180.  , 2023
Link: https://dspace.library.u..
 
?
7

Treewidth is NP-Complete for Cubic Graphs (and related resu..:

Bodlaender, Hans, L ; Bonnet, Edouard ; Jaffke, Lars...
hal-04292980.  , 2023
Link: https://hal.science/hal-..
 
?
8

Treewidth is NP-complete on cubic graphs (and related resul..:

Bodlaender, Hans ; Bonnet, Édouard ; Jaffke, Lars...
https://pure.itu.dk/portal/da/publications/648e83ef-a77c-4d30-aa4e-3f6472b37bd2.  , 2023
Link: https://pure.itu.dk/port..
 
?
9

Treewidth is NP-Complete for Cubic Graphs (and related resu..:

Bodlaender, Hans, L ; Bonnet, Edouard ; Jaffke, Lars...
hal-04292980.  , 2023
Link: https://hal.science/hal-..
 
?
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
Link: https://doi.org/10.1137/..
 
?
11

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/..
 
?
12

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/..
 
?
13

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/..
 
?
14

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/..
 
?
15

High multiplicity N-fold IP via configuration LP:

Knop, Dušan ; Koutecký, Martin ; Levin, Asaf..
Mathematical programming.  , 2022
Link: http://hdl.handle.net/11..
 
1-15