The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Dusan Knop" ( http://dblp.L3S.de/Authors/Dusan_Knop )

URL (Homepage):  https://orcid.org/0000-0003-2588-5709  Author page on DBLP  Author page in RDF  Community of Dusan Knop in ASPL-2

Publication years (Num. hits)
2015 (7) 2016 (5) 2017 (11) 2018 (16) 2019 (10)
Publication types (Num. hits)
article(27) inproceedings(22)
Venues (Conferences, Journals, ...)
CoRR(22) STACS(4) Discrete Applied Mathematics(2) IJCAI(2) AAAI(1) AAMAS(1) Algorithmica(1) COCOON(1) EC(1) ESA(1) Inf. Process. Lett.(1) IPCO(1) IPEC(1) ISAAC(1) IWOCA(1) J. Scheduling(1) More (+10 of total 23)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 50 publication records. Showing 49 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Matthias Bentert, Klaus Heeger, Dusan Knop Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier Adapting Stable Matchings to Evolving Preferences. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn Multitype Integer Monoid Optimization and Applications. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna Integer Programming and Incidence Treedepth. Search on Bibsonomy IPCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Bredereck, Andrzej Kaczmarczyk 0001, Dusan Knop, Rolf Niedermeier High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. Search on Bibsonomy EC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Tomás Masarík, Tomás Toufar Parameterized Complexity of Fair Vertex Evaluation Problems. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Solving Integer Quadratic Programming via Explicit and Structural Restrictions. Search on Bibsonomy AAAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman 0001 Kernelization of Graph Hamiltonicity: Proper H-Graphs. Search on Bibsonomy WADS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Michal Pilipczuk, Marcin Wrochna Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý Complexity of the Steiner Network Problem with Respect to the Number of Terminals. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pavel Dvorák, Dusan Knop Parameterized Complexity of Length-bounded Cuts and Multicuts. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich Voting and Bribing in Single-Exponential Time. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Katerina Altmanová, Dusan Knop, Martin Koutecký Evaluating and Tuning n-fold Integer Programming. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Dusan Knop, Tomás Masarík, Tomás Toufar Parameterized complexity of fair deletion problems II. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý Complexity of the Steiner Network Problem with Respect to the Number of Terminals. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich A Unifying Framework for Manipulation Problems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Dusan Knop, Michal Pilipczuk, Marcin Wrochna Tight complexity lower bounds for integer linear programming with few constraints. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Jirí Fiala 0001, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl Parameterized complexity of distance labeling and uniform channel assignment problems. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Tomás Masarík Computational complexity of distance edge labeling. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký Scheduling meets n-fold integer programming. Search on Bibsonomy J. Scheduling The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pavel Dvorák, Dusan Knop, Tomás Toufar Target Set Selection in Dense Graph Classes. Search on Bibsonomy ISAAC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Katerina Altmanová, Dusan Knop, Martin Koutecký Evaluating and Tuning n-fold Integer Programming. Search on Bibsonomy SEA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Unary Integer Linear Programming with Structural Restrictions. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich A Unifying Framework for Manipulation Problems. Search on Bibsonomy AAMAS The full citation details ... 2018 DBLP  BibTeX  RDF
1Tomas Gavenciak, Dusan Knop, Martin Koutecký Integer Programming in Parameterized Complexity: Three Miniatures. Search on Bibsonomy IPEC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lukas Folwarczny, Dusan Knop IV-matching is strongly NP-hard. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich Combinatorial n-fold Integer Programming and Applications. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Tomas Gavenciak, Dusan Knop, Martin Koutecký Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich Combinatorial n-fold Integer Programming and Applications. Search on Bibsonomy ESA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dusan Knop Partitioning Graphs into Induced Subgraphs. Search on Bibsonomy LATA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich Voting and Bribing in Single-Exponential Time. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. Search on Bibsonomy IJCAI The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pavel Dvorák, Dusan Knop, Tomás Toufar Target Set Selection in Dense Graph Classes. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Dusan Knop, Martin Koutecký Scheduling meets n-fold Integer Programming. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Pavel Klavík, Dusan Knop, Peter Zeman 0001 Graph Isomorphism Restricted by Lists. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Pavel Dvorák, Dusan Knop, Tomás Masarík Anti-Path Cover on Sparse Graph Classes. Search on Bibsonomy MEMICS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jirí Fiala 0001, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). Search on Bibsonomy COCOON The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jirí Fiala 0001, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl Distance constrained labeling on graphs with bounded neighborhood diversity. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Lukas Folwarczny, Dusan Knop IV-matching is strongly NP-hard. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Dusan Knop A note on partition into triangles parametrized by tree-width. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Dusan Knop, Tomás Masarík Computational complexity of distance edge labeling. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Dusan Knop, Pavel Dvorak Parameterized complexity of length-bounded cuts and multi-cuts. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Pavel Dvorak, Dusan Knop Parametrized Complexity of Length-Bounded Cuts and Multi-cuts. Search on Bibsonomy TAMC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Tomás Masarík Computational Complexity of Distance Edge Labeling. Search on Bibsonomy IWOCA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #49 of 49 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license