Pages that link to "Item:Q3599088"

The following pages link to A Problem Kernelization for Graph Packing (Q3599088):

Displaying 24 items.

• Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths (Q264204) (← links)
• Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
• Planar graph vertex partition for linear problem kernels (Q355502) (← links)
• Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
• An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
• A parameterized perspective on packing paths of length two (Q849135) (← links)
• A kernelization algorithm for \(d\)-hitting set (Q988567) (← links)
• Explicit linear kernels for packing problems (Q1739112) (← links)
• A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
• Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• Packing paths: recycling saves time (Q2446295) (← links)
• Edge-disjoint packing of stars and cycles (Q2629232) (← links)
• An improved kernel for planar vertex-disjoint triangle packing (Q2672577) (← links)
• Using parametric transformations toward polynomial kernels for packing problems allowing overlaps (Q2828236) (← links)
• On generating triangle-free graphs (Q2839211) (← links)
• Kernels for Packing and Covering Problems (Q2897995) (← links)
• Kernelization Algorithms for Packing Problems Allowing Overlaps (Q2948487) (← links)
• Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
• Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
• Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
• Arbitrary Overlap Constraints in Graph Packing Problems (Q4639933) (← links)
• Triangle packing in (sparse) tournaments: approximation and kernelization (Q5111699) (← links)
• (Q5743378) (← links)