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 On the Hardness of Generalized Domination Problems Parameterized by Mim-Width Bakkane, Brage I. K. et al. 2022
4 Taming Graphs with No Large Creatures and Skinny Ladders Gajarsk√Ĺ, Jakub et al. 2022
5 XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure Bodlaender, Hans L. et al. 2022
6 b-Coloring Parameterized by Clique-Width Jaffke, Lars et al. 2021
7 Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach Jaffke, Lars et al. 2020
8 Diverse Pairs of Matchings Fomin, Fedor V. et al. 2020
9 Structural Parameterizations of Clique Coloring Jaffke, Lars et al. 2020
10 Typical Sequences Revisited - Computing Width Parameters of Graphs Bodlaender, Hans L. et al. 2020
11 A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs Jaffke, Lars et al. 2019
12 Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width Jaffke, Lars et al. 2019
13 A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width Jaffke, Lars et al. 2018
14 Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width Jaffke, Lars et al. 2018
15 Definability Equals Recognizability for k-Outerplanar Graphs Jaffke, Lars et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 15


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