Knapsack Problems: A Parameterized Point of View. - Carolin Albrecht; Frank Gurski; Jochen Rethmann; Eda Yilmaz (CoRR, 2016)

A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time. - Carolin Rehs; Frank Gurski (OR, 2017)

Counting and Enumerating Independent Sets with Applications to Knapsack Problems. - Frank Gurski; Carolin Rehs (CoRR, 2017)

Directed Path-Width of Sequence Digraphs. - Frank Gurski; Carolin Rehs; Jochen Rethmann (COCOA, 2018)

Directed Path-Width and Directed Tree-Width of Directed Co-graphs. - Frank Gurski; Carolin Rehs (COCOON, 2018)

The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width. - Frank Gurski; Carolin Rehs (OR, 2018)

Computing directed path-width and directed tree-width of recursively defined digraphs. - Frank Gurski; Carolin Rehs (CoRR, 2018)

Characterizations for Special Directed Co-graphs. - Frank Gurski; Dominique Komander; Carolin Rehs (COCOA, 2019)

Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract). - Frank Gurski; Dominique Komander; Carolin Rehs (FCT, 2019)

Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes. - Frank Gurski; Stefan Hoffmann 002; Dominique Komander; Carolin Rehs; Jochen Rethmann; Egon Wanke (OR, 2019)

Subset Sum Problems with Special Digraph Constraints. - Frank Gurski; Dominique Komander; Carolin Rehs (OR, 2019)

Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs. - Frank Gurski; Carolin Rehs (SOFSEM, 2019)

Oriented Coloring on Recursively Defined Digraphs. - Frank Gurski; Dominique Komander; Carolin Rehs (Algorithms, 2019)

Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width. - Frank Gurski; Carolin Rehs (Math. Methods Oper. Res., 2019)

Comparing Linear Width Parameters for Directed Graphs. - Frank Gurski; Carolin Rehs (Theory Comput. Syst., 2019)

Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms. - Frank Gurski; Carolin Rehs; Jochen Rethmann; Egon Wanke (OR Spectr., 2019)

Knapsack problems: A parameterized point of view. - Frank Gurski; Carolin Rehs; Jochen Rethmann (Theor. Comput. Sci., 2019)

On the hardness of palletizing bins using FIFO queues. - Frank Gurski; Carolin Rehs; Jochen Rethmann (Theor. Comput. Sci., 2019)

A Timecop's Work Is Harder Than You Think. - Nils Morawietz; Carolin Rehs; Mathias Weller (MFCS, 2020)

Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract). - Frank Gurski; Stefan Hoffmann 002; Dominique Komander; Carolin Rehs; Jochen Rethmann; Egon Wanke (SOFSEM, 2020)

Acyclic coloring of special digraphs. - Frank Gurski; Dominique Komander; Carolin Rehs (CoRR, 2020)

Solutions for subset sum problems with special digraph constraints. - Frank Gurski; Dominique Komander; Carolin Rehs (Math. Methods Oper. Res., 2020)

Counting and enumerating independent sets with applications to combinatorial optimization problems. - Frank Gurski; Carolin Rehs (Math. Methods Oper. Res., 2020)

Acyclic Coloring Parameterized by Directed Clique-Width. - Frank Gurski; Dominique Komander; Carolin Rehs (CALDAM, 2021)

Directed Width Parameters on Semicomplete Digraphs. - Frank Gurski; Dominique Komander; Carolin Rehs; Sebastian Wiederrecht (COCOA, 2021)

On characterizations for subclasses of directed co-graphs. - Frank Gurski; Dominique Komander; Carolin Rehs (J. Comb. Optim., 2021)

How to compute digraph width measures on directed co-graphs. - Frank Gurski; Dominique Komander; Carolin Rehs (Theor. Comput. Sci., 2021)

Computing directed Steiner path covers. - Frank Gurski; Dominique Komander; Carolin Rehs; Jochen Rethmann; Egon Wanke (J. Comb. Optim., 2022)

Correction to: Solutions for subset sum problems with special digraph constraints. - Frank Gurski; Dominique Komander; Carolin Rehs (Math. Methods Oper. Res., 2022)

Comparing and Computing Parameters for Directed Graphs. - Carolin Rehs (2022)

Oriented Spanners. - Kevin Buchin; Joachim Gudmundsson; Antonia Kalb; Aleksandr Popov 001; Carolin Rehs; André van Renssen; Sampson Wong (ESA, 2023)

Characterizations and Directed Path-Width of Sequence Digraphs. - Frank Gurski; Carolin Rehs; Jochen Rethmann (Theory Comput. Syst., 2023)

Twin-distance-hereditary digraphs. - Dominique Komander; Carolin Rehs (Theor. Comput. Sci., 2023)

Experimental analysis of oriented spanners on one-dimensional point sets. - Antonia Kalb; Kevin Buchin; Carolin Rehs; Guangping Li 001 (CCCG, 2024)

Computing Oriented Spanners and Their Dilation. - Kevin Buchin; Antonia Kalb; Anil Maheshwari; Saeed Odak; Carolin Rehs; Michiel Smid; Sampson Wong (SoCG, 2025)

Geometric Spanners of Bounded Tree-Width. - Kevin Buchin; Carolin Rehs; Torben Scheele (SoCG, 2025)

Orienteering (with Time Windows) on Restricted Graph Classes. - Kevin Buchin; Mart Hagedoorn; Guangping Li 001; Carolin Rehs (SOFSEM (1), 2025)