2 citations · 3 across the 3 of their papers we have counts for
5 papers
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…
Characterizations and Directed Path-Width of Sequence Digraphs
Frank Gurski, Carolin Rehs, Jochen Rethmann
Computing the directed path-width of a directed graph is an NP-hard problem. Even for digraphs of maximum semi-degree 3 the problem remains hard. We propose a decomposition of an i…
Knapsack Problems: A Parameterized Point of View
Carolin Albrecht, Frank Gurski, Jochen Rethmann +1
The knapsack problem (KP) is a very famous NP-hard problem in combinatorial optimization. Also its generalization to multiple dimensions named d-dimensional knapsack problem (d-KP)…
Integer Programming Models and Parameterized Algorithms for Controlling Palletizers
Frank Gurski, Jochen Rethmann, Egon Wanke
We study the combinatorial FIFO Stack-Up problem, where bins have to be stacked-up from conveyor belts onto pallets. Given k sequences of labeled bins and a positive integer p, the…
Complexity of the FIFO Stack-Up Problem
Frank Gurski, Jochen Rethmann, Egon Wanke
We study the combinatorial FIFO stack-up problem. In delivery industry, bins have to be stacked-up from conveyor belts onto pallets with respect to customer orders. Given k sequenc…