Pages that link to "Item:Q3196407"

The following pages link to A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407):

Displaying 19 items.

• PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
• Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
• A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
• An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
• PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
• A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem (Q2008933) (← links)
• Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
• Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
• Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• Parameterized algorithm for 3-path vertex cover (Q2317858) (← links)
• Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
• On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
• An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} (Q2659056) (← links)
• Faster parameterized algorithms for two vertex deletion problems (Q2699960) (← links)
• A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
• A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)