Proper interval vertex deletion
From MaRDI portal
Publication:1949742
DOI10.1007/S00453-012-9661-3zbMATH Open1262.68052OpenAlexW2131274579MaRDI QIDQ1949742FDOQ1949742
Yngve Villanger, Pim Van 't Hof
Publication date: 16 May 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9661-3
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Graph Classes: A Survey
- The node-deletion problem for hereditary properties is NP-complete
- Call routing and the ratcatcher
- On Feedback Vertex Set New Measure and New Structures
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Representation of a finite graph by a set of intervals on the real line
- Improved upper bounds for vertex cover
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Computing the Minimum Fill-In is NP-Complete
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- Chordal deletion is fixed-parameter tractable
- Structure theorems for some circular-arc graphs
- Obtaining a planar graph by vertex deletion
- Interval Completion Is Fixed Parameter Tractable
- Edge-Deletion Problems
- Measuring Indifference: Unit Interval Vertex Deletion
- On linear and circular structure of (claw, net)-free graphs
- Wheel-Free Deletion Is W[2]-Hard
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
Cited In (19)
- A faster FPT algorithm for bipartite contraction
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- Sublinear approximation algorithms for boxicity and related problems
- Unit interval vertex deletion: fewer vertices are relevant
- Faster algorithms for vertex partitioning problems parameterized by clique-width
- Unit interval editing is fixed-parameter tractable
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes
- A survey of parameterized algorithms and the complexity of edge modification
- Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
- Declawing a graph: polyhedra and branch-and-cut algorithms
- Vertex deletion into bipartite permutation graphs
- Proper Interval Vertex Deletion
- The parameterized complexity of cycle packing: indifference is not an issue
- Modification problems toward proper (Helly) circular-arc graphs
- Title not available (Why is that?)
- 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
- Vertex deletion into bipartite permutation graphs
- Contracting graphs to paths and trees
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)
