Carolin Rehs

Publication Activity (10 Years)

Years Active: 2017-2023
Publications (10 Years): 39

Top Topics

Knapsack Problem

Combinatorial Optimization

Top Venues

Math. Methods Oper. Res.

Theor. Comput. Sci.

Publications

Dominique Komander, Carolin Rehs
Twin-distance-hereditary digraphs. Theor. Comput. Sci. 968 (2023)
Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong
Oriented Spanners. ESA (2023)
Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong
Oriented Spanners. CoRR (2023)
Frank Gurski, Carolin Rehs, Jochen Rethmann
Characterizations and Directed Path-Width of Sequence Digraphs. Theory Comput. Syst. 67 (2) (2023)
Frank Gurski, Dominique Komander, Carolin Rehs
Correction to: Solutions for subset sum problems with special digraph constraints. Math. Methods Oper. Res. 96 (2) (2022)
Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
Computing directed Steiner path covers. J. Comb. Optim. 43 (2) (2022)
Frank Gurski, Dominique Komander, Carolin Rehs
On characterizations for subclasses of directed co-graphs. J. Comb. Optim. 41 (1) (2021)
Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht
Directed Width Parameters on Semicomplete Digraphs. COCOA (2021)
Frank Gurski, Dominique Komander, Carolin Rehs
How to compute digraph width measures on directed co-graphs. Theor. Comput. Sci. 855 (2021)
Dominique Komander, Carolin Rehs
Twin-Distance-Hereditary Digraphs. CoRR (2021)
Frank Gurski, Dominique Komander, Carolin Rehs
Acyclic Coloring Parameterized by Directed Clique-Width. CALDAM (2021)
Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract). SOFSEM (2020)
Frank Gurski, Dominique Komander, Carolin Rehs
Solutions for subset sum problems with special digraph constraints. Math. Methods Oper. Res. 92 (2) (2020)
Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
Computing Directed Steiner Path Covers. CoRR (2020)
Nils Morawietz, Carolin Rehs, Mathias Weller
A Timecop's Work Is Harder Than You Think. MFCS (2020)
Frank Gurski, Dominique Komander, Carolin Rehs
Solutions for Subset Sum Problems with Special Digraph Constraints. CoRR (2020)
Frank Gurski, Dominique Komander, Carolin Rehs
Acyclic coloring of special digraphs. CoRR (2020)
Frank Gurski, Carolin Rehs
Counting and enumerating independent sets with applications to combinatorial optimization problems. Math. Methods Oper. Res. 91 (3) (2020)
Frank Gurski, Carolin Rehs, Jochen Rethmann
Knapsack problems: A parameterized point of view. Theor. Comput. Sci. 775 (2019)
Frank Gurski, Carolin Rehs, Jochen Rethmann, Egon Wanke
Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms. OR Spectr. 41 (2) (2019)
Frank Gurski, Dominique Komander, Carolin Rehs
Characterizations for Special Directed Co-graphs. COCOA (2019)
Frank Gurski, Dominique Komander, Carolin Rehs
Subset Sum Problems with Special Digraph Constraints. OR (2019)
Frank Gurski, Dominique Komander, Carolin Rehs
Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract). FCT (2019)
Frank Gurski, Carolin Rehs
Comparing Linear Width Parameters for Directed Graphs. Theory Comput. Syst. 63 (6) (2019)
Frank Gurski, Dominique Komander, Carolin Rehs
On Characterizations for Subclasses of Directed Co-Graphs. CoRR (2019)
Frank Gurski, Carolin Rehs
Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs. SOFSEM (2019)
Frank Gurski, Carolin Rehs
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width. Math. Methods Oper. Res. 89 (3) (2019)
Frank Gurski, Dominique Komander, Carolin Rehs
Oriented Coloring on Recursively Defined Digraphs. Algorithms 12 (4) (2019)
Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes. OR (2019)
Frank Gurski, Carolin Rehs, Jochen Rethmann
On the hardness of palletizing bins using FIFO queues. Theor. Comput. Sci. 795 (2019)
Frank Gurski, Dominique Komander, Carolin Rehs
Oriented coloring on recursively defined digraphs. CoRR (2019)
Frank Gurski, Carolin Rehs
Comparing Linear Width Parameters for Directed Graphs. CoRR (2018)
Frank Gurski, Carolin Rehs, Jochen Rethmann
Characterizations and Directed Path-Width of Sequence Digraphs. CoRR (2018)
Frank Gurski, Carolin Rehs, Jochen Rethmann
Directed Path-Width of Sequence Digraphs. COCOA (2018)
Frank Gurski, Carolin Rehs
Computing directed path-width and directed tree-width of recursively defined digraphs. CoRR (2018)
Frank Gurski, Carolin Rehs
The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width. OR (2018)
Frank Gurski, Carolin Rehs
Directed Path-Width and Directed Tree-Width of Directed Co-graphs. COCOON (2018)
Frank Gurski, Carolin Rehs
Counting and Enumerating Independent Sets with Applications to Knapsack Problems. CoRR (2017)
Carolin Rehs, Frank Gurski
A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time. OR (2017)