| k-NLC graphs and polynomial algorithms E Wanke Discrete Applied Mathematics 54 (2-3), 251-266, 1994 | 189 | 1994 |
| 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 |
| An algorithm for finding maximal common subtopologies in a set of protein structures I Koch, T Lengauer, E Wanke Journal of computational biology 3 (2), 289-306, 1996 | 181 | 1996 |
| Mapping brains without coordinates R Kötter, E Wanke Philosophical Transactions of the Royal Society B: Biological Sciences 360 …, 2005 | 166 | 2005 |
| 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 |
| Efficient solution of connectivity problems on hierarchically defined graphs T Lengauer, E Wanke SIAM Journal on Computing 17 (6), 1063-1080, 1988 | 90 | 1988 |
| 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 |
| Efficient analysis of graph properties on context-free graph languages T Lengauer, E Wanke International Colloquium on Automata, Languages, and Programming, 379-393, 1988 | 55 | 1988 |
| Line graphs of bounded clique-width F Gurski, E Wanke Discrete Mathematics 307 (22), 2734-2754, 2007 | 48 | 2007 |
| Optimization of cortical hierarchies with continuous scales and ranges AT Reid, A Krumnack, E Wanke, R Kötter Neuroimage 47 (2), 611-617, 2009 | 41 | 2009 |
| Vertex disjoint paths on clique-width bounded graphs F Gurski, E Wanke Theoretical Computer Science 359 (1-3), 188-199, 2006 | 41 | 2006 |
| Processing of hierarchically defined graphs and graph families F Höfting, T Lengauer, E Wanke Data structures and efficient algorithms: Final Report on the DFG Special …, 2005 | 40 | 2005 |
| Directed NLC-width F Gurski, E Wanke, E Yilmaz Theoretical Computer Science 616, 1-17, 2016 | 38 | 2016 |
| Minimum cost paths in periodic graphs F Höfting, E Wanke SIAM Journal on Computing 24 (5), 1051-1067, 1995 | 37 | 1995 |
| Shapley ratings in brain networks R Kötter, AT Reid, A Krumnack, E Wanke, O Sporns Frontiers in neuroinformatics 1, 94, 2007 | 35 | 2007 |
| Bounded tree-width and LOGCFL E Wanke Journal of Algorithms 16 (3), 470-491, 1994 | 35 | 1994 |
| Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete S Hoffmann, E Wanke International Symposium on Algorithms and Experiments for Sensor Systems …, 2012 | 33 | 2012 |
| Deducing logical relationships between spatially registered cortical parcellations under conditions of uncertainty G Bezgin, E Wanke, A Krumnack, R Kötter Neural networks 21 (8), 1132-1145, 2008 | 26 | 2008 |
| Minimizing NLC-width is NP-complete F Gurski, E Wanke International Workshop on Graph-Theoretic Concepts in Computer Science, 69-80, 2005 | 26 | 2005 |
