| Comparing linear width parameters for directed graphs F Gurski, C Rehs Theory of Computing Systems 63 (6), 1358-1387, 2019 | 44 | 2019 |
| Knapsack problems: A parameterized point of view F Gurski, C Rehs, J Rethmann Theoretical Computer Science, 2018 | 38* | 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 | 25 | 2020 |
| Directed path-width and directed tree-width of directed co-graphs F Gurski, C Rehs International Computing and Combinatorics Conference, 255-267, 2018 | 20 | 2018 |
| 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 | 17 | 2019 |
| On characterizations for subclasses of directed co-graphs F Gurski, D Komander, C Rehs Journal of Combinatorial Optimization 41 (1), 234-266, 2021 | 14 | 2021 |
| Directed path-width of sequence digraphs F Gurski, C Rehs, J Rethmann International Conference on Combinatorial Optimization and Applications, 79-93, 2018 | 13 | 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 |
| Acyclic coloring parameterized by directed clique-width F Gurski, D Komander, C Rehs Conference on Algorithms and Discrete Applied Mathematics, 95-108, 2021 | 10 | 2021 |
| 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 |
| How to compute digraph width measures on directed co-graphs F Gurski, D Komander, C Rehs Theoretical Computer Science 855, 161-185, 2021 | 9 | 2021 |
| Directed width parameters on semicomplete digraphs F Gurski, D Komander, C Rehs, S Wiederrecht International Conference on Combinatorial Optimization and Applications, 615-628, 2021 | 8 | 2021 |
| Acyclic coloring of special digraphs F Gurski, D Komander, C Rehs arXiv preprint arXiv:2006.13911, 2020 | 8 | 2020 |
| 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 | 8 | 2019 |
| Computing directed path-width and directed tree-width of recursively defined digraphs F Gurski, C Rehs arXiv preprint arXiv:1806.04457, 2018 | 7 | 2018 |
| Characterizations for special directed co-graphs F Gurski, D Komander, C Rehs International Conference on Combinatorial Optimization and Applications, 252-264, 2019 | 6 | 2019 |
| 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 | 6 | 2019 |
| Computing directed Steiner path covers F Gurski, D Komander, C Rehs, J Rethmann, E Wanke Journal of Combinatorial Optimization 43 (2), 402-431, 2022 | 5 | 2022 |
| Oriented Spanners K Buchin, J Gudmundsson, A Kalb, A Popov, C Rehs, A van Renssen, ... | 4 | 2023 |
