No. Title Author Year
1 Typical Sequences Revisited - Computing Width Parameters of Graphs Bodlaender, Hans L. et al. 2020
2 A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs Jaffke, Lars et al. 2019
3 Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width Jaffke, Lars et al. 2019
4 A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width Jaffke, Lars et al. 2018
5 Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width Jaffke, Lars et al. 2018
6 Definability Equals Recognizability for k-Outerplanar Graphs Jaffke, Lars et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 6


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