Egon Wanke

94 papers A* 5A 3B 19C 2Journal 51Unranked 12
YearRankTypeTitle / Venue / Authors
2023 J jnl
A note on the complexity of k-metric dimension.
Appl. Math. Comput.
Yannick Schmitz, Duygu Vietz, Egon Wanke
2023 J jnl
The directed metric dimension of directed co-graphs.
CoRR
Yannick Schmitz, Egon Wanke
2022 J jnl
Computing directed Steiner path covers.
J. Comb. Optim.
Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
2022 J jnl
On the strong metric dimension of composed graphs.
CoRR
Marcel Wagner, Yannick Schmitz, Egon Wanke
2021 J jnl
A note on the complexity of k-Metric Dimension.
CoRR
Yannick Schmitz, Duygu Vietz, Egon Wanke
2021 J jnl
On the Strong Metric Dimension of directed co-graphs.
CoRR
Yannick Schmitz, Egon Wanke
2020 B conf
Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract).
SOFSEM
Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
2020 J jnl
Computing Directed Steiner Path Covers.
CoRR
Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
2019 B conf
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract).
WALCOM
Duygu Vietz, Stefan Hoffmann, Egon Wanke
2019 J jnl
Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms.
OR Spectr.
Frank Gurski, Carolin Rehs, Jochen Rethmann, Egon Wanke
2019 — conf
Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes.
OR
Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
2019 B conf
The Fault-Tolerant Metric Dimension of Cographs.
FCT
Duygu Vietz, Egon Wanke
2019 J jnl
The Fault-Tolerant Metric Dimension of Cographs.
CoRR
Duygu Vietz, Egon Wanke
2018 J jnl
Computing the metric dimension by decomposing graphs into extended biconnected components.
CoRR
Duygu Vietz, Stefan Hoffmann, Egon Wanke
2018 J jnl
Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements.
Inf. Process. Lett.
Stefan Hoffmann, Thomas Kampermann, Egon Wanke
2016 J jnl
A linear time algorithm for metric dimension of cactus block graphs.
Theor. Comput. Sci.
Stefan Hoffmann, Alina Elterman, Egon Wanke
2016 J jnl
Directed NLC-width.
Theor. Comput. Sci.
Frank Gurski, Egon Wanke, Eda Yilmaz
2016 — conf
Generic Route Repair: Augmenting Wireless Ad Hoc Sensor Networks for Local Connectivity.
IPSN
Stefan Hoffmann, Egon Wanke
2016 J jnl
Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels.
CoRR
Stefan Hoffmann, Egon Wanke
2016 J jnl
On the complexity of the FIFO stack-up problem.
Math. Methods Oper. Res.
Frank Gurski, Jochen Rethmann, Egon Wanke
2016 — conf
On-Line Algorithms for Controlling Palletizers.
OR
Frank Gurski, Jochen Rethmann, Egon Wanke
2015 — conf
A Practical Approach for the FIFO Stack-Up Problem.
MCO (2)
Frank Gurski, Jochen Rethmann, Egon Wanke
2015 — conf
An Experimental Study of Algorithms for Controlling Palletizers.
OR
Frank Gurski, Jochen Rethmann, Egon Wanke
2015 C conf
Directed Pathwidth and Palletizers.
COCOA
Frank Gurski, Jochen Rethmann, Egon Wanke
2015 J jnl
Integer Programming Models and Parameterized Algorithms for Controlling Palletizers.
CoRR
Frank Gurski, Jochen Rethmann, Egon Wanke
2014 — conf
Algorithms for Controlling Palletizers.
OR
Frank Gurski, Jochen Rethmann, Egon Wanke
2013 J jnl
Complexity of the FIFO Stack-Up Problem.
CoRR
Frank Gurski, Jochen Rethmann, Egon Wanke
2013 J jnl
Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles.
CoRR
Daniel Gaußmann, Stefan Hoffmann, Egon Wanke
2013 J jnl
Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete.
CoRR
Stefan Hoffmann, Egon Wanke
2013 — conf
Moving Bins from Conveyor Belts onto Pallets Using FIFO Queues.
OR
Frank Gurski, Jochen Rethmann, Egon Wanke
2012 C conf
Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete.
ALGOSENSORS
Stefan Hoffmann, Egon Wanke
2010 A* conf
Brief announcement: complexity and solution of the send-receive correlation problem.
PODC
Benito van der Zander, Egon Wanke, Wolfgang Kiess, Björn Scheuermann
2010 J jnl
Criteria for optimizing cortical hierarchies with continuous ranges.
Frontiers Neuroinformatics
Antje Krumnack, Andrew T. Reid, Egon Wanke, Gleb Bezgin, Rolf Kötter
2010 — book
Exakte Algorithmen für schwere Graphenprobleme.
Frank Gurski, Irene Rothe, Jörg Rothe, Egon Wanke
2009 B conf
On Module-Composed Graphs.
WG
Frank Gurski, Egon Wanke
2009 J jnl
Optimization of cortical hierarchies with continuous scales and ranges.
NeuroImage
Andrew T. Reid, Antje Krumnack, Egon Wanke, Rolf Kötter
2009 J jnl
The NLC-width and clique-width for powers of graphs of bounded tree-width.
Discret. Appl. Math.
Frank Gurski, Egon Wanke
2008 J jnl
Deducing logical relationships between spatially registered cortical parcellations under conditions of uncertainty.
Neural Networks
Gleb Bezgin, Egon Wanke, Antje Krumnack, Rolf Kötter
2007 J jnl
A local characterization of bounded clique-width for line graphs.
Discret. Math.
Frank Gurski, Egon Wanke
2007 J jnl
Line graphs of bounded clique-width.
Discret. Math.
Frank Gurski, Egon Wanke
2007 J jnl
Shapley ratings in brain networks.
Frontiers Neuroinformatics
Rolf Kötter, Andrew T. Reid, Antje Krumnack, Egon Wanke, Olaf Sporns
2007 B conf
The Clique-Width of Tree-Power and Leaf-Power Graphs.
WG
Frank Gurski, Egon Wanke
2006 — conf
A Connectivity Rating for Vertices in Networks.
IFIP TCS
Marco Abraham, Rolf Kötter, Antje Krumnack, Egon Wanke
2006 J jnl
Vertex disjoint paths on clique-width bounded graphs.
Theor. Comput. Sci.
Frank Gurski, Egon Wanke
2005 J jnl
A linear time approximation algorithm for movement minimization in conveyor flow shop processing.
Eur. J. Oper. Res.
Wolfgang Espelage, Egon Wanke
2005 B conf
Minimizing NLC-Width is NP-Complete.
WG
Frank Gurski, Egon Wanke
2005 J jnl
On the relationship between NLC-width and linear NLC-width.
Theor. Comput. Sci.
Frank Gurski, Egon Wanke
2004 B conf
Oriented Paths in Mixed Graphs.
ISAAC
Egon Wanke, Rolf Kötter
2004 B conf
Vertex Disjoint Paths on Clique-Width Bounded Graphs.
LATIN
Frank Gurski, Egon Wanke
2003 J jnl
Deciding Clique-Width for Graphs of Bounded Tree-Width.
J. Graph Algorithms Appl.
Wolfgang Espelage, Frank Gurski, Egon Wanke
2003 J jnl
Movement minimization for unit distances in conveyor flow shop processing.
Math. Methods Oper. Res.
Wolfgang Espelage, Egon Wanke
2002 J jnl
Node Replacements in Embedding Normal Form.
J. Comput. Syst. Sci.
Konstantin Skodinis, Egon Wanke
2001 B conf
A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing.
MFCS
Wolfgang Espelage, Egon Wanke
2001 B conf
Deciding Clique-Width for Graphs of Bounded Tree-Width.
WADS
Wolfgang Espelage, Frank Gurski, Egon Wanke
2001 B conf
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.
WG
Wolfgang Espelage, Frank Gurski, Egon Wanke
2001 J jnl
Stack-up algorithms for palletizing at delivery industry.
Eur. J. Oper. Res.
Jochen Rethmann, Egon Wanke
2000 J jnl
An approximation algorithm for the stack-up problem.
Math. Methods Oper. Res.
Jochen Rethmann, Egon Wanke
2000 A* conf
Movement minimization in conveyor flow shop processing.
SODA
Wolfgang Espelage, Egon Wanke
2000 J jnl
Movement optimization in flow shop processing with buffers.
Math. Methods Oper. Res.
Wolfgang Espelage, Egon Wanke
2000 J jnl
Polynomial-Time Analysis of Toroidal Periodic Graphs.
J. Algorithms
Franz Höfting, Egon Wanke
2000 B conf
The Tree-Width of Clique-Width Bounded Graphs Without
WG
Frank Gurski, Egon Wanke
2000 J jnl
The combinatorial complexity of masterkeying.
Math. Methods Oper. Res.
Wolfgang Espelage, Egon Wanke
1998 B conf
An Optimal Algorithm for On-Line Palletizing at Delivery Industry.
ISAAC
Jochen Rethmann, Egon Wanke
1998 — conf
Neighborhood-Preserving Node Replacements.
TAGT
Konstantin Skodinis, Egon Wanke
1997 B conf
An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets.
WADS
Jochen Rethmann, Egon Wanke
1997 A conf
Competivive Analysis of on-line Stack-Up Algorithms.
ESA
Jochen Rethmann, Egon Wanke
1997 J jnl
The Bounded Degree Problem for eNCE Graph Grammars.
Inf. Comput.
Konstantin Skodinis, Egon Wanke
1996 J jnl
An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein Structures.
J. Comput. Biol.
Ina Koch, Thomas Lengauer, Egon Wanke
1996 J jnl
Undecidability of Restricted Uniform Recurrence Equations.
Acta Informatica
Egon Wanke
1995 J jnl
Emptiness Problems of eNCE Graph Languages.
J. Comput. Syst. Sci.
Konstantin Skodinis, Egon Wanke
1995 J jnl
Minimum Cost Paths in Periodic Graphs.
SIAM J. Comput.
Franz Höfting, Egon Wanke
1994 J jnl
Bounded Tree-Width and LOGCFL.
J. Algorithms
Egon Wanke
1994 B conf
Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages.
WG
Konstantin Skodinis, Egon Wanke
1994 J jnl
On the Decidability of Certain Integer Subgraph Problems on Context-Free Graph Languages
Inf. Comput.
Egon Wanke
1994 A* conf
Polynomial Time Analysis of Torodial Periodic Graphs.
ICALP
Franz Höfting, Egon Wanke
1994 — conf
The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars.
TAGT
Konstantin Skodinis, Egon Wanke
1994 J jnl
The Complexity of Connectivity Problems on Context-Free Graph Languages.
J. Comput. Syst. Sci.
Egon Wanke
1994 J jnl
k-NLC Graphs and Polynomial Algorithms.
Discret. Appl. Math.
Egon Wanke
1993 A conf
1st Grade - A System for Implementation, Testing and Animation of Graph Algorithms.
STACS
Franz Höfting, Egon Wanke, Aurel Balmosan, Curd Bergmann
1993 B conf
Bounded Tree-Width and LOGCFL.
WG
Egon Wanke
1993 J jnl
Efficient Decision Procedures for Graph Properties on Centext-Free Graph Languages.
J. ACM
Thomas Lengauer, Egon Wanke
1993 B conf
Paths and Cycles in Finite Periodic Graphs.
MFCS
Egon Wanke
1993 A* conf
Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs.
SODA
Franz Höfting, Egon Wanke
1992 — conf
Processing of Hierarchically Defined Graphs and Graph Families.
Data Structures and Efficient Algorithms
Franz Höfting, Thomas Lengauer, Egon Wanke
1991 J jnl
Algorithms for Graph Problems on BNLC Structured Graphs
Inf. Comput.
Egon Wanke
1991 B conf
On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages.
FCT
Egon Wanke
1990 — conf
PLEXUS: Tools for Analyzing Graph Grammars.
Graph-Grammars and Their Application to Computer Science
Egon Wanke
1989 — —
Algorithmen und Komplexitätsanalyse für die Verarbeitung hierarchisch definierter Graphen und hierarchisch definierter Graphfamilien.
Egon Wanke
1989 B conf
The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract).
FCT
Egon Wanke
1989 J jnl
Undecidability of the Bandwidth Problem on Linear Graph Languages.
Inf. Process. Lett.
Egon Wanke, Manfred Wiegers
1988 A* conf
Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract).
ICALP
Thomas Lengauer, Egon Wanke
1988 J jnl
Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs.
SIAM J. Comput.
Thomas Lengauer, Egon Wanke
1988 J jnl
Efficient processing of hierarchical graphs for engineering design.
Bull. EATCS
Thomas Lengauer, Egon Wanke
1988 A conf
PLEXUS: A System for Implementing Hierarchical Graph Algorithms.
STACS
Egon Wanke