Egon Wanke
Egon Wanke
Professor of Computer Science, Heinrich-Heine-Universität Düsseldorf
Verified email at uni-duesseldorf.de
Title
Cited by
Cited by
Year
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
1661996
k-NLC graphs and polynomial algorithms
E Wanke
Discrete Applied Mathematics 54 (2-3), 251-266, 1994
1581994
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
1462001
Mapping brains without coordinates
R Kötter, E Wanke
Philosophical Transactions of the Royal Society B: Biological Sciences 360 …, 2005
1312005
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
972000
Efficient solution of connectivity problems on hierarchically defined graphs
T Lengauer, E Wanke
SIAM Journal on Computing 17 (6), 1063-1080, 1988
801988
Deciding clique-width for graphs of bounded tree-width
W Espelage, F Gurski, E Wanke
J. Graph Algorithms Appl. 7 (2), 141-180, 2003
502003
Efficient analysis of graph properties on context-free graph languages
T Lengauer, E Wanke
International Colloquium on Automata, Languages, and Programming, 379-393, 1988
461988
On the relationship between NLC-width and linear NLC-width
F Gurski, E Wanke
Theoretical Computer Science 347 (1-2), 76-89, 2005
452005
Optimization of cortical hierarchies with continuous scales and ranges
AT Reid, A Krumnack, E Wanke, R Kötter
Neuroimage 47 (2), 611-617, 2009
382009
Line graphs of bounded clique-width
F Gurski, E Wanke
Discrete Mathematics 307 (22), 2734-2754, 2007
382007
Vertex disjoint paths on clique-width bounded graphs
F Gurski, E Wanke
Theoretical Computer Science 359 (1-3), 188-199, 2006
342006
Bounded tree-width and LOGCFL
E Wanke
Journal of Algorithms 16 (3), 470-491, 1994
331994
Processing of hierarchically defined graphs and graph families
F Höfting, T Lengauer, E Wanke
Data structures and efficient algorithms, 44-69, 1992
321992
Minimum cost paths in periodic graphs
F Höfting, E Wanke
SIAM Journal on Computing 24 (5), 1051-1067, 1995
301995
Shapley ratings in brain networks
R Kötter, AT Reid, A Krumnack, E Wanke, O Sporns
Frontiers in neuroinformatics 1, 2, 2007
282007
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
252008
Efficient decision procedures for graph properties on context-free graph languages
T Lengauer, E Wanke
Journal of the ACM (JACM) 40 (2), 368-393, 1993
251993
Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete
S Hoffmann, E Wanke
International Symposium on Algorithms and Experiments for Sensor Systems …, 2012
242012
Storage controlled pile-up systems, theoretical foundations
J Rethmann, E Wanke
European Journal of Operational Research 103 (3), 515-530, 1997
241997
The system can't perform the operation now. Try again later.
Articles 1–20