Proper interval vertex deletion
type: Item
instance of: scholarly article
title: Proper interval vertex deletion
zbMATH Open document ID: 1262.68052
author: Pim Van 't Hof
author: Yngve Villanger
published in: Algorithmica
publication date: 2013-05-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6163648
zbMATH Keywords: proper interval graphs
zbMATH Keywords: proper circular arc graphs
zbMATH Keywords: vertex deletion
zbMATH Keywords: FPT algorithms
MaRDI profile type: Publication
full work available at URL: s00453-012-9661-3
OpenAlex ID: W2131274579
cites work: On linear and circular structure of (claw, net)-free graphs
cites work: Graph Classes: A Survey
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: On Feedback Vertex Set New Measure and New Structures
cites work: Improved upper bounds for vertex cover
cites work: Q4385531
cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
cites work: Q3328583
cites work: Q3216686
cites work: Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
cites work: Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
cites work: Q3549636
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Wheel-Free Deletion Is W[2]-Hard
cites work: Chordal deletion is fixed-parameter tractable
cites work: Obtaining a planar graph by vertex deletion
cites work: Q5588432
cites work: Call routing and the ratcatcher
cites work: Structure theorems for some circular-arc graphs
cites work: Measuring Indifference: Unit Interval Vertex Deletion
cites work: Interval Completion Is Fixed Parameter Tractable
cites work: Edge-Deletion Problems
cites work: Computing the Minimum Fill-In is NP-Complete
DOI: 10.1007/S00453-012-9661-3
description: scientific article; zbMATH DE number 6163648