Talks and Poster Presentations (with Proceedings-Entry):
E. Eiben, R. Ganian, O. Kwon:
"A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion";
Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS),
- 2016-08-26; in: "Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science",
Vertex deletion problems ask whether it is possible to delete at most k vertices from a graph so that the resulting graph belongs to a specified graph class. Over the past years, the parameterized complexity of vertex deletion to a plethora of graph classes has been systematically researched. Here we present the first single-exponential fixed-parameter algorithm for vertex deletion to distance-hereditary graphs, a well-studied graph class which is particularly important in the context of vertex deletion due to its connection to the graph parameter rank-width. We complement our result with matching asymptotic lower bounds based on the exponential time hypothesis.
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.