No. Title Author Year
1 A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width Jaffke, Lars et al. 2018
2 Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms Bonnet, Édouard et al. 2018
3 Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width Jaffke, Lars et al. 2018
4 Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs Eickmeyer, Kord et al. 2017
5 A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Eiben, Eduard et al. 2016
6 A Polynomial Kernel for Block Graph Deletion Kim, Eun Jung et al. 2015
7 An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion Kanté, Mamadou Moustapha et al. 2015
8 Excluded vertex-minors for graphs of linear rank-width at most k. Jeong, Jisu et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 8


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI