| Directed path-width and directed tree-width of directed co-graphs F Gurski, C Rehs International Computing and Combinatorics Conference, 255-267, 2018 | 18 | 2018 |
| 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 | 12 | 2019 |
| Oriented coloring on recursively defined digraphs F Gurski, D Komander, C Rehs Algorithms 12 (4), 87, 2019 | 12 | 2019 |
| 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 | 10 | 2020 |
| Comparing linear width parameters for directed graphs F Gurski, C Rehs Theory of Computing Systems 63 (6), 1358-1387, 2019 | 10 | 2019 |
| On characterizations for subclasses of directed co-graphs F Gurski, D Komander, C Rehs Journal of Combinatorial Optimization 41 (1), 234-266, 2021 | 8 | 2021 |
| 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 | 8 | 2019 |
| Acyclic coloring of special digraphs F Gurski, D Komander, C Rehs arXiv preprint arXiv:2006.13911, 2020 | 7 | 2020 |
| Acyclic coloring parameterized by directed clique-width F Gurski, D Komander, C Rehs Conference on Algorithms and Discrete Applied Mathematics, 95-108, 2021 | 6 | 2021 |
| How to compute digraph width measures on directed co-graphs F Gurski, D Komander, C Rehs Theoretical Computer Science 855, 161-185, 2021 | 6 | 2021 |
| 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 | 6 | 2019 |
| Directed Path-Width of Sequence Digraphs F Gurski, C Rehs, J Rethmann International Conference on Combinatorial Optimization and Applications, 79-93, 2018 | 5 | 2018 |
| Computing directed path-width and directed tree-width of recursively defined digraphs F Gurski, C Rehs arXiv preprint arXiv:1806.04457, 2018 | 5 | 2018 |
| 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 | 4 | 2020 |
| Characterizations for special directed co-graphs F Gurski, D Komander, C Rehs International Conference on Combinatorial Optimization and Applications, 252-264, 2019 | 4 | 2019 |
| The knapsack problem with conflict graphs and forcing graphs of bounded clique-width F Gurski, C Rehs Operations Research Proceedings 2018, 259-265, 2019 | 4 | 2019 |
| Subset sum problems with special digraph constraints F Gurski, D Komander, C Rehs Operations Research Proceedings 2019, 339-346, 2020 | 3 | 2020 |
| 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 | 3 | 2020 |
| Knapsack Problems: A Parameterized Point of View C Albrecht, F Gurski, J Rethmann, E Yilmaz arXiv preprint arXiv:1611.07724, 2016 | 3 | 2016 |
