Dušan Knop

Available identifiers

zbMath Open knop.dusanWikidataQ62056482 ScholiaQ62056482MaRDI QIDQ1647837

List of research outcomes

Publication	Date of Publication	Type
Maximizing Social Welfare in Score-Based Social Distance Games	2024-02-28	Paper
Hedonic diversity games: a complexity picture with more than two colors	2023-12-14	Paper
https://portal.mardi4nfdi.de/entity/Q6087208	2023-11-14	Paper
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View	2023-11-13	Paper
Recognizing Proper Tree-Graphs	2023-11-13	Paper
Establishing herd immunity is hard even in simple geometric networks	2023-10-04	Paper
High-multiplicity \(N\)-fold IP via configuration LP	2023-05-25	Paper
Multidimensional stable roommates with master list	2023-03-21	Paper
Constant factor approximation for tracking paths and fault tolerant feedback vertex set	2023-03-03	Paper
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters	2023-02-03	Paper
Treewidth is NP-Complete on Cubic Graphs (and related results)	2023-01-24	Paper
Graph isomorphism restricted by lists	2022-12-21	Paper
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters	2022-12-08	Paper
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints	2022-12-05	Paper
Polynomial kernels for tracking shortest paths	2022-10-28	Paper
Constant factor approximation for tracking paths and fault tolerant feedback vertex set	2022-10-19	Paper
https://portal.mardi4nfdi.de/entity/Q5091008	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5092394	2022-07-21	Paper
Complexity of the Steiner Network Problem with Respect to the Number of Terminals	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5090494	2022-07-18	Paper
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations	2022-07-03	Paper
Integer programming in parameterized complexity: five miniatures	2022-06-09	Paper
Length-bounded cuts: proper interval graphs and structural parameters	2022-03-29	Paper
Target Set Selection in Dense Graph Classes	2022-03-15	Paper
Parameterized complexity of configuration integer programs	2022-03-11	Paper
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints	2021-11-02	Paper
Integer Programming in Parameterized Complexity: Three Miniatures.	2021-08-04	Paper
Local linear set on graphs with bounded twin cover number	2021-06-16	Paper
Kernelization of Graph Hamiltonicity: Proper $H$-Graphs	2021-04-28	Paper
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices	2021-03-30	Paper
Graph isomorphism restricted by lists	2021-03-09	Paper
https://portal.mardi4nfdi.de/entity/Q5140719	2020-12-16	Paper
Combinatorial \(n\)-fold integer programming and applications	2020-10-21	Paper
https://portal.mardi4nfdi.de/entity/Q3304124	2020-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q5111743	2020-05-27	Paper
The clever shopper problem	2020-02-27	Paper
Integer programming and incidence treedepth	2020-02-06	Paper
Kernelization of graph Hamiltonicity: proper \(H\)-graphs	2020-01-16	Paper
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity	2020-01-03	Paper
Partitioning graphs into induced subgraphs	2019-12-30	Paper
Scheduling meets \(n\)-fold integer programming	2019-08-08	Paper
Parameterized complexity of length-bounded cuts and multicuts	2018-10-18	Paper
Parameterized complexity of distance labeling and uniform channel assignment problems	2018-09-17	Paper
Computational complexity of distance edge labeling	2018-06-27	Paper
https://portal.mardi4nfdi.de/entity/Q4636646	2018-04-19	Paper
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity	2018-01-04	Paper
\(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard	2017-06-13	Paper
Partitioning graphs into induced subgraphs	2017-06-01	Paper
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems	2016-09-02	Paper
Computational complexity of distance edge labeling	2016-04-04	Paper
Parametrized Complexity of Length-Bounded Cuts and Multi-cuts	2015-09-30	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Dušan Knop