×

zbMATH — the first resource for mathematics

Knop, Dušan

Compute Distance To:
Author ID: knop.dusan Recent zbMATH articles by "Knop, Dušan"
Published as: Knop, Dušan; Knop, Dusan
External Links: ORCID
Documents Indexed: 26 Publications since 2015

Publications by Year

Citations contained in zbMATH Open

17 Publications have been cited 43 times in 31 Documents Cited by Year
Scheduling meets \(n\)-fold integer programming. Zbl 1418.90113
Knop, Dušan; Koutecký, Martin
9
2018
Voting and bribing in single-exponential time. Zbl 1402.68098
Knop, Dušan; Koutecký, Martin; Mnich, Matthias
6
2017
Parametrized complexity of length-bounded cuts and multi-cuts. Zbl 1454.68056
Dvořák, Pavel; Knop, Dušan
4
2015
Parameterized complexity of distance labeling and uniform channel assignment problems. Zbl 1395.05143
Fiala, Jiří; Gavenčiak, Tomáš; Knop, Dušan; Koutecký, Martin; Kratochvíl, Jan
3
2018
Combinatorial \(n\)-fold integer programming and applications. Zbl 1442.90129
Knop, Dušan; Koutecký, Martin; Mnich, Matthias
3
2017
Combinatorial \(n\)-fold integer programming and applications. Zbl 1451.90100
Knop, Dušan; Koutecký, Martin; Mnich, Matthias
3
2020
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. Zbl 06822010
Knop, Dušan; Koutecký, Martin; Masařík, Tomáš; Toufar, Tomáš
3
2017
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. Zbl 1427.68125
Knop, Dušan; Koutecký, Martin; Masařík, Tomáš; Toufar, Tomáš
2
2019
Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. Zbl 07228417
Dvořák, Pavel; Feldmann, Andreas Emil; Knop, Dušan; Masařík, Tomáš; Toufar, Tomáš; Veselý, Pavel
2
2018
Integer programming and incidence treedepth. Zbl 1436.90083
Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian; Pilipczuk, Michał; Wrochna, Marcin
1
2019
Partitioning graphs into induced subgraphs. Zbl 06725148
Knop, Dušan
1
2017
Kernelization of graph Hamiltonicity: proper \(H\)-graphs. Zbl 07152217
Chaplick, Steven; Fomin, Fedor V.; Golovach, Petr A.; Knop, Dušan; Zeman, Peter
1
2019
Computational complexity of distance edge labeling. Zbl 06562492
Knop, Dušan; Masařík, Tomáš
1
2016
Parameterized complexity of length-bounded cuts and multicuts. Zbl 1400.90258
Dvořák, Pavel; Knop, Dušan
1
2018
Computational complexity of distance edge labeling. Zbl 1390.05204
Knop, Dušan; Masařík, Tomáš
1
2018
Evaluating and tuning \(n\)-fold integer programming. Zbl 07286683
Altmanová, Katerina; Knop, Dusan; Koutecký, Martin
1
2018
Integer programming in parameterized complexity: three miniatures. Zbl 07378607
Gavenčiak, Tomáš; Knop, Dušan; Koutecký, Martin
1
2019
Combinatorial \(n\)-fold integer programming and applications. Zbl 1451.90100
Knop, Dušan; Koutecký, Martin; Mnich, Matthias
3
2020
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. Zbl 1427.68125
Knop, Dušan; Koutecký, Martin; Masařík, Tomáš; Toufar, Tomáš
2
2019
Integer programming and incidence treedepth. Zbl 1436.90083
Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian; Pilipczuk, Michał; Wrochna, Marcin
1
2019
Kernelization of graph Hamiltonicity: proper \(H\)-graphs. Zbl 07152217
Chaplick, Steven; Fomin, Fedor V.; Golovach, Petr A.; Knop, Dušan; Zeman, Peter
1
2019
Integer programming in parameterized complexity: three miniatures. Zbl 07378607
Gavenčiak, Tomáš; Knop, Dušan; Koutecký, Martin
1
2019
Scheduling meets \(n\)-fold integer programming. Zbl 1418.90113
Knop, Dušan; Koutecký, Martin
9
2018
Parameterized complexity of distance labeling and uniform channel assignment problems. Zbl 1395.05143
Fiala, Jiří; Gavenčiak, Tomáš; Knop, Dušan; Koutecký, Martin; Kratochvíl, Jan
3
2018
Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. Zbl 07228417
Dvořák, Pavel; Feldmann, Andreas Emil; Knop, Dušan; Masařík, Tomáš; Toufar, Tomáš; Veselý, Pavel
2
2018
Parameterized complexity of length-bounded cuts and multicuts. Zbl 1400.90258
Dvořák, Pavel; Knop, Dušan
1
2018
Computational complexity of distance edge labeling. Zbl 1390.05204
Knop, Dušan; Masařík, Tomáš
1
2018
Evaluating and tuning \(n\)-fold integer programming. Zbl 07286683
Altmanová, Katerina; Knop, Dusan; Koutecký, Martin
1
2018
Voting and bribing in single-exponential time. Zbl 1402.68098
Knop, Dušan; Koutecký, Martin; Mnich, Matthias
6
2017
Combinatorial \(n\)-fold integer programming and applications. Zbl 1442.90129
Knop, Dušan; Koutecký, Martin; Mnich, Matthias
3
2017
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. Zbl 06822010
Knop, Dušan; Koutecký, Martin; Masařík, Tomáš; Toufar, Tomáš
3
2017
Partitioning graphs into induced subgraphs. Zbl 06725148
Knop, Dušan
1
2017
Computational complexity of distance edge labeling. Zbl 06562492
Knop, Dušan; Masařík, Tomáš
1
2016
Parametrized complexity of length-bounded cuts and multi-cuts. Zbl 1454.68056
Dvořák, Pavel; Knop, Dušan
4
2015

Citations by Year