Остановите войну!
for scientists:
default search action
Egon Wanke
- > Home > Persons > Egon Wanke
Publications
- 2023
- [j39]Yannick Schmitz, Duygu Vietz, Egon Wanke:
A note on the complexity of k-metric dimension. Appl. Math. Comput. 457: 128204 (2023) - [i12]Yannick Schmitz, Egon Wanke:
The directed metric dimension of directed co-graphs. CoRR abs/2306.08594 (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) - [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
- [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 - [i8]Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Computing Directed Steiner Path Covers. CoRR abs/2012.12232 (2020) - 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) - [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 - [i7]Duygu Vietz, Egon Wanke:
The Fault-Tolerant Metric Dimension of Cographs. CoRR abs/1904.04243 (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) - [i6]Duygu Vietz, Stefan Hoffmann, Egon Wanke:
Computing the metric dimension by decomposing graphs into extended biconnected components. CoRR abs/1806.10389 (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) - [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 - [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
- [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 - [i4]Frank Gurski, Jochen Rethmann, Egon Wanke:
Integer Programming Models and Parameterized Algorithms for Controlling Palletizers. CoRR abs/1509.07278 (2015) - 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 - [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) - 2012
- [c30]Stefan Hoffmann, Egon Wanke:
Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete. ALGOSENSORS 2012: 90-92 - 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 - [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
- [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) - [c28]Frank Gurski, Egon Wanke:
On Module-Composed Graphs. WG 2009: 166-177 - 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) - [c27]Frank Gurski, Egon Wanke:
The Clique-Width of Tree-Power and Leaf-Power Graphs. WG 2007: 76-85 - 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) - [c25]Frank Gurski, Egon Wanke:
Minimizing NLC-Width is NP-Complete. WG 2005: 69-80 - 2004
- [c23]Frank Gurski, Egon Wanke:
Vertex Disjoint Paths on Clique-Width Bounded Graphs. LATIN 2004: 119-128 - 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) - 2001
- [j19]Jochen Rethmann, Egon Wanke:
Stack-up algorithms for palletizing at delivery industry. Eur. J. Oper. Res. 128(1): 74-97 (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
- [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) - [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 - 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
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-04-25 02:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint