A polynomial kernel for \textsc{Proper Interval Vertex Deletion}

DOI10.1007/978-3-642-33090-2_41zbMATH Open1366.68092OpenAlexW83583913WikidataQ60488453 ScholiaQ60488453MaRDI QIDQ2912866FDOQ2912866

Fedor V. Fomin, Yngve Villanger, Saket Saurabh

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_41

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (8)

• A polynomial kernel for distance-hereditary vertex deletion
• A Polynomial Kernel for Proper Interval Vertex Deletion
• Proper Interval Vertex Deletion
• On Polynomial Kernelization of $$\mathcal {H}$$-free Edge Deletion
• Towards optimal and expressive kernelization for \(d\)-hitting set
• Polynomial Kernel for Interval Vertex Deletion
• A polynomial kernel for block graph deletion
• A polynomial kernel for bipartite permutation vertex deletion

   Recommendations

• A Polynomial Kernel for Proper Interval Vertex Deletion 👍 👎
• Proper interval vertex deletion 👍 👎
• Interval Vertex Deletion Admits a Polynomial Kernel 👍 👎
• Proper Interval Vertex Deletion 👍 👎
• Polynomial kernels for proper interval completion and related problems 👍 👎

This page was built for publication: A polynomial kernel for \textsc{Proper Interval Vertex Deletion}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912866)