I agree that this site is using cookies. You can find further informations here.
X
Knop, Dušan
31  results:
OpenAccess-fulltext X
english X
Search for persons X
?
1

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

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

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

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

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

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

High multiplicity N-fold IP via configuration LP:

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

G2OAT Solver for PACE 2022 (DFVS) Heuristic Track:

Červený, Radovan ; Dvořák, Michal ; Nguyen, Xuan Thang...
https://gitlab.fit.cvut.cz/pace-challenge/2022/goat/heuristic.  , 2022
Link: https://zenodo.org/recor..
 
?
8

G2OAT Solver for PACE 2022 (DFVS) Exact Track:

Červený, Radovan ; Dvořák, Michal ; Nguyen, Xuan Thang...
https://gitlab.fit.cvut.cz/pace-challenge/2022/goat/exact.  , 2022
Link: https://zenodo.org/recor..
 
?
9

Parameterized complexity of configuration integer programs:

Knop, Dušan ; Koutecký, Martin ; Levin, Asaf..
Operations research letters.  , 2021
Link: http://hdl.handle.net/11..
 
?
10

Kernelization of Graph Hamiltonicity: Proper H-Graphs:

Chaplick, Steven ; Fomin, Fedor ; Golovach, Petr..
Norges forskningsråd: 263317.  , 2021
Link: https://hdl.handle.net/1..
 
?
11

KERNELIZATION OF GRAPH HAMILTONICITY:Proper H-Graphs:

Chaplick, Steven ; Fomin, Fedor ; Golovach, Petr A..
Chaplick , S , Fomin , F , Golovach , P A , Knop , D & Zeman , P 2021 , ' KERNELIZATION OF GRAPH HAMILTONICITY : Proper H-Graphs ' , Siam Journal on Discrete Mathematics , vol. 35 , no. 2 , pp. 840-892 . https://doi.org/10.1137/19M1299001.  , 2021
Link: https://cris.maastrichtu..
 
?
12

Recognizing Proper Tree-Graphs:

Chaplick, Steven ; Golovach, Petr A ; Hartmann, Tim A.
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPICS.IPEC.2020.8.  , 2020
Link: https://publications.rwt..
 
?
13

Recognizing Proper Tree-Graphs:

Chaplick, Steven ; Golovach, Petr A ; Hartmann, Tim A.
Chaplick , S , Golovach , P A , Hartmann , T A & Knop , D 2020 , Recognizing Proper Tree-Graphs . in Y Cao & M Pilipczuk (eds) , 15th International Symposium on Parameterized and Exact Computation (IPEC 2020) . vol. 180 , Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , Dagstuhl, Germany , Leibniz International Proceedings in Informatics , vol. 180 , pp. 8:1-8:15 , 15th International Symposium on Parameterized and Exact Computation , Hongkong , China , 14/12/20 . https://doi.org/10.4230/LIPICS.IPEC.2020.8.  , 2020
Link: https://cris.maastrichtu..
 
?
14

Recognizing Proper Tree-Graphs:

Chaplick, Steven ; Golovach, Petr ; Hartmann, Tim.
Norges forskningsråd: 263317.  , 2020
Link: https://hdl.handle.net/1..
 
?
15

Parameterized Complexity of Fair Vertex Evaluation Problems:

Knop, Dušan ; Masařík, Tomáš ; Toufar, Tomáš
Is Part Of LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019).  , 2019
Link: https://doi.org/10.4230/..
 
1-15