Parameterized complexity of conflict-free set cover (Q5918356): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-020-10022-9
+Normal rank
@@ Property / OpenAlex ID @@
+W3119713976
@@ Property / OpenAlex ID: W3119713976 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5005155
@@ Property / cites work: Q5005155 / rank @@
+Normal rank
@@ Property / cites work @@
+Choice Is Hard
@@ Property / cites work: Choice Is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Selecting and covering colored points
@@ Property / cites work: Selecting and covering colored points / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-diameter covering problems
@@ Property / cites work: Minimum-diameter covering problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fréchet distance between a line and avatar point set
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of geometric covering problems having conflicts
+Normal rank
@@ Property / cites work @@
+On Problems as Hard as CNF-SAT
@@ Property / cites work: On Problems as Hard as CNF-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, trees and matchings under disjunctive constraints
+Normal rank
@@ Property / cites work @@
+Q3374865
@@ Property / cites work: Q3374865 / rank @@
+Normal rank
@@ Property / cites work @@
+Online variable-sized bin packing with conflicts
@@ Property / cites work: Online variable-sized bin packing with conflicts / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with conflicts: Online and offline algorithms
+Normal rank
@@ Property / cites work @@
+On diameters and radii of bridged graphs
@@ Property / cites work: On diameters and radii of bridged graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of conflict-free set cover
+Normal rank
@@ Property / cites work @@
+Conflict free version of covering problems on graphs: classical and parameterized
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomially bounded minimization problems which are hard to approximate
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754182
@@ Property / cites work: Q2754182 / rank @@
+Normal rank
@@ Property / cites work @@
+Slightly Superexponential Parameterized Problems
@@ Property / cites work: Slightly Superexponential Parameterized Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Truncation of Linear Matroids
@@ Property / cites work: Deterministic Truncation of Linear Matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
+Normal rank
@@ Property / cites work @@
+A parameterized view on matroid optimization problems
+Normal rank
@@ Property / cites work @@
+Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs.
+Normal rank
@@ Property / cites work @@
+On nowhere dense graphs
@@ Property / cites work: On nowhere dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5484515
@@ Property / cites work: Q5484515 / rank @@
+Normal rank
@@ Property / cites work @@
+The Maximum Flow Problem with Conflict and Forcing Conditions
+Normal rank
@@ Property / cites work @@
+Approximation of knapsack problems with conflict and forcing graphs
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for maximum-profit facility location under matroid constraints
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5918356