Follow
Carolin Rehs
Title
Cited by
Cited by
Year
Knapsack problems: A parameterized point of view
F Gurski, C Rehs, J Rethmann
Theoretical Computer Science, 2018
21*2018
Directed path-width and directed tree-width of directed co-graphs
F Gurski, C Rehs
Computing and Combinatorics: 24th International Conference, COCOON 2018 …, 2018
182018
Oriented coloring on recursively defined digraphs
F Gurski, D Komander, C Rehs
Algorithms 12 (4), 87, 2019
122019
Computing digraph width measures on directed co-graphs
F Gurski, D Komander, C Rehs
Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019 …, 2019
122019
Comparing linear width parameters for directed graphs
F Gurski, C Rehs
Theory of Computing Systems 63, 1358-1387, 2019
112019
On characterizations for subclasses of directed co-graphs
F Gurski, D Komander, C Rehs
Journal of Combinatorial Optimization 41 (1), 234-266, 2021
102021
Computing directed steiner path covers for directed co-graphs
F Gurski, S Hoffmann, D Komander, C Rehs, J Rethmann, E Wanke
SOFSEM 2020: Theory and Practice of Computer Science: 46th International …, 2020
102020
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
F Gurski, C Rehs
Mathematical Methods of Operations Research 89, 411-432, 2019
82019
How to compute digraph width measures on directed co-graphs
F Gurski, D Komander, C Rehs
Theoretical Computer Science 855, 161-185, 2021
72021
Acyclic coloring parameterized by directed clique-width
F Gurski, D Komander, C Rehs
Algorithms and Discrete Applied Mathematics: 7th International Conference …, 2021
72021
Acyclic coloring of special digraphs
F Gurski, D Komander, C Rehs
arXiv preprint arXiv:2006.13911, 2020
72020
Forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs
F Gurski, C Rehs
SOFSEM 2019: Theory and Practice of Computer Science: 45th International …, 2019
72019
A Timecop's Work Is Harder Than You Think
N Morawietz, C Rehs, M Weller
45th International Symposium on Mathematical Foundations of Computer Science …, 2020
52020
Directed Path-Width of Sequence Digraphs
F Gurski, C Rehs, J Rethmann
Combinatorial Optimization and Applications: 12th International Conference …, 2018
52018
Computing directed path-width and directed tree-width of recursively defined digraphs
F Gurski, C Rehs
arXiv preprint arXiv:1806.04457, 2018
52018
Characterizations for special directed co-graphs
F Gurski, D Komander, C Rehs
Combinatorial Optimization and Applications: 13th International Conference …, 2019
42019
The knapsack problem with conflict graphs and forcing graphs of bounded clique-width
F Gurski, C Rehs
Operations Research Proceedings 2018: Selected Papers of the Annual …, 2019
42019
Solutions for subset sum problems with special digraph constraints
F Gurski, D Komander, C Rehs
Mathematical Methods of Operations Research 92, 401-433, 2020
32020
Subset sum problems with special digraph constraints
F Gurski, D Komander, C Rehs
Operations Research Proceedings 2019: Selected Papers of the Annual …, 2020
32020
Exact solutions for the steiner path cover problem on special graph classes
F Gurski, S Hoffmann, D Komander, C Rehs, J Rethmann, E Wanke
Operations Research Proceedings 2019: Selected Papers of the Annual …, 2020
32020
The system can't perform the operation now. Try again later.
Articles 1–20