A polynomial kernel for proper Helly circular-arc vertex deletion

DOI10.1007/978-3-031-55601-2_14MaRDI QIDQ6547958zbMATH OpenFDO

Authors Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu

Publication date 31 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

Cites work

• Q3328583 scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• A Polynomial Kernel for Proper Interval Vertex Deletion
• Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
• Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Chordal deletion is fixed-parameter tractable
• Feedback vertex set inspired kernel for chordal vertex deletion
• Fundamentals of parameterized complexity
• Interval vertex deletion admits a polynomial kernel
• Linear-time recognition of circular-arc graphs
• Modification problems toward proper (Helly) circular-arc graphs
• Normal Helly circular-arc graphs and its subclasses
• On problems without polynomial kernels
• Parameterized algorithms
• Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
• The parameterized complexity of cycle packing: indifference is not an issue
• Unit interval vertex deletion: fewer vertices are relevant

This page was built for publication: A polynomial kernel for proper Helly circular-arc vertex deletion

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