Get started
Author

Carolin Rehs

Observed name: Rehs, Carolin
ORCID: 0000-0002-8788-1028
Observed ORCID: 0000-0002-8788-1028
OpenAlex ID: A5061111704
Knapsack problems: A parameterized point of view
2018 · Frank Gurski, Carolin Rehs, et al. · Theoretical Computer Science · 21
PDF
Comparing Linear Width Parameters for Directed Graphs
2019 · Frank Gurski, Carolin Rehs · Theory of Computing Systems · 15
PDF
Directed Path-Width and Directed Tree-Width of Directed Co-graphs
2018 · Frank Gurski, Carolin Rehs · Lecture notes in computer science · 14
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
2019 · Frank Gurski, Carolin Rehs · Mathematical Methods of Operations Research · 12
Oriented Coloring on Recursively Defined Digraphs
2019 · Frank Gurski, Dominique Komander, et al. · Algorithms · 10
PDF
Computing Digraph Width Measures on Directed Co-graphs
2019 · Frank Gurski, Dominique Komander, et al. · Lecture notes in computer science · 10
On characterizations for subclasses of directed co-graphs
2020 · Frank Gurski, Dominique Komander, et al. · Journal of Combinatorial Optimization · 9
PDF
A Timecop’s Work Is Harder Than You Think
2020 · Morawietz, Nils, Rehs, Carolin, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 8
PDF
Characterizations for Special Directed Co-graphs
2019 · Frank Gurski, Dominique Komander, et al. · Lecture notes in computer science · 7
How to compute digraph width measures on directed co-graphs
2020 · Frank Gurski, Dominique Komander, et al. · Theoretical Computer Science · 6
Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)
2020 · Frank Gurski, Stefan Hoffmann, et al. · Lecture notes in computer science · 5
Directed Path-Width of Sequence Digraphs
2018 · Frank Gurski, Carolin Rehs, et al. · Lecture notes in computer science · 5
Computing directed Steiner path covers
2021 · Frank Gurski, Dominique Komander, et al. · Journal of Combinatorial Optimization · 4
PDF
Acyclic Coloring Parameterized by Directed Clique-Width
2021 · Frank Gurski, Dominique Komander, et al. · Lecture notes in computer science · 4
Solutions for subset sum problems with special digraph constraints
2020 · Frank Gurski, Dominique Komander, et al. · Mathematical Methods of Operations Research · 4
PDF
Acyclic coloring of special digraphs
2020 · Gurski, Frank, Komander, Dominique, et al. · arXiv (Cornell University) · 4
PDF
Subset Sum Problems with Special Digraph Constraints
2020 · Frank Gurski, Dominique Komander, et al. · Operations research proceedings · 4
Counting and enumerating independent sets with applications to combinatorial optimization problems
2019 · Frank Gurski, Carolin Rehs · Mathematical Methods of Operations Research · 4
Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs
2019 · Frank Gurski, Carolin Rehs · Lecture notes in computer science · 4
The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width
2019 · Frank Gurski, Carolin Rehs · Operations research proceedings · 4
Computing directed path-width and directed tree-width of recursively defined digraphs
2018 · Gurski, Frank, Rehs, Carolin · arXiv (Cornell University) · 4
PDF
Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes
2020 · Frank Gurski, Stefan Hoffmann, et al. · Operations research proceedings · 3
Orienteering (with Time Windows) on Restricted Graph Classes
2025 · Kevin Buchin, Mart Hagedoorn, et al. · Lecture notes in computer science · 2
PDF
Twin-distance-hereditary digraphs
2023 · Dominique Komander, Carolin Rehs · Theoretical Computer Science · 2
PDF
A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time
2018 · Carolin Rehs, Frank Gurski · Operations research proceedings · 2
Works count: 45
Citation count: 172
H-index: 8
I10-index: 6
Year
Topic
Type