Pages that link to "Item:Q4962179"
From MaRDI portal
The following pages link to Interval Deletion Is Fixed-Parameter Tractable (Q4962179):
Displaying 27 items.
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Faster FPT algorithms for deletion to pairs of graph classes (Q2140510) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Quick but odd growth of cacti (Q2408205) (← links)
- Reducing Rank of the Adjacency Matrix by Graph Modification (Q3196399) (← links)
- Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- (Q5136298) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- (Q5874519) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- (Q6065472) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
- Modification problems toward proper (Helly) circular-arc graphs (Q6647753) (← links)
