Folgen
Carolin Rehs
Carolin Rehs
Institut für Informatik, Heinrich Heine Universität
Bestätigte E-Mail-Adresse bei hhu.de
Titel
Zitiert von
Zitiert von
Jahr
Directed path-width and directed tree-width of directed co-graphs
F Gurski, C Rehs
International Computing and Combinatorics Conference, 255-267, 2018
182018
Knapsack problems: A parameterized point of view
F Gurski, C Rehs, J Rethmann
Theoretical Computer Science, 2018
16*2018
Computing digraph width measures on directed co-graphs
F Gurski, D Komander, C Rehs
International Symposium on Fundamentals of Computation Theory, 292-305, 2019
122019
Oriented coloring on recursively defined digraphs
F Gurski, D Komander, C Rehs
Algorithms 12 (4), 87, 2019
122019
Computing directed steiner path covers for directed co-graphs
F Gurski, S Hoffmann, D Komander, C Rehs, J Rethmann, E Wanke
International Conference on Current Trends in Theory and Practice of …, 2020
102020
Comparing linear width parameters for directed graphs
F Gurski, C Rehs
Theory of Computing Systems 63 (6), 1358-1387, 2019
102019
On characterizations for subclasses of directed co-graphs
F Gurski, D Komander, C Rehs
Journal of Combinatorial Optimization 41 (1), 234-266, 2021
82021
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
F Gurski, C Rehs
Mathematical Methods of Operations Research 89 (3), 411-432, 2019
82019
Acyclic coloring of special digraphs
F Gurski, D Komander, C Rehs
arXiv preprint arXiv:2006.13911, 2020
72020
Acyclic coloring parameterized by directed clique-width
F Gurski, D Komander, C Rehs
Conference on Algorithms and Discrete Applied Mathematics, 95-108, 2021
62021
How to compute digraph width measures on directed co-graphs
F Gurski, D Komander, C Rehs
Theoretical Computer Science 855, 161-185, 2021
62021
Forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs
F Gurski, C Rehs
International Conference on Current Trends in Theory and Practice of …, 2019
62019
Directed Path-Width of Sequence Digraphs
F Gurski, C Rehs, J Rethmann
International Conference on Combinatorial Optimization and Applications, 79-93, 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
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
42020
Characterizations for special directed co-graphs
F Gurski, D Komander, C Rehs
International Conference on Combinatorial Optimization and Applications, 252-264, 2019
42019
The knapsack problem with conflict graphs and forcing graphs of bounded clique-width
F Gurski, C Rehs
Operations Research Proceedings 2018, 259-265, 2019
42019
Subset sum problems with special digraph constraints
F Gurski, D Komander, C Rehs
Operations Research Proceedings 2019, 339-346, 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, 331-338, 2020
32020
Knapsack Problems: A Parameterized Point of View
C Albrecht, F Gurski, J Rethmann, E Yilmaz
arXiv preprint arXiv:1611.07724, 2016
32016
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20