| How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time W Espelage, F Gurski, E Wanke International Workshop on Graph-Theoretic Concepts in Computer Science, 117-128, 2001 | 186 | 2001 |
| The Tree-Width of Clique-Width Bounded Graphs without Kn,n F Gurski, E Wanke International Workshop on Graph-Theoretic Concepts in Computer Science, 196-205, 2000 | 132 | 2000 |
| On the relationship between NLC-width and linear NLC-width F Gurski, E Wanke Theoretical Computer Science 347 (1-2), 76-89, 2005 | 66 | 2005 |
| Deciding clique-width for graphs of bounded tree-width W Espelage, F Gurski, E Wanke Journal of Graph Algorithms and Applications 7 (2), 141-180, 2003 | 56 | 2003 |
| Line graphs of bounded clique-width F Gurski, E Wanke Discrete Mathematics 307 (22), 2734-2754, 2007 | 48 | 2007 |
| Comparing linear width parameters for directed graphs F Gurski, C Rehs Theory of Computing Systems 63 (6), 1358-1387, 2019 | 44 | 2019 |
| Vertex disjoint paths on clique-width bounded graphs F Gurski, E Wanke Theoretical Computer Science 359 (1-3), 188-199, 2006 | 41 | 2006 |
| Knapsack problems: A parameterized point of view F Gurski, C Rehs, J Rethmann Theoretical Computer Science 775, 93-108, 2019 | 38* | 2019 |
| Directed NLC-width F Gurski, E Wanke, E Yilmaz Theoretical Computer Science 616, 1-17, 2016 | 38 | 2016 |
| The behavior of clique-width under graph operations and graph transformations F Gurski Theory of Computing Systems 60 (2), 346-376, 2017 | 36 | 2017 |
| Characterizations for co-graphs defined by restricted NLC-width or clique-width operations F Gurski Discrete Mathematics 306 (2), 271-277, 2006 | 29 | 2006 |
| Linear layouts measuring neighbourhoods in graphs F Gurski Discrete Mathematics 306 (15), 1637-1650, 2006 | 27 | 2006 |
| Minimizing NLC-width is NP-complete F Gurski, E Wanke International Workshop on Graph-Theoretic Concepts in Computer Science, 69-80, 2005 | 26 | 2005 |
| The NLC-width and clique-width for powers of graphs of bounded tree-width F Gurski, E Wanke Discrete Applied Mathematics 157 (4), 583-595, 2009 | 24 | 2009 |
| Exakte algorithmen für schwere graphenprobleme F Gurski, I Rothe, J Rothe, E Wanke Springer-Verlag, 2010 | 22 | 2010 |
| 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 |
| Dynamic programming algorithms on directed cographs F Gurski Statistics, Optimization & Information Computing 5 (1), 35-44, 2017 | 19 | 2017 |
| A comparison of two approaches for polynomial time algorithms computing basic graph parameters F Gurski arXiv preprint arXiv:0806.4073, 2008 | 19 | 2008 |
| 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 |
| Change-making problems revisited: a parameterized point of view S Goebbels, F Gurski, J Rethmann, E Yilmaz Journal of Combinatorial Optimization 34 (4), 1218-1236, 2017 | 16 | 2017 |
Egon WankeProfessor of Computer Science, Heinrich-Heine-Universität DüsseldorfVerified email at uni-duesseldorf.de
