Meta-kernelization using well-structured modulators (Q2413976): Difference between revisions

@@ Property / cites work @@
+A kernelization algorithm for \(d\)-hitting set
@@ Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank @@
+Normal rank
@@ Property / cites work @@
+Solving MAX-\(r\)-SAT above a tight lower bound
@@ Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / rank @@
+Normal rank
@@ Property / cites work @@
+An algebraic theory of graph reduction
@@ Property / cites work: An algebraic theory of graph reduction / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel bounds for path and cycle problems
@@ Property / cites work: Kernel bounds for path and cycle problems / rank @@
+Normal rank
@@ Property / cites work @@
+Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
+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 @@
+The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Meta-kernelization using Well-structured Modulators
+Normal rank
@@ Property / cites work @@
+Solving Problems on Graphs of High Rank-Width
@@ Property / cites work: Solving Problems on Graphs of High Rank-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Preprocessing subgraph and minor problems: when does a small vertex cover help?
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization using structural parameters on sparse graph classes
+Normal rank
@@ Property / cites work @@
+On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
+Normal rank
@@ Property / cites work @@
+Meta-kernelization with structural parameters
@@ Property / cites work: Meta-kernelization with structural parameters / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Branch-Decompositions and Rank-Decompositions
+Normal rank
@@ Property / cites work @@
+Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
+Normal rank
@@ Property / cites work @@
+Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+A 4             <i>k</i>             <sup>2</sup>             kernel for feedback vertex set
+Normal rank