@inproceedings{f9e1f1edf96c45f6904dde62de3217d6,

title = "A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion",

abstract = "A proper Helly circular-arc graph is an intersection graph of a set of arcs on a circle such that none of the arcs properly contains any other arc and every set of pairwise intersecting arcs has a common intersection. The Proper Helly Circular-arc Vertex Deletion problem takes as input a graph G and an integer k, and the goal is to check if we can remove at most k vertices from the graph to obtain a proper Helly circular-arc graph; the parameter is k. Recently, Cao et al. [MFCS 2023] obtained an FPT algorithm for this (and related) problem. In this work, we obtain a polynomial kernel for the problem.",

author = "Akanksha Agrawal and Satyabrata Jana and Abhishek Sahu",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.; 16th Latin American Symposium on Theoretical Informatics, LATIN 2042 ; Conference date: 18-03-2024 Through 22-03-2024",

year = "2024",

month = jan,

day = "1",

doi = "10.1007/978-3-031-55601-2_14",

language = "English",

isbn = "9783031556005",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "208--222",

editor = "Soto, {Jos{\'e} A.} and Andreas Wiese",

booktitle = "LATIN 2024",

address = "Germany",

}