The following pages link to Proper interval vertex deletion (Q1949742):
Displaying 18 items.
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
- Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs (Q2828227) (← links)
- (Q5045920) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
- Vertex deletion into bipartite permutation graphs (Q6068239) (← links)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Modification problems toward proper (Helly) circular-arc graphs (Q6647753) (← links)
