| 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 |
| 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 |
| The knapsack problem with special neighbor constraints S Goebbels, F Gurski, D Komander Mathematical Methods of Operations Research 95 (1), 1-34, 2022 | 11 | 2022 |
| 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 |
| Oriented coloring of msp-digraphs and oriented co-graphs F Gurski, D Komander, M Lindemann International Conference on Combinatorial Optimization and Applications, 743-758, 2020 | 8 | 2020 |
| Acyclic coloring of special digraphs F Gurski, D Komander, C Rehs arXiv preprint arXiv:2006.13911, 2020 | 8 | 2020 |
| Characterizations for special directed co-graphs F Gurski, D Komander, C Rehs International Conference on Combinatorial Optimization and Applications, 252-264, 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 |
| Efficient computation of the oriented chromatic number of recursively defined digraphs F Gurski, D Komander, M Lindemann Theoretical Computer Science 890, 16-35, 2021 | 5 | 2021 |
| Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs F Gurski, D Komander, M Lindemann International Workshop on Algorithms and Computation, 182-194, 2021 | 4 | 2021 |
| Solutions for subset sum problems with special digraph constraints F Gurski, D Komander, C Rehs Mathematical Methods of Operations Research 92 (2), 401-433, 2020 | 4 | 2020 |
| Subset sum problems with special digraph constraints F Gurski, D Komander, C Rehs Operations Research Proceedings 2019: Selected Papers of the Annual …, 2020 | 4 | 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: Selected Papers of the Annual …, 2020 | 3 | 2020 |
| Twin-distance-hereditary digraphs D Komander, C Rehs Theoretical Computer Science 968, 114009, 2023 | 2 | 2023 |
| The Knapsack Problem with Special Neighbor Constraints on Directed Co-graphs S Goebbels, F Gurski, D Komander International Conference on Operations Research, 95-100, 2021 | 1 | 2021 |
| Correction to: Solutions for subset sum problems with special digraph constraints F Gurski, D Komander, C Rehs Mathematical Methods of Operations Research 96 (2), 313-313, 2022 | | 2022 |
