Pages that link to "Item:Q2988857"

The following pages link to Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857):

Displaying 13 items.

• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← 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)
• A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• Algorithm for online 3-path vertex cover (Q2300630) (← links)
• Parameterized algorithm for 3-path vertex cover (Q2317858) (← 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)
• (Q5009486) (← links)
• (Q5092393) (← links)
• (Q5225203) (← links)
• A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)