Pages that link to "Item:Q1751231"

The following pages link to Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231):

Displaying 7 items.

• On the complexity of singly connected vertex deletion (Q2089067) (← links)
• Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
• Faster algorithm for pathwidth one vertex deletion (Q2140570) (← links)
• A polynomial kernel for funnel arc deletion set (Q2161012) (← links)
• Faster parameterized algorithm for pumpkin vertex deletion set (Q2414055) (← links)
• (Q5002795) (← links)
• A Polynomial Kernel for Funnel Arc Deletion Set. (Q6089658) (← links)