No. Title Author Year
1 A Unifying Framework for Characterizing and Computing Width Measures Eiben, Eduard et al. 2022
2 Classes of Intersection Digraphs with Good Algorithmic Properties Jaffke, Lars et al. 2022
3 Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k Kanté, Mamadou Moustapha et al. 2022
4 A Polynomial Kernel for 3-Leaf Power Deletion Ahn, Jungho et al. 2020
5 Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth Bergougnoux, Benjamin et al. 2020
6 Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width Jaffke, Lars et al. 2019
7 Lean Tree-Cut Decompositions: Obstructions and Algorithms Giannopoulou, Archontia C. et al. 2019
8 Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth Eiben, Eduard et al. 2019
9 A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width Jaffke, Lars et al. 2018
10 Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms Bonnet, Édouard et al. 2018
11 Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width Jaffke, Lars et al. 2018
12 Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs Eickmeyer, Kord et al. 2017
13 A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Eiben, Eduard et al. 2016
14 A Polynomial Kernel for Block Graph Deletion Kim, Eun Jung et al. 2015
15 An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion Kanté, Mamadou Moustapha et al. 2015
16 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: 16

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