Egon Wanke

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 25

Top Venues

CoRR

Theor. Comput. Sci.

WALCOM

University of Paderborn, Germany (PHD)

Education History

University of Paderborn, Germany

PHD

Publications

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

Egon Wanke.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Egon Wanke