Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEgon Wanke
Person information
- affiliation: University of Düsseldorf, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2010
[b2]Frank Gurski, Irene Rothe, Jörg Rothe, Egon Wanke:
Exakte Algorithmen für schwere Graphenprobleme. eXamen.press, Springer 2010, ISBN 978-3-642-04499-1, pp. I-XII, 1-331- 1989
- [b1]Egon Wanke:
Algorithmen und Komplexitätsanalyse für die Verarbeitung hierarchisch definierter Graphen und hierarchisch definierter Graphfamilien. University of Paderborn, Germany, 1989, pp. 1-93
Journal Articles
- 2023
- [j39]Yannick Schmitz, Duygu Vietz, Egon Wanke:
A note on the complexity of k-metric dimension. Appl. Math. Comput. 457: 128204 (2023) - 2022
- [j38]Frank Gurski, Dominique Komander, Carolin Rehs
, Jochen Rethmann, Egon Wanke:
Computing directed Steiner path covers. J. Comb. Optim. 43(2): 402-431 (2022) - 2019
- [j37]Frank Gurski, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms. OR Spectr. 41(2): 581-611 (2019) - 2018
- [j36]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: 25-29 (2018) - 2016
- [j35]Frank Gurski, Jochen Rethmann, Egon Wanke:
On the complexity of the FIFO stack-up problem. Math. Methods Oper. Res. 83(1): 33-52 (2016) - [j34]Frank Gurski, Egon Wanke, Eda Yilmaz:
Directed NLC-width. Theor. Comput. Sci. 616: 1-17 (2016) - [j33]Stefan Hoffmann, Alina Elterman, Egon Wanke:
A linear time algorithm for metric dimension of cactus block graphs. Theor. Comput. Sci. 630: 43-62 (2016) - 2010
- [j32]Antje Krumnack, Andrew T. Reid, Egon Wanke, Gleb Bezgin, Rolf Kötter:
Criteria for optimizing cortical hierarchies with continuous ranges. Frontiers Neuroinformatics 4: 7 (2010) - 2009
- [j31]Frank Gurski, Egon Wanke:
The NLC-width and clique-width for powers of graphs of bounded tree-width. Discret. Appl. Math. 157(4): 583-595 (2009) - [j30]Andrew T. Reid, Antje Krumnack, Egon Wanke, Rolf Kötter:
Optimization of cortical hierarchies with continuous scales and ranges. NeuroImage 47(2): 611-617 (2009) - 2008
- [j29]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): 1132-1145 (2008) - 2007
- [j28]Frank Gurski, Egon Wanke:
A local characterization of bounded clique-width for line graphs. Discret. Math. 307(6): 756-759 (2007) - [j27]Frank Gurski, Egon Wanke:
Line graphs of bounded clique-width. Discret. Math. 307(22): 2734-2754 (2007) - [j26]Rolf Kötter, Andrew T. Reid, Antje Krumnack, Egon Wanke, Olaf Sporns:
Shapley ratings in brain networks. Frontiers Neuroinformatics 1: 2 (2007) - 2006
- [j25]Frank Gurski, Egon Wanke:
Vertex disjoint paths on clique-width bounded graphs. Theor. Comput. Sci. 359(1-3): 188-199 (2006) - 2005
- [j24]Wolfgang Espelage, Egon Wanke:
A linear time approximation algorithm for movement minimization in conveyor flow shop processing. Eur. J. Oper. Res. 160(2): 485-500 (2005) - [j23]Frank Gurski, Egon Wanke:
On the relationship between NLC-width and linear NLC-width. Theor. Comput. Sci. 347(1-2): 76-89 (2005) - 2003
- [j22]Wolfgang Espelage, Frank Gurski, Egon Wanke:
Deciding Clique-Width for Graphs of Bounded Tree-Width. J. Graph Algorithms Appl. 7(2): 141-180 (2003) - [j21]Wolfgang Espelage, Egon Wanke:
Movement minimization for unit distances in conveyor flow shop processing. Math. Methods Oper. Res. 57(2): 173-206 (2003) - 2002
- [j20]Konstantin Skodinis, Egon Wanke:
Node Replacements in Embedding Normal Form. J. Comput. Syst. Sci. 65(2): 351-376 (2002) - 2001
- [j19]Jochen Rethmann, Egon Wanke:
Stack-up algorithms for palletizing at delivery industry. Eur. J. Oper. Res. 128(1): 74-97 (2001) - 2000
- [j18]Franz Höfting, Egon Wanke:
Polynomial-Time Analysis of Toroidal Periodic Graphs. J. Algorithms 34(1): 14-39 (2000) - [j17]Jochen Rethmann, Egon Wanke:
An approximation algorithm for the stack-up problem. Math. Methods Oper. Res. 51(2): 203-233 (2000) - [j16]Wolfgang Espelage, Egon Wanke:
Movement optimization in flow shop processing with buffers. Math. Methods Oper. Res. 51(3): 495-513 (2000) - [j15]Wolfgang Espelage, Egon Wanke:
The combinatorial complexity of masterkeying. Math. Methods Oper. Res. 52(2): 325-348 (2000) - 1997
- [j14]Konstantin Skodinis, Egon Wanke:
The Bounded Degree Problem for eNCE Graph Grammars. Inf. Comput. 135(1): 15-35 (1997) - 1996
- [j13]Egon Wanke:
Undecidability of Restricted Uniform Recurrence Equations. Acta Informatica 33(5): 463-475 (1996) - [j12]Ina Koch, Thomas Lengauer, Egon Wanke:
An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein Structures. J. Comput. Biol. 3(2): 289-306 (1996) - 1995
- [j11]Konstantin Skodinis, Egon Wanke:
Emptiness Problems of eNCE Graph Languages. J. Comput. Syst. Sci. 51(3): 472-485 (1995) - [j10]Franz Höfting, Egon Wanke:
Minimum Cost Paths in Periodic Graphs. SIAM J. Comput. 24(5): 1051-1067 (1995) - 1994
- [j9]Egon Wanke:
k-NLC Graphs and Polynomial Algorithms. Discret. Appl. Math. 54(2-3): 251-266 (1994) - [j8]Egon Wanke:
On the Decidability of Certain Integer Subgraph Problems on Context-Free Graph Languages. Inf. Comput. 113(1): 26-49 (1994) - [j7]Egon Wanke:
Bounded Tree-Width and LOGCFL. J. Algorithms 16(3): 470-491 (1994) - [j6]Egon Wanke:
The Complexity of Connectivity Problems on Context-Free Graph Languages. J. Comput. Syst. Sci. 49(1): 57-82 (1994) - 1993
- [j5]Thomas Lengauer, Egon Wanke:
Efficient Decision Procedures for Graph Properties on Centext-Free Graph Languages. J. ACM 40(2): 368-393 (1993) - 1991
- [j4]Egon Wanke:
Algorithms for Graph Problems on BNLC Structured Graphs. Inf. Comput. 94(1): 93-122 (1991) - 1989
- [j3]Egon Wanke, Manfred Wiegers:
Undecidability of the Bandwidth Problem on Linear Graph Languages. Inf. Process. Lett. 33(4): 193-197 (1989) - 1988
- [j2]Thomas Lengauer, Egon Wanke:
Efficient processing of hierarchical graphs for engineering design. Bull. EATCS 35: 143-157 (1988) - [j1]Thomas Lengauer, Egon Wanke:
Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs. SIAM J. Comput. 17(6): 1063-1080 (1988)
Conference and Workshop Papers
- 2020
- [c41]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: 556-565 - 2019
- [c40]Duygu Vietz, Egon Wanke:
The Fault-Tolerant Metric Dimension of Cographs. FCT 2019: 350-364 - [c39]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: 331-338 - [c38]Duygu Vietz, Stefan Hoffmann, Egon Wanke:
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract). WALCOM 2019: 175-187 - 2016
- [c37]Stefan Hoffmann, Egon Wanke:
Generic Route Repair: Augmenting Wireless Ad Hoc Sensor Networks for Local Connectivity. IPSN 2016: 12:1-12:10 - [c36]Frank Gurski, Jochen Rethmann, Egon Wanke:
On-Line Algorithms for Controlling Palletizers. OR 2016: 119-125 - 2015
- [c35]Frank Gurski, Jochen Rethmann, Egon Wanke:
Directed Pathwidth and Palletizers. COCOA 2015: 31-44 - [c34]Frank Gurski, Jochen Rethmann, Egon Wanke:
A Practical Approach for the FIFO Stack-Up Problem. MCO (2) 2015: 141-152 - [c33]Frank Gurski, Jochen Rethmann, Egon Wanke:
An Experimental Study of Algorithms for Controlling Palletizers. OR 2015: 27-34 - 2014
- [c32]Frank Gurski, Jochen Rethmann, Egon Wanke:
Algorithms for Controlling Palletizers. OR 2014: 197-203 - 2013
- [c31]Frank Gurski, Jochen Rethmann, Egon Wanke:
Moving Bins from Conveyor Belts onto Pallets Using FIFO Queues. OR 2013: 185-191 - 2012
- [c30]Stefan Hoffmann, Egon Wanke:
Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete. ALGOSENSORS 2012: 90-92 - 2010
- [c29]Benito van der Zander, Egon Wanke, Wolfgang Kiess, Björn Scheuermann:
Brief announcement: complexity and solution of the send-receive correlation problem. PODC 2010: 122-123 - 2009
- [c28]Frank Gurski, Egon Wanke:
On Module-Composed Graphs. WG 2009: 166-177 - 2007
- [c27]Frank Gurski, Egon Wanke:
The Clique-Width of Tree-Power and Leaf-Power Graphs. WG 2007: 76-85 - 2006
- [c26]Marco Abraham, Rolf Kötter, Antje Krumnack, Egon Wanke:
A Connectivity Rating for Vertices in Networks. IFIP TCS 2006: 283-298 - 2005
- [c25]Frank Gurski, Egon Wanke:
Minimizing NLC-Width is NP-Complete. WG 2005: 69-80 - 2004
- [c24]Egon Wanke, Rolf Kötter:
Oriented Paths in Mixed Graphs. ISAAC 2004: 629-643 - [c23]Frank Gurski, Egon Wanke:
Vertex Disjoint Paths on Clique-Width Bounded Graphs. LATIN 2004: 119-128 - 2001
- [c22]Wolfgang Espelage, Egon Wanke:
A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing. MFCS 2001: 363-374 - [c21]Wolfgang Espelage, Frank Gurski, Egon Wanke:
Deciding Clique-Width for Graphs of Bounded Tree-Width. WADS 2001: 87-98 - [c20]Wolfgang Espelage, Frank Gurski, Egon Wanke:
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. WG 2001: 117-128 - 2000
- [c19]Wolfgang Espelage, Egon Wanke:
Movement minimization in conveyor flow shop processing. SODA 2000: 233-234 - [c18]Frank Gurski, Egon Wanke:
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n. WG 2000: 196-205 - 1998
- [c17]Jochen Rethmann, Egon Wanke:
An Optimal Algorithm for On-Line Palletizing at Delivery Industry. ISAAC 1998: 109-118 - [c16]Konstantin Skodinis, Egon Wanke:
Neighborhood-Preserving Node Replacements. TAGT 1998: 45-58 - 1997
- [c15]Jochen Rethmann, Egon Wanke:
Competivive Analysis of on-line Stack-Up Algorithms. ESA 1997: 402-415 - [c14]Jochen Rethmann, Egon Wanke:
An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets. WADS 1997: 440-449 - 1994
- [c13]Franz Höfting, Egon Wanke:
Polynomial Time Analysis of Torodial Periodic Graphs. ICALP 1994: 544-555 - [c12]Konstantin Skodinis, Egon Wanke:
The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars. TAGT 1994: 211-224 - [c11]Konstantin Skodinis, Egon Wanke:
Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages. WG 1994: 180-192 - 1993
- [c10]Egon Wanke:
Paths and Cycles in Finite Periodic Graphs. MFCS 1993: 751-760 - [c9]Franz Höfting, Egon Wanke:
Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs. SODA 1993: 493-499 - [c8]Franz Höfting, Egon Wanke, Aurel Balmosan, Curd Bergmann:
1st Grade - A System for Implementation, Testing and Animation of Graph Algorithms. STACS 1993: 706-707 - [c7]Egon Wanke:
Bounded Tree-Width and LOGCFL. WG 1993: 33-44 - 1992
- [c6]Franz Höfting, Thomas Lengauer, Egon Wanke:
Processing of Hierarchically Defined Graphs and Graph Families. Data Structures and Efficient Algorithms 1992: 44-69 - 1991
- [c5]Egon Wanke:
On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages. FCT 1991: 415-426 - 1990
- [c4]Egon Wanke:
PLEXUS: Tools for Analyzing Graph Grammars. Graph-Grammars and Their Application to Computer Science 1990: 68-69 - 1989
- [c3]Egon Wanke:
The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract). FCT 1989: 470-479 - 1988
- [c2]Thomas Lengauer, Egon Wanke:
Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract). ICALP 1988: 379-393 - [c1]Egon Wanke:
PLEXUS: A System for Implementing Hierarchical Graph Algorithms. STACS 1988: 403-404
Informal and Other Publications
- 2023
- [i12]Yannick Schmitz, Egon Wanke:
The directed metric dimension of directed co-graphs. CoRR abs/2306.08594 (2023) - 2022
- [i11]Marcel Wagner, Yannick Schmitz, Egon Wanke:
On the strong metric dimension of composed graphs. CoRR abs/2212.04166 (2022) - 2021
- [i10]Yannick Schmitz, Duygu Vietz, Egon Wanke:
A note on the complexity of k-Metric Dimension. CoRR abs/2101.12018 (2021) - [i9]Yannick Schmitz, Egon Wanke:
On the Strong Metric Dimension of directed co-graphs. CoRR abs/2111.13054 (2021) - 2020
- [i8]Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Computing Directed Steiner Path Covers. CoRR abs/2012.12232 (2020) - 2019
- [i7]Duygu Vietz, Egon Wanke:
The Fault-Tolerant Metric Dimension of Cographs. CoRR abs/1904.04243 (2019) - 2018
- [i6]Duygu Vietz, Stefan Hoffmann, Egon Wanke:
Computing the metric dimension by decomposing graphs into extended biconnected components. CoRR abs/1806.10389 (2018) - 2016
- [i5]Stefan Hoffmann, Egon Wanke:
Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels. CoRR abs/1605.01752 (2016) - 2015
- [i4]Frank Gurski, Jochen Rethmann, Egon Wanke:
Integer Programming Models and Parameterized Algorithms for Controlling Palletizers. CoRR abs/1509.07278 (2015) - 2013
- [i3]Stefan Hoffmann, Egon Wanke:
Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete. CoRR abs/1306.2187 (2013) - [i2]Frank Gurski, Jochen Rethmann, Egon Wanke:
Complexity of the FIFO Stack-Up Problem. CoRR abs/1307.1915 (2013) - [i1]Daniel Gaußmann, Stefan Hoffmann, Egon Wanke:
Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles. CoRR abs/1307.1994 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-06 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
