A polynomial kernel for proper interval vertex deletion

Authors:
Fedor V. Fomin;Saket Saurabh;Yngve Villanger
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway;The Institute of Mathematical Sciences, Chennai, India;Department of Informatics, University of Bergen, Bergen, Norway
Venue:
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Year:
2012

Citing 9
Cited 1

An optimal greedy heuristic to color interval graphs

Information Processing Letters
Fixed-parameter tractability of graph modification problems for hereditary properties

Information Processing Letters
Graph classes: a survey

Graph classes: a survey
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction

Theoretical Computer Science - Parameterized and exact computation
Chordal Deletion is Fixed-Parameter Tractable

Algorithmica
Measuring indifference: unit interval vertex deletion

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Polynomial Kernelizations for MIN F+Π1 and MAX NP

Algorithmica
Parameterized Complexity

Parameterized Complexity

Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that the problem of deleting at most k vertices to obtain a proper interval graph (Proper Interval Vertex Deletion) is fixed parameter tractable. However, whether the problem admits a polynomial kernel or not was open. Here, we answer this question in affirmative by obtaining a polynomial kernel for Proper Interval Vertex Deletion. This resolves an open question of van Bevern, Komusiewicz, Moser, and Niedermeier.