Pages that link to "Item:Q2408197"

The following pages link to An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197):

Displaying 8 items.

• Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
• An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683) (← links)
• Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
• A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion (Q2802923) (← links)
• Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
• An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion (Q5363767) (← links)
• A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)