The following pages link to Dušan Knop (Q1647837):
Displaying 46 items.
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- Local linear set on graphs with bounded twin cover number (Q2032157) (← links)
- Polynomial kernels for tracking shortest paths (Q2094386) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- Kernelization of graph Hamiltonicity: proper \(H\)-graphs (Q2285097) (← links)
- Integer programming and incidence treedepth (Q2293088) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- \(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard (Q2628277) (← links)
- Parameterized complexity of configuration integer programs (Q2670456) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Multidimensional stable roommates with master list (Q2692267) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- Parametrized Complexity of Length-Bounded Cuts and Multi-cuts (Q2948489) (← links)
- (Q3304124) (← links)
- (Q4636646) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints (Q5053070) (← links)
- Target Set Selection in Dense Graph Classes (Q5062113) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- (Q5090494) (← links)
- (Q5091008) (← links)
- (Q5092394) (← links)
- (Q5111743) (← links)
- (Q5140719) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters (Q5875607) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set (Q5918533) (← links)
- Graph isomorphism restricted by lists (Q5918591) (← links)
- The clever shopper problem (Q5919456) (← links)
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set (Q5925624) (← links)
- High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
- Hedonic diversity games: a complexity picture with more than two colors (Q6067039) (← links)
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View (Q6068262) (← links)
- (Q6087208) (← links)
- Recognizing Proper Tree-Graphs (Q6089652) (← links)
- Maximizing Social Welfare in Score-Based Social Distance Games (Q6199615) (← links)
- On the complexity of target set selection in simple geometric networks (Q6606994) (← links)
