Pages that link to "Item:Q2897995"
From MaRDI portal
The following pages link to Kernels for Packing and Covering Problems (Q2897995):
Displaying 17 items.
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
- An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
- An improved kernelization for \(P_{2}\)-packing (Q991748) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- Using parametric transformations toward polynomial kernels for packing problems allowing overlaps (Q2828236) (← links)
- On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility (Q2849354) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
- A Quadratic Kernel for 3-Set Packing (Q3630192) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
