Optimal data reduction for graph coloring using low-degree polynomials (Q2272594): Difference between revisions

@@ Property / arXiv ID @@
+.02050
@@ Property / arXiv ID: 1802.02050 / 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 @@
+How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs
+Normal rank
@@ Property / cites work @@
+List H-coloring a graph by removing few vertices
@@ Property / cites work: List H-coloring a graph by removing few vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743378
@@ Property / cites work: Q5743378 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of coloring problems: treewidth versus vertex cover
+Normal rank
@@ Property / cites work @@
+Q3455032
@@ Property / cites work: Q3455032 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Smaller Parameters for Vertex Cover Kernelization
@@ Property / cites work: Smaller Parameters for Vertex Cover Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
+Normal rank
@@ Property / cites work @@
+Data reduction for graph coloring problems
@@ Property / cites work: Data reduction for graph coloring problems / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials
+Normal rank
@@ Property / cites work @@
+Sparsification upper and lower bounds for graph problems and not-all-equal SAT
+Normal rank
@@ Property / cites work @@
+Point Line Cover
@@ Property / cites work: Point Line Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient graph representations
@@ Property / cites work: Efficient graph representations / rank @@
+Normal rank