Distance from Triviality 2.0: Hybrid Parameterizations

Akanksha Agrawal, M. S. Ramanujan

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

1 Scopus citations

Abstract

Vertex deletion problems have been at the heart of numerous major advances in Algorithms and Combinatorial Optimization, and especially so in the area of Parameterized Complexity. For a family of graphs H, the input to Vertex Deletion to H is a graph G and an integer k, and the objective is to decide whether there is a vertex-subset, called a modulator, whose removal from G results in a graph contained in the family H, and such that | S| ≤ k. Traditionally, the majority of the study of Vertex Deletion to H problems in Parameterized Complexity has been limited to parameterization by modulator size and structural graph width measures of the input graph such as treewidth. Recent years have seen systematic efforts at: i) quantifying the complexity of modulators in ways other than their size, and ii) studying the complexity landscape of various graph problems under parameterizations that are simultaneously better than both the modulator size and certain width measures of the graph. In this talk we will look at some exciting developments in this direction in relation to two such parameters that are “hybridizations” of the modulator size, and the well-explored graph parameters – treewidth and treedepth.

Original languageEnglish
Title of host publicationCombinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Proceedings
EditorsCristina Bazgan, Henning Fernau
PublisherSpringer Science and Business Media Deutschland GmbH
Pages3-20
Number of pages18
ISBN (Print)9783031066771
DOIs
StatePublished - 1 Jan 2022
Externally publishedYes
Event33rd International Workshop on Combinatorial Algorithms, IWOCA 2022 - Trier, Germany
Duration: 7 Jun 20229 Jun 2022

Publication series

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

Conference

Conference33rd International Workshop on Combinatorial Algorithms, IWOCA 2022
Country/TerritoryGermany
CityTrier
Period7/06/229/06/22

Keywords

  • Elimination distance
  • H -treewidth
  • Parameterized Complexity
  • Vertex deletion

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Distance from Triviality 2.0: Hybrid Parameterizations'. Together they form a unique fingerprint.

Cite this