Proper interval vertex deletion
From MaRDI portal
Recommendations
Cites work
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Call routing and the ratcatcher
- Chordal deletion is fixed-parameter tractable
- Computing the Minimum Fill-In is NP-Complete
- Edge-Deletion Problems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Graph Classes: A Survey
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Improved upper bounds for vertex cover
- Interval Completion Is Fixed Parameter Tractable
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Measuring indifference: unit interval vertex deletion
- Obtaining a planar graph by vertex deletion
- On feedback vertex set new measure and new structures
- On linear and circular structure of (claw, net)-free graphs
- Parameterized complexity of vertex deletion into perfect graph classes
- Representation of a finite graph by a set of intervals on the real line
- Structure theorems for some circular-arc graphs
- The node-deletion problem for hereditary properties is NP-complete
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- Wheel-Free Deletion Is W[2]-Hard
Cited in
(22)- Sublinear approximation algorithms for boxicity and related problems
- Unit interval vertex deletion: fewer vertices are relevant
- Declawing a graph: polyhedra and branch-and-cut algorithms
- Vertex deletion into bipartite permutation graphs
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
- Faster algorithms for vertex partitioning problems parameterized by clique-width
- Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
- A polynomial kernel for \textsc{Proper Interval Vertex Deletion}
- Proper Interval Vertex Deletion
- Interval deletion is fixed-parameter tractable
- scientific article; zbMATH DE number 7613130 (Why is no real title available?)
- Interval vertex deletion admits a polynomial kernel
- Interval deletion is fixed-parameter tractable
- The parameterized complexity of cycle packing: indifference is not an issue
- Vertex deletion into bipartite permutation graphs
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- A survey of parameterized algorithms and the complexity of edge modification
- Modification problems toward proper (Helly) circular-arc graphs
- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- Parameterized dynamic data structure for split completion
This page was built for publication: Proper interval vertex deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949742)
