279 citations
- Heinrich Heine University DüsseldorfDE3 papers
- Ruhr University BochumDE3 papers
- Technical University of MunichDE3 papers
- Universidade Federal do AmazonasBR3 papers
- University of StuttgartDE3 papers
- California State University, Long BeachUS2 papers
- Karlstad UniversitySE2 papers
- Lawrence Berkeley National LaboratoryUS2 papers
- National Superconducting Cyclotron LaboratoryUS2 papers
- Politecnico di TorinoIT2 papers
- Pontifícia Universidade Católica do Rio Grande do SulBR2 papers
- Queen's University BelfastGB2 papers
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
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…
cs.DS2015★ 1 cited
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…