Pages that link to "Item:Q2350905"

The following pages link to Faster parameterized algorithms for deletion to split graphs (Q2350905):

Displaying 20 items.

• Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
• On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
• PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
• Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
• A polynomial kernel for trivially perfect editing (Q1799208) (← links)
• Paths to trees and cacti (Q1998842) (← links)
• On the threshold of intractability (Q2051847) (← links)
• (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
• Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
• On the kernelization of split graph problems (Q2636501) (← links)
• Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
• A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
• Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
• Paths to Trees and Cacti (Q5283353) (← links)
• Quadratic vertex kernel for split vertex deletion (Q5896158) (← links)
• A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
• Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) (← 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)
• Parameterized complexity of the \(\mathcal{T}_{h+1} \)-free edge deletion problem (Q6546594) (← links)