Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Egon Wanke
2010 – today
- 2012
[c30]Stefan Hoffmann, Egon Wanke: Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete. ALGOSENSORS 2012: 90-92- 2010
- [b1]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 Kieß, Björn Scheuermann: Brief announcement: complexity and solution of the send-receive correlation problem. PODC 2010: 122-123
2000 – 2009
- 2009
- [j29]Frank Gurski, Egon Wanke: The NLC-width and clique-width for powers of graphs of bounded tree-width. Discrete Applied Mathematics 157(4): 583-595 (2009)
- [j28]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)
- [c28]
- 2007
- [j27]Frank Gurski, Egon Wanke: A local characterization of bounded clique-width for line graphs. Discrete Mathematics 307(6): 756-759 (2007)
- [j26]Frank Gurski, Egon Wanke: Line graphs of bounded clique-width. Discrete Mathematics 307(22): 2734-2754 (2007)
- [c27]
- 2006
- [j25]Frank Gurski, Egon Wanke: Vertex disjoint paths on clique-width bounded graphs. Theor. Comput. Sci. 359(1-3): 188-199 (2006)
- [c26]Marco Abraham, Rolf Kötter, Antje Krumnack, Egon Wanke: A Connectivity Rating for Vertices in Networks. IFIP TCS 2006: 283-298
- 2005
- [j24]Wolfgang Espelage, Egon Wanke: A linear time approximation algorithm for movement minimization in conveyor flow shop processing. European Journal of Operational Research 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]
- 2004
- [c24]
- [c23]
- 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. Meth. of OR 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. European Journal of Operational Research 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
- [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. Meth. of OR 51(2): 203-233 (2000)
- [j16]Wolfgang Espelage, Egon Wanke: Movement optimization in flow shop processing with buffers. Math. Meth. of OR 51(3): 495-513 (2000)
- [j15]Wolfgang Espelage, Egon Wanke: The combinatorial complexity of masterkeying. Math. Meth. of OR 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
1990 – 1999
- 1998
- [c17]Jochen Rethmann, Egon Wanke: An Optimal Algorithm for On-Line Palletizing at Delivery Industry. ISAAC 1998: 109-118
- [c16]
- 1997
- [j14]Konstantin Skodinis, Egon Wanke: The Bounded Degree Problem for eNCE Graph Grammars. Inf. Comput. 135(1): 15-35 (1997)
- [c15]
- [c14]Jochen Rethmann, Egon Wanke: An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets. WADS 1997: 440-449
- 1996
- [j13]Egon Wanke: Undecidability of Restricted Uniform Recurrence Equations. Acta Inf. 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. Journal of Computational Biology 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. Discrete Applied Mathematics 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]
- [j6]Egon Wanke: The Complexity of Connectivity Problems on Context-Free Graph Languages. J. Comput. Syst. Sci. 49(1): 57-82 (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
- [j5]Thomas Lengauer, Egon Wanke: Efficient Decision Procedures for Graph Properties on Centext-Free Graph Languages. J. ACM 40(2): 368-393 (1993)
- [c10]
- [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]
- 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
- [j4]Egon Wanke: Algorithms for Graph Problems on BNLC Structured Graphs. Inf. Comput. 94(1): 93-122 (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
1980 – 1989
- 1989
- [j3]Egon Wanke, Manfred Wiegers: Undecidability of the Bandwidth Problem on Linear Graph Languages. Inf. Process. Lett. 33(4): 193-197 (1989)
- [c3]Egon Wanke: The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract). FCT 1989: 470-479
- 1988
- [j2]Thomas Lengauer, Egon Wanke: Efficient processing of hierarchical graphs for engineering design. Bulletin of the 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)
- [c2]Thomas Lengauer, Egon Wanke: Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract). ICALP 1988: 379-393
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-29 21:51 CET by the dblp team