| Comparing linear width parameters for directed graphs F Gurski, C Rehs Theory of Computing Systems 63, 1358-1387, 2019 | 28 | 2019 |
| Knapsack problems: A parameterized point of view F Gurski, C Rehs, J Rethmann Theoretical Computer Science, 2018 | 28* | 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 | 19 | 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 | 16 | 2020 |
| 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 | 15 | 2019 |
| On characterizations for subclasses of directed co-graphs F Gurski, D Komander, C Rehs Journal of Combinatorial Optimization 41 (1), 234-266, 2021 | 13 | 2021 |
| Oriented coloring on recursively defined digraphs F Gurski, D Komander, C Rehs Algorithms 12 (4), 87, 2019 | 12 | 2019 |
| Computing digraph width measures on directed co-graphs F Gurski, D Komander, C Rehs Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019 …, 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 |
| 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 |
| 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 | 9 | 2019 |
| Directed Path-Width of Sequence Digraphs F Gurski, C Rehs, J Rethmann International Conference on Combinatorial Optimization and Applications, 79-93, 2018 | 9 | 2018 |
| Acyclic coloring parameterized by directed clique-width F Gurski, D Komander, C Rehs Conference on Algorithms and Discrete Applied Mathematics, 95-108, 2021 | 8 | 2021 |
| Acyclic coloring of special digraphs F Gurski, D Komander, C Rehs arXiv preprint arXiv:2006.13911, 2020 | 7 | 2020 |
| Computing directed path-width and directed tree-width of recursively defined digraphs F Gurski, C Rehs arXiv preprint arXiv:1806.04457, 2018 | 6 | 2018 |
| Characterizations and Directed Path-Width of Sequence Digraphs F Gurski, C Rehs, J Rethmann Theory of Computing Systems 67 (2), 310-347, 2023 | 5* | 2023 |
| Directed width parameters on semicomplete digraphs F Gurski, D Komander, C Rehs, S Wiederrecht Combinatorial Optimization and Applications: 15th International Conference …, 2021 | 5 | 2021 |
| Solutions for subset sum problems with special digraph constraints F Gurski, D Komander, C Rehs Mathematical Methods of Operations Research 92, 401-433, 2020 | 5 | 2020 |
| Characterizations for special directed co-graphs F Gurski, D Komander, C Rehs Combinatorial Optimization and Applications: 13th International Conference …, 2019 | 5 | 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 | 5 | 2019 |
