TY - GEN
T1 - Distance from Triviality 2.0
T2 - 33rd International Workshop on Combinatorial Algorithms, IWOCA 2022
AU - Agrawal, Akanksha
AU - Ramanujan, M. S.
N1 - Publisher Copyright:
© 2022, Springer Nature Switzerland AG.
PY - 2022/1/1
Y1 - 2022/1/1
N2 - 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.
AB - 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.
KW - Elimination distance
KW - H -treewidth
KW - Parameterized Complexity
KW - Vertex deletion
UR - http://www.scopus.com/inward/record.url?scp=85131930627&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-06678-8_1
DO - 10.1007/978-3-031-06678-8_1
M3 - Conference contribution
AN - SCOPUS:85131930627
SN - 9783031066771
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 3
EP - 20
BT - Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Proceedings
A2 - Bazgan, Cristina
A2 - Fernau, Henning
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 7 June 2022 through 9 June 2022
ER -