Pages that link to "Item:Q2354298"

The following pages link to Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems (Q2354298):

Displayed 15 items.

• An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) ‎ (← links)
• Kernelization and randomized parameterized algorithms for co-path set problem (Q328686) ‎ (← links)
• Partition on trees with supply and demand: kernelization and algorithms (Q507429) ‎ (← links)
• Improved kernel results for some FPT problems based on simple observations (Q507431) ‎ (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) ‎ (← links)
• On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) ‎ (← links)
• Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) ‎ (← links)
• An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) ‎ (← links)
• Kernels for packing and covering problems (Q2272393) ‎ (← links)
• Randomized parameterized algorithms for the kidney exchange problem (Q2632525) ‎ (← links)
• Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (Q2636502) ‎ (← links)
• A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) ‎ (← links)
• Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) ‎ (← links)
• Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) ‎ (← links)
• Approximating power node-deletion problems (Q6057334) ‎ (← links)