A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion

Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationLATIN 2024
Subtitle of host publicationTheoretical Informatics - 16th Latin American Symposium, 2024, Proceedings
EditorsJosé A. Soto, Andreas Wiese
PublisherSpringer Science and Business Media Deutschland GmbH
Pages208-222
Number of pages15
ISBN (Print)9783031556005
DOIs
StatePublished - 1 Jan 2024
Externally publishedYes
Event16th Latin American Symposium on Theoretical Informatics, LATIN 2042 - Puerto Varas, Chile
Duration: 18 Mar 202422 Mar 2024

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14579 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th Latin American Symposium on Theoretical Informatics, LATIN 2042
Country/TerritoryChile
CityPuerto Varas
Period18/03/2422/03/24

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion'. Together they form a unique fingerprint.

Cite this