Dual parameterization of weighted coloring (Q786042): Difference between revisions

@@ Property / cites work @@
+Ruling out FPT algorithms for weighted coloring on forests
+Normal rank
@@ Property / cites work @@
+Weighted Coloring in Trees
@@ Property / cites work: Weighted Coloring in Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Partially Polynomial Kernels for Set Cover and Test Cover
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel bounds for disjoint cycles and disjoint paths
+Normal rank
@@ Property / cites work @@
+Dual parameterization and parameterized approximability of subset graph problems
+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 @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
+Normal rank
@@ Property / cites work @@
+Q4414490
@@ Property / cites work: Q4414490 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation results for the minimum graph coloring problem
+Normal rank
@@ Property / cites work @@
+Q3586724
@@ Property / cites work: Q3586724 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds Through Colors and IDs
@@ Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526990
@@ Property / cites work: Q4526990 / rank @@
+Normal rank
@@ Property / cites work @@
+Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results
+Normal rank
@@ Property / cites work @@
+Weighted coloring: further complexity and approximability results
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+A coloring problem for weighted graphs
@@ Property / cites work: A coloring problem for weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
+Normal rank
@@ Property / cites work @@
+Q4886045
@@ Property / cites work: Q4886045 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating k-set cover and complementary graph coloring
+Normal rank
@@ Property / cites work @@
+Maximizing the number of unused colors in the vertex coloring problem
+Normal rank
@@ Property / cites work @@
+On the Grundy and \(b\)-chromatic numbers of a graph
+Normal rank
@@ Property / cites work @@
+Q5743381
@@ Property / cites work: Q5743381 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Max-coloring paths: tight bounds and extensions
@@ Property / cites work: Max-coloring paths: tight bounds and extensions / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the complexity of the chromatic number problem
+Normal rank
@@ Property / cites work @@
+Normal Helly circular-arc graphs and its subclasses
+Normal rank
@@ Property / cites work @@
+Characterizations and recognition of circular-arc graphs and subclasses: a survey
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating interval coloring and max-coloring in chordal graphs
+Normal rank
@@ Property / cites work @@
+Matrix characterizations of circular-arc graphs
@@ Property / cites work: Matrix characterizations of circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some consequences of non-uniform conditions on uniform classes
+Normal rank