Pages that link to "Item:Q515577"

The following pages link to Unit interval editing is fixed-parameter tractable (Q515577):

Displaying 19 items.

• Chordal editing is fixed-parameter tractable (Q300460) (← links)
• Unit interval editing is fixed-parameter tractable (Q515577) (← links)
• Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
• Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
• Vertex deletion problems on chordal graphs (Q1786595) (← links)
• Paths to trees and cacti (Q1998842) (← links)
• Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
• Linear-time minimal cograph editing (Q2140496) (← links)
• Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
• An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
• Quick but odd growth of cacti (Q2408205) (← links)
• (Q3448794) (redirect page) (← links)
• Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
• Paths to Trees and Cacti (Q5283353) (← links)
• (Q5874519) (← links)
• The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
• Vertex deletion into bipartite permutation graphs (Q6068239) (← links)
• On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)