An improved kernel for planar vertex-disjoint triangle packing
From MaRDI portal
Publication:2672577
DOI10.1016/j.tcs.2022.04.017OpenAlexW4224441383MaRDI QIDQ2672577
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.017
Cites Work
- Unnamed Item
- Unnamed Item
- Kernel bounds for disjoint cycles and disjoint paths
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing
- Planar vertex-disjoint cycle packing: new structures and improved kernel
- Packing cycles through prescribed vertices
- Partition into triangles on bounded degree graphs
- Narrow sieves for parameterized paths and packings
- Towards optimal kernel for edge-disjoint triangle packing
- Approximating the $$k$$-Set Packing Problem by Local Improvements
- A Problem Kernelization for Graph Packing
- A Quadratic Kernel for 3-Set Packing
- Approximation algorithms for NP-complete problems on planar graphs
- Parameterized and Exact Computation
- Linear Problem Kernels for NP-Hard Problems on Planar Graphs
- How to Sell Hyperedges: The Hypermatching Assignment Problem