A Problem Kernelization for Graph Packing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485524 (Why is no real title available?)
- scientific article; zbMATH DE number 2011853 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Cubic Kernel for Feedback Vertex Set
- A More Effective Linear Kernelization for Cluster Editing
- A Parameterized Perspective on Packing Paths of Length Two
- An Improved Parameterized Algorithm for a Generalized Matching Problem
- An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
- Applying modular decomposition to parameterized cluster editing problems
- Divide-and-Color
- Efficient Parameterized Preprocessing for Cluster Editing
- Faster Algebraic Algorithms for Path and Packing Problems
- Faster fixed-parameter tractable algorithms for matching and packing problems
- Graph-Theoretic Concepts in Computer Science
- Graph-modeled data clustering: Exact algorithms for clique generation
- Improved Parameterized Algorithms for Weighted 3-Set Packing
- Improved algorithms for path, matching, and packing problems
- Kernelization Algorithms for d-Hitting Set Problems
- Looking at the stars
- On Problems without Polynomial Kernels (Extended Abstract)
- On the completeness of a generalized matching problem
- Packing triangles in low degree graphs and indifference graphs
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
- Vertex cover: Further observations and further improvements
- Vertex packings: Structural properties and algorithms
Cited in
(34)- Kernelization for edge triangle packing and covering via a discharging method
- Edge-disjoint packing of stars and cycles
- Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths
- Kernelization: new upper and lower bound techniques
- Parameterized and Exact Computation
- Parameterized and Exact Computation
- Packing paths: recycling saves time
- A kernelization algorithm for \(d\)-hitting set
- Looking at the stars
- Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
- Subquadratic kernels for implicit 3-hitting set and 3-set packing problems
- Planar graph vertex partition for linear problem kernels
- Parameterized complexity of vertex deletion into perfect graph classes
- Stronger bounds and faster algorithms for packing in generalized kernel systems
- Towards optimal kernel for edge-disjoint triangle packing
- A parameterized perspective on packing paths of length two
- A \(5k\)-vertex kernel for \(P_2\)-packing
- An improved kernelization algorithm for \(r\)-set packing
- An improved kernel for planar vertex-disjoint triangle packing
- Parameterized complexity of induced graph matching on claw-free graphs
- Graph-Theoretic Concepts in Computer Science
- Using parametric transformations toward polynomial kernels for packing problems allowing overlaps
- Maximum 0-1 timed matching on temporal graphs
- Approximate Turing kernelization for problems parameterized by treewidth
- Explicit linear kernels for packing problems
- Subquadratic kernels for implicit 3-{\textsc{Hitting Set}} and 3-{\textsc{Set Packing}} problems
- Kernelization of packing problems
- Edge-disjoint packing of stars and cycles
- Kernelization algorithms for packing problems allowing overlaps
- Arbitrary overlap constraints in graph packing problems
- On generating triangle-free graphs
- Kernels for packing and covering problems
- Kernels for Packing and Covering Problems
- Triangle packing in (sparse) tournaments: approximation and kernelization
This page was built for publication: A Problem Kernelization for Graph Packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599088)
