Pages that link to "Item:Q1759683"

The following pages link to An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683):

Displaying 9 items.

• On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
• Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
• Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
• Faster algorithm for pathwidth one vertex deletion (Q2140570) (← links)
• An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
• A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion (Q2802923) (← links)
• An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion (Q5363767) (← links)
• Smaller kernels for two vertex deletion problems (Q6551719) (← links)
• Parameterized complexity of vertex splitting to pathwidth at most 1 (Q6639742) (← links)