A polynomial kernel for proper Helly circular-arc vertex deletion
From MaRDI portal
Publication:6547958
DOI10.1007/978-3-031-55601-2_14MaRDI QIDQ6547958
Akanksha Agrawal, Abhishek Sahu, Satyabrata Jana
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Fundamentals of parameterized complexity
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
- Chordal deletion is fixed-parameter tractable
- On problems without polynomial kernels
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Linear-time recognition of circular-arc graphs
- Unit interval vertex deletion: fewer vertices are relevant
- Normal Helly circular-arc graphs and its subclasses
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
- Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
- Interval Vertex Deletion Admits a Polynomial Kernel
- A Polynomial Kernel for Proper Interval Vertex Deletion
- Parameterized Algorithms
- The parameterized complexity of cycle packing: indifference is not an issue
- Modification problems toward proper (Helly) circular-arc graphs
This page was built for publication: A polynomial kernel for proper Helly circular-arc vertex deletion
