No. Title Author Year
1 b-Coloring Parameterized by Clique-Width Jaffke, Lars et al. 2021
2 Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach Jaffke, Lars et al. 2020
3 Diverse Pairs of Matchings Fomin, Fedor V. et al. 2020
4 Structural Parameterizations of Clique Coloring Jaffke, Lars et al. 2020
5 Typical Sequences Revisited - Computing Width Parameters of Graphs Bodlaender, Hans L. et al. 2020
6 A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs Jaffke, Lars et al. 2019
7 Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width Jaffke, Lars et al. 2019
8 A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width Jaffke, Lars et al. 2018
9 Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width Jaffke, Lars et al. 2018
10 Definability Equals Recognizability for k-Outerplanar Graphs Jaffke, Lars et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 10


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