9 citations · 9 across the 3 of their papers we have counts for
7 papers
Efficient computation of oriented vertex and arc colorings of special digraphs
Frank Gurski, Dominique Komander, Marvin Lindemann
In this paper we study the oriented vertex and arc coloring problem on edge series-parallel digraphs (esp-digraphs) which are related to the well known series-parallel graphs. Seri…
Computing Directed Steiner Path Covers
Frank Gurski, Dominique Komander, Carolin Rehs +2
In this article we consider the Directed Steiner Path Cover problem on directed co-graphs. Given a directed graph G=(V,E) and a subset T of V of so-called terminal vertices, the pr…
Efficient computation of the oriented chromatic number of recursively defined digraphs
Frank Gurski, Dominique Komander, Marvin Lindemann
In this paper we consider colorings of oriented graphs, i.e. digraphs without cycles of length 2. Given some oriented graph , an oriented -coloring for is a partiti…
Acyclic coloring of special digraphs
Frank Gurski, Dominique Komander, Carolin Rehs
An acyclic r-coloring of a directed graph G=(V,E) is a partition of the vertex set V into r acyclic sets. The dichromatic number of a directed graph G is the smallest r such that G…
Solutions for Subset Sum Problems with Special Digraph Constraints
Frank Gurski, Dominique Komander, Carolin Rehs
The subset sum problem is one of the simplest and most fundamental NP-hard problems in combinatorial optimization. We consider two extensions of this problem: The subset sum proble…
On Characterizations for Subclasses of Directed Co-Graphs
Frank Gurski, Dominique Komander, Carolin Rehs
Undirected co-graphs are those graphs which can be generated from the single vertex graph by disjoint union and join operations. Co-graphs are exactly the P_4-free graphs (where P_…