„kernelization“
Suchergebnisse
210 Treffer
-
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts
-
Lossy Kernels for Graph Contraction Problems
-
Structural Parameterizations of Feedback Vertex Set
-
Treedepth Parameterized by Vertex Cover Number
-
Hardness of Approximation for H-Free Edge Modification Problems
-
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials
-
A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
-
Kernelization of Cycle Packing with Relaxed Disjointness Constraints
-
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems
-
Graph Motif Problems Parameterized by Dual
-
Crossing Number is Hard for Kernelization
-
A Randomized Polynomial Kernel for Subset Feedback Vertex Set
-
The Parameterized Complexity of the Minimum Shared Edges Problem
-
On Kernelization and Approximation for the Vector Connectivity Problem
-
Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion
-
Linear Kernels for Outbranching Problems in Sparse Digraphs
-
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
-
Parameterized and Approximation Algorithms for the Load Coloring Problem
-
Bidimensionality and Parameterized Algorithms (Invited Talk)
-
Partially Polynomial Kernels for Set Cover and Test Cover