| 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 | 167 | 1996 |
| k-NLC graphs and polynomial algorithms E Wanke Discrete Applied Mathematics 54 (2-3), 251-266, 1994 | 163 | 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 | 155 | 2001 |
| Mapping brains without coordinates R Kötter, E Wanke Philosophical Transactions of the Royal Society B: Biological Sciences 360 …, 2005 | 140 | 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 | 106 | 2000 |
| Efficient solution of connectivity problems on hierarchically defined graphs T Lengauer, E Wanke SIAM Journal on Computing 17 (6), 1063-1080, 1988 | 82 | 1988 |
| Deciding clique-width for graphs of bounded tree-width W Espelage, F Gurski, E Wanke J. Graph Algorithms Appl. 7 (2), 141-180, 2003 | 50 | 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 | 50 | 1988 |
| On the relationship between NLC-width and linear NLC-width F Gurski, E Wanke Theoretical Computer Science 347 (1-2), 76-89, 2005 | 49 | 2005 |
| Line graphs of bounded clique-width F Gurski, E Wanke Discrete Mathematics 307 (22), 2734-2754, 2007 | 42 | 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 | 38 | 2009 |
| Vertex disjoint paths on clique-width bounded graphs F Gurski, E Wanke Theoretical Computer Science 359 (1-3), 188-199, 2006 | 35 | 2006 |
| Bounded tree-width and LOGCFL E Wanke Journal of Algorithms 16 (3), 470-491, 1994 | 34 | 1994 |
| Processing of hierarchically defined graphs and graph families F Höfting, T Lengauer, E Wanke Data structures and efficient algorithms, 44-69, 1992 | 32 | 1992 |
| Shapley ratings in brain networks R Kötter, AT Reid, A Krumnack, E Wanke, O Sporns Frontiers in neuroinformatics, 2, 2007 | 30 | 2007 |
| Minimum cost paths in periodic graphs F Höfting, E Wanke SIAM Journal on Computing 24 (5), 1051-1067, 1995 | 28 | 1995 |
| Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete S Hoffmann, E Wanke International Symposium on Algorithms and Experiments for Sensor Systems …, 2012 | 25 | 2012 |
| Storage controlled pile-up systems, theoretical foundations J Rethmann, E Wanke European Journal of Operational Research 103 (3), 515-530, 1997 | 25 | 1997 |
| Directed NLC-width F Gurski, E Wanke, E Yilmaz Theoretical Computer Science 616, 1-17, 2016 | 24 | 2016 |
| 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 | 24 | 2008 |
