Pages that link to "Item:Q2897995"

The following pages link to Kernels for Packing and Covering Problems (Q2897995):

Displaying 11 items.

• An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
• Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← 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)
• 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 \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)