DBLP - Egon Wanke

B. van der Zander, E. Wanke, W. Kiess, and B. Scheuermann.
Complexity and Solution of the Send-Receive Correlation Problem.
In Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing, 122-123, ACM 2010

Frank Gurski, Irene Rothe, Jörg Rothe, und Egon Wanke.
Exakte Algorithmen für schwere Graphenprobleme.
Springer Verlag, Berlin, Taschenbuch, 1. September 2010

A. Krumnack, A. T. Reid, E. Wanke, G. Bezgin, and R. Kötter.
Criteria for Optimizing Cortical Hierarchies with Continuous Ranges.
Criteria for optimizing cortical hierarchies with continuous ranges. Frontiers in Neuroinformatics, 4:7, doi: 10.3389/fninf.2010.00007.

F. Gurski and E. Wanke
The NLC-width and clique-width for powers of graphs of bounded tree-width.
Discrete Applied Mathematics, 157:583-595, 2009

F. Gurski and E. Wanke
On Module-Composed Graphs.
In Proceedings of WG '08, LNCS, 5911:166-177, Springer Verlag, 2009

G. Bezgina, E. Wanke, A. Krumnack and R. Kötter
Deducing logical relationships between spatially registered cortical parcellations under conditions of uncertainty.
Neural Networks, 21(8):1132-1145, 2008

F. Gurski and E. Wanke.
Line graphs of bounded clique-width.
Discrete Mathematics, 307(22):2734-2753, 2007

F. Gurski and E. Wanke.
A local characterization of bounded clique-width for line graphs.
Discrete Mathematics, 307(6):756-759, 2007

F. Gurski and E. Wanke.
The Clique-Width of Tree-Power and Leaf-Power Graphs.
In Proceedings of WG '07, LNCS, 4769:76-85, Springer Verlag, 2007

F. Gurski and E. Wanke.
Vertex Disjoint Paths on Clique-width bounded Graphs.
Theoretical Computer Science, 359(1-3):188-199, 2006

M. Abraham, R. Kötter, A. Krumnack and E. Wanke.
A connectivity rating for vertices in networks.
In Proceedings of the 4th IFIP International Conference on Theoretical Computer Science-TCS, 283-298, 2006, Springer Verlag, 2006

F. Gurski and E. Wanke.
On the relation between NLC-width and linear NLC-width.
Theoretical Computer Science, 347:76-89, 2005

R. Kötter and E. Wanke.
Mapping brains without coordinates.
Philosophical Transactions of The Royal Society: Biological Sciences, 360(1456):751-766, 2005

W. Espelage and E. Wanke.
A linear time approximation algorithm for movement minimization in conveyor flow shop processing.
European Journal of Operational Research, 160(2):485-500, 2005

F. Gurski and E. Wanke.
Minimizing NLC-Width is NP-Complete.
In Proceedings of WG '05, LNCS, 3787:69-80, Springer Verlag, 2005

E. Wanke and R. Kötter.
Oriented paths in mixed graphs.
In Proceedings of ISAAC '04, LNCS, 3341:629-643, Springer Verlag, 2004

F. Gurski and E. Wanke.
Vertex disjoint paths on Clique-width bounded graphs (extended abstract).
In Proceedings of LATIN '04, LNCS, 2978:119-128, Springer Verlag, 2004

W. Espelage, F. Gurski and E. Wanke.
Deciding clique-width for graphs of bounded tree-width.
Journal of Graph Algorithms and Applications - Special Issue of JGAA on WADS 2001, 7(2):141-180, 2003

W. Espelage and E. Wanke.
Movement minimization for unit distances in conveyor flow shop processing.
Mathematical Methods of Operations Research, 57(2):172-206, 2003

K. Skodinis and E. Wanke.
Node replacements in embedding normal form.
Journal of Computer and System Sciences, 65(2):351-376, 2002

J. Rethmann and E. Wanke.
Stack-up algorithms for palletizing at delivery industry.
European Journal of Operational Research, 128(1):74-97, 2001

W. Espelage and E. Wanke.
A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing.
In Proceedings of MFCS '01, LNCS, 2136:363-374, Springer Verlag, 2001

W. Espelage, F. Gurski and E. Wanke.
How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time.
In Proceedings of WG '01, LNCS, 2204:117-128, Springer Verlag, 2001

W. Espelage, F. Gurski and E. Wanke.
Deciding clique-width for graphs of bounded tree-width.
In Proceedings of WADS '01, LNCS, 2125:87-98, Springer Verlag, 2001

W. Espelage and E. Wanke.
The combinatorial complexity of masterkeying.
Mathematical Methods of Operations Research, 52(2):325-348, 2000

W. Espelage and E. Wanke.
Movement optimization in flow shop processing with buffers.
Mathematical Methods of Operations Research, 51(3):495-513, 2000

J. Rethmann and E. Wanke.
An approximation algorithm for the stack-up problem.
Mathematical Methods of Operations Research, 51(2):203-233, 2000

F. Höfting and E. Wanke.
Polynomial time analysis of toroidal periodic graphs.
Journal of Algorithms, 34:14-39, 2000

F. Gurski and E. Wanke.
The tree-width of clique-width bounded graphs without Kn,n.
In Proceedings of WG '00, LNCS, 1928:196-205, Springer Verlag, 2000

W. Espelage and E. Wanke.
Movement minimization in conveyor flow shop processing.
In Proceedings of SODA '00, 233:234, SIAM, Philadelphia, 2000

K. Skodinis and E. Wanke.
Neighbourhood-preserving node replacement.
In Proceedings of TAGT '98, LNCS, 1764:45-58, Springer Verlag, 2000

J. Rethmann and E. Wanke.
An optimal algorithm for on-line palletizing at delivery industry.
In Proceedings of ISAAC '98, LNCS, 1533:109-118, Springer Verlag, 1998

W. Espelage and E. Wanke.
0/1 Permutation flow shop scheduling.
Technical Report, Universität Düsseldorf, 1998

J. Rethmann and E. Wanke.
Storage controlled pile-up systems, theoretical foundations.
European Journal of Operational Research, 103(3):515-530, 1997

K. Skodinis and E. Wanke.
Degree problems for eNCE graph grammars.
Information and Computation, 135(1):15-35, 1997

J. Rethmann and E. Wanke.
Competitive analysis of on-line stack-up algorithms.
In Proceedings of ESA '97, LNCS, 1284:402-415, Springer Verlag, 1997

J. Rethmann and E. Wanke.
An approximation algorithm for stacking-up bins from a conveyor onto pallets.
In Proceedings of WADS '97, LNCS, 1272:440-449, Springer Verlag, 1997

J. Rethmann and E. Wanke.
Storage controlled pile-up systems, theoretical foundations.
In Proceedings of SOR '96, Springer Verlag, 111-116, 1997

T. Lengauer, I. Koch and E. Wanke.
An algorithm for finding maximal common subtopologies in a set of protein structures.
Journal of Computational Biology, 3(2):289-306, 1996

E. Wanke.
Undecidability of restricted uniform recurrence equations.
Acta Informatica, 33,463-475, 1996

K. Skodinis and E. Wanke.
The complexity of emptiness problems of eNCE graph grammars.
Journal of Computer and System Sciences, 51(3):472-485, 1995

F. Höfting and E. Wanke.
Minimum cost paths in periodic graphs.
SIAM Journal on Computing, 24(5):1051-1067, 1995

K. Skodinis and E. Wanke.
The bounded degree problem for non-obstructing eNCE Graph grammars.
In Proceedings of GraGra '94, LNCS, 1073:211-224, 1995

K. Skodinis and E. Wanke.
Exponential time analysis of confluent and boundary eNCE graph grammars.
In Proceedings of WG '94, LNCS, 903:180-192, 1995

E. Wanke.
k-NLC graphs and polynomial algorithms.
Discrete Applied Mathematics, 54:251-266, 1994

E. Wanke.
Bounded tree-width and LOGCFL.
Journal of Algorithms, 16:470-491, 1994

E. Wanke.
On the decidability of certain integer subgraph problems on context-free graph languages.
Information and Computation, 113(1):26-49, 1994

E. Wanke.
The complexity of connectivity problems on context-free graph languages.
Journal of Computer and System Sciences, 49(1):57-82, 1994

F. Höfting and E. Wanke.
Polynomial time analysis of toroidal periodic graphs.
In Proceedings of ICALP '94, LNCS, 820:544-555, 1994

E. Wanke.
Bounded tree-width and LOGCFL.
In Proceedings of WG '93, LNCS, 790:33-44, 1994

Analysis of Graphs Defined by Succinct Specifications. Habilitationsschrift, Gesellschaft für Mathematik und Datenverarbeitung (GMD), Juli 1994

T. Lengauer and E. Wanke.
Efficient analysis of graph properties on context-free graph languages.
Journal of the ACM, 40(2):368-393, 1993

E. Wanke.
Paths and cycles in finite periodic graphs.
In Proceedings of MFCS '93, LNCS, 711:751-759, 1993

F. Höfting and E. Wanke.
Polynomial algorithms for minimum cost paths in periodic graphs.
In Proceedings of SODA '93, 493-499, SIAM, Philadelphia, 1993

F. Höfting, T. Lengauer and E. Wanke.
Processing of hierarchically defined graphs and graph families.
In B. Monien and T. Ottmann, Hrsg., Data Structures and Efficient Algorithms, LNCS, 594:44-69, 1992

E. Wanke.
Paths and cycles in finite periodic graphs.
Technischer Bericht, 1/92, Universität-Gesamthochschule-Paderborn, 1992

E. Wanke.
Algorithms for graph problems on BNLC structured graphs.
Information and Computation, 94(1):93-122, 1991

E. Wanke.
On the decidability of integer subgraph problems on context-free graph languages.
In Proceedings of FCT '91, LNCS, 529:415-426, 1991

E. Wanke and M. Wiegers.
Undecidability of the bandwidth problem on certain linear graph languages.
Information Processing Letters, 4(33):193-197, 1989

E. Wanke.
The complexity of connectivity problems on context-free graph languages.
In Proceedings of FCT '89, LNCS, 380:470-479, 1989

Algorithmen und Komplexitätsanalyse für die Verarbeitung hierarchisch definierter Graphen und hierarchisch definierter Graphfamilien. Dissertation, Universität-Gesamthochschule-Paderborn, November 1989

T. Lengauer and E. Wanke.
Efficient solution of connectivity problems on hierarchically defined graphs.
SIAM Journal on Computing, 6(17): 1063-1080, 1988

T. Lengauer and E. Wanke.
Efficient analysis of graph properties on context-free graph languages.
In Proceedings of ICALP '88, LNCS, 317:379-393, 1988

T. Lengauer and E. Wanke.
Efficient processing of hierarchical graphs for engineering design.
Bulletin of the European Association for Theoretical Computer Science (EATCS), 25:143-157, 1988