Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract). - Thomas Lengauer; Egon Wanke (ICALP, 1988)

PLEXUS: A System for Implementing Hierarchical Graph Algorithms. - Egon Wanke (STACS, 1988)

Efficient processing of hierarchical graphs for engineering design. - Thomas Lengauer; Egon Wanke (Bull. EATCS, 1988)

Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs. - Thomas Lengauer; Egon Wanke (SIAM J. Comput., 1988)

The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract). - Egon Wanke (FCT, 1989)

Undecidability of the Bandwidth Problem on Linear Graph Languages. - Egon Wanke; Manfred Wiegers (Inf. Process. Lett., 1989)

Algorithmen und Komplexitätsanalyse für die Verarbeitung hierarchisch definierter Graphen und hierarchisch definierter Graphfamilien. - Egon Wanke (1989)

PLEXUS: Tools for Analyzing Graph Grammars. - Egon Wanke (Graph-Grammars and Their Application to Computer Science, 1990)

On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages. - Egon Wanke (FCT, 1991)

Algorithms for Graph Problems on BNLC Structured Graphs - Egon Wanke (Inf. Comput., 1991)

Processing of Hierarchically Defined Graphs and Graph Families. - Franz Höfting; Thomas Lengauer; Egon Wanke (Data Structures and Efficient Algorithms, 1992)

Paths and Cycles in Finite Periodic Graphs. - Egon Wanke (MFCS, 1993)

Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs. - Franz Höfting; Egon Wanke (SODA, 1993)

1st Grade - A System for Implementation, Testing and Animation of Graph Algorithms. - Franz Höfting; Egon Wanke; Aurel Balmosan; Curd Bergmann (STACS, 1993)

Efficient Decision Procedures for Graph Properties on Centext-Free Graph Languages. - Thomas Lengauer; Egon Wanke (J. ACM, 1993)

Polynomial Time Analysis of Torodial Periodic Graphs. - Franz Höfting; Egon Wanke (ICALP, 1994)

The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars. - Konstantin Skodinis; Egon Wanke (TAGT, 1994)

Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages. - Konstantin Skodinis; Egon Wanke (WG, 1994)

k-NLC Graphs and Polynomial Algorithms. - Egon Wanke (Discret. Appl. Math., 1994)

Bounded Tree-Width and LOGCFL. - Egon Wanke (J. Algorithms, 1994)

The Complexity of Connectivity Problems on Context-Free Graph Languages. - Egon Wanke (J. Comput. Syst. Sci., 1994)

On the Decidability of Certain Integer Subgraph Problems on Context-Free Graph Languages - Egon Wanke (Inf. Comput., 1994)

Emptiness Problems of eNCE Graph Languages. - Konstantin Skodinis; Egon Wanke (J. Comput. Syst. Sci., 1995)

Minimum Cost Paths in Periodic Graphs. - Franz Höfting; Egon Wanke (SIAM J. Comput., 1995)

Undecidability of Restricted Uniform Recurrence Equations. - Egon Wanke (Acta Informatica, 1996)

An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein Structures. - Ina Koch; Thomas Lengauer; Egon Wanke (J. Comput. Biol., 1996)

Competivive Analysis of on-line Stack-Up Algorithms. - Jochen Rethmann; Egon Wanke (ESA, 1997)

An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets. - Jochen Rethmann; Egon Wanke (WADS, 1997)

The Bounded Degree Problem for eNCE Graph Grammars. - Konstantin Skodinis; Egon Wanke (Inf. Comput., 1997)

An Optimal Algorithm for On-Line Palletizing at Delivery Industry. - Jochen Rethmann; Egon Wanke (ISAAC, 1998)

Neighborhood-Preserving Node Replacements. - Konstantin Skodinis; Egon Wanke (TAGT, 1998)

Movement minimization in conveyor flow shop processing. - Wolfgang Espelage; Egon Wanke (SODA, 2000)

The Tree-Width of Clique-Width Bounded Graphs Without Kn, n. - Frank Gurski; Egon Wanke (WG, 2000)

Polynomial-Time Analysis of Toroidal Periodic Graphs. - Franz Höfting; Egon Wanke (J. Algorithms, 2000)

Movement optimization in flow shop processing with buffers. - Wolfgang Espelage; Egon Wanke (Math. Methods Oper. Res., 2000)

The combinatorial complexity of masterkeying. - Wolfgang Espelage; Egon Wanke (Math. Methods Oper. Res., 2000)

An approximation algorithm for the stack-up problem. - Jochen Rethmann; Egon Wanke (Math. Methods Oper. Res., 2000)

A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing. - Wolfgang Espelage; Egon Wanke (MFCS, 2001)

How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. - Wolfgang Espelage; Frank Gurski; Egon Wanke (WG, 2001)

Stack-up algorithms for palletizing at delivery industry. - Jochen Rethmann; Egon Wanke (Eur. J. Oper. Res., 2001)

Node Replacements in Embedding Normal Form. - Konstantin Skodinis; Egon Wanke (J. Comput. Syst. Sci., 2002)

Deciding Clique-Width for Graphs of Bounded Tree-Width. - Wolfgang Espelage; Frank Gurski; Egon Wanke (J. Graph Algorithms Appl., 2003)

Movement minimization for unit distances in conveyor flow shop processing. - Wolfgang Espelage; Egon Wanke (Math. Methods Oper. Res., 2003)

Oriented Paths in Mixed Graphs. - Egon Wanke; Rolf Kötter (ISAAC, 2004)

Minimizing NLC-Width is NP-Complete. - Frank Gurski; Egon Wanke (WG, 2005)

A linear time approximation algorithm for movement minimization in conveyor flow shop processing. - Wolfgang Espelage; Egon Wanke (Eur. J. Oper. Res., 2005)

On the relationship between NLC-width and linear NLC-width. - Frank Gurski; Egon Wanke (Theor. Comput. Sci., 2005)

A Connectivity Rating for Vertices in Networks. - Marco Abraham; Rolf Kötter; Antje Krumnack; Egon Wanke (IFIP TCS, 2006)

Vertex disjoint paths on clique-width bounded graphs. - Frank Gurski; Egon Wanke (Theor. Comput. Sci., 2006)

The Clique-Width of Tree-Power and Leaf-Power Graphs. - Frank Gurski; Egon Wanke (WG, 2007)

A local characterization of bounded clique-width for line graphs. - Frank Gurski; Egon Wanke (Discret. Math., 2007)

Line graphs of bounded clique-width. - Frank Gurski; Egon Wanke (Discret. Math., 2007)

Shapley ratings in brain networks. - Rolf Kötter; Andrew T. Reid; Antje Krumnack; Egon Wanke; Olaf Sporns (Frontiers Neuroinformatics, 2007)

Deducing logical relationships between spatially registered cortical parcellations under conditions of uncertainty. - Gleb Bezgin; Egon Wanke; Antje Krumnack; Rolf Kötter (Neural Networks, 2008)

On Module-Composed Graphs. - Frank Gurski; Egon Wanke (WG, 2009)

The NLC-width and clique-width for powers of graphs of bounded tree-width. - Frank Gurski; Egon Wanke (Discret. Appl. Math., 2009)

Optimization of cortical hierarchies with continuous scales and ranges. - Andrew T. Reid; Antje Krumnack; Egon Wanke; Rolf Kötter (NeuroImage, 2009)

Exakte Algorithmen für schwere Graphenprobleme. - Frank Gurski; Irene Rothe; Jörg Rothe; Egon Wanke (Springer, 2010)

Brief announcement: complexity and solution of the send-receive correlation problem. - Benito van der Zander; Egon Wanke; Wolfgang Kiess; Björn Scheuermann 001 (PODC, 2010)

Criteria for optimizing cortical hierarchies with continuous ranges. - Antje Krumnack; Andrew T. Reid; Egon Wanke; Gleb Bezgin; Rolf Kötter (Frontiers Neuroinformatics, 2010)

Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete. - Stefan Hoffmann 002; Egon Wanke (ALGOSENSORS, 2012)

Moving Bins from Conveyor Belts onto Pallets Using FIFO Queues. - Frank Gurski; Jochen Rethmann; Egon Wanke (OR, 2013)

Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles. - Daniel Gaußmann; Stefan Hoffmann 002; Egon Wanke (CoRR, 2013)

Algorithms for Controlling Palletizers. - Frank Gurski; Jochen Rethmann; Egon Wanke (OR, 2014)

Directed Pathwidth and Palletizers. - Frank Gurski; Jochen Rethmann; Egon Wanke (COCOA, 2015)

A Practical Approach for the FIFO Stack-Up Problem. - Frank Gurski; Jochen Rethmann; Egon Wanke (MCO (2), 2015)

An Experimental Study of Algorithms for Controlling Palletizers. - Frank Gurski; Jochen Rethmann; Egon Wanke (OR, 2015)

Integer Programming Models and Parameterized Algorithms for Controlling Palletizers. - Frank Gurski; Jochen Rethmann; Egon Wanke (CoRR, 2015)

Generic Route Repair: Augmenting Wireless Ad Hoc Sensor Networks for Local Connectivity. - Stefan Hoffmann 002; Egon Wanke (IPSN, 2016)

On-Line Algorithms for Controlling Palletizers. - Frank Gurski; Jochen Rethmann; Egon Wanke (OR, 2016)

Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels. - Stefan Hoffmann 002; Egon Wanke (CoRR, 2016)

On the complexity of the FIFO stack-up problem. - Frank Gurski; Jochen Rethmann; Egon Wanke (Math. Methods Oper. Res., 2016)

Directed NLC-width. - Frank Gurski; Egon Wanke; Eda Yilmaz (Theor. Comput. Sci., 2016)

A linear time algorithm for metric dimension of cactus block graphs. - Stefan Hoffmann 002; Alina Elterman; Egon Wanke (Theor. Comput. Sci., 2016)

Computing the metric dimension by decomposing graphs into extended biconnected components. - Duygu Vietz; Stefan Hoffmann 002; Egon Wanke (CoRR, 2018)

Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements. - Stefan Hoffmann 002; Thomas Kampermann; Egon Wanke (Inf. Process. Lett., 2018)

The Fault-Tolerant Metric Dimension of Cographs. - Duygu Vietz; Egon Wanke (FCT, 2019)

Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes. - Frank Gurski; Stefan Hoffmann 002; Dominique Komander; Carolin Rehs; Jochen Rethmann; Egon Wanke (OR, 2019)

Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract). - Duygu Vietz; Stefan Hoffmann 002; Egon Wanke (WALCOM, 2019)

Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms. - Frank Gurski; Carolin Rehs; Jochen Rethmann; Egon Wanke (OR Spectr., 2019)

Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract). - Frank Gurski; Stefan Hoffmann 002; Dominique Komander; Carolin Rehs; Jochen Rethmann; Egon Wanke (SOFSEM, 2020)

On the Strong Metric Dimension of directed co-graphs. - Yannick Schmitz; Egon Wanke (CoRR, 2021)

On the strong metric dimension of composed graphs. - Marcel Wagner; Yannick Schmitz; Egon Wanke (CoRR, 2022)

Computing directed Steiner path covers. - Frank Gurski; Dominique Komander; Carolin Rehs; Jochen Rethmann; Egon Wanke (J. Comb. Optim., 2022)

The directed metric dimension of directed co-graphs. - Yannick Schmitz; Egon Wanke (CoRR, 2023)

A note on the complexity of k-metric dimension. - Yannick Schmitz; Duygu Vietz; Egon Wanke (Appl. Math. Comput., 2023)