A polynomial kernel for \textsc{Proper Interval Vertex Deletion}
DOI10.1007/978-3-642-33090-2_41zbMATH Open1366.68092OpenAlexW83583913WikidataQ60488453 ScholiaQ60488453MaRDI QIDQ2912866FDOQ2912866
Authors: Fedor V. Fomin, Saket Saurabh, Yngve Villanger 
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (15)
- Polynomial kernels for proper interval completion and related problems
- Unit interval vertex deletion: fewer vertices are relevant
- Proper interval vertex deletion
- Interval vertex deletion admits a polynomial kernel
- 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
- Interval deletion is fixed-parameter tractable
- A polynomial kernel for block graph deletion
- Polynomial kernels for proper interval completion and related problems
- A polynomial kernel for bipartite permutation vertex deletion
- Interval deletion is fixed-parameter tractable
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)
