Search the dblp DataBase
Egon Wanke :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Egon Wanke The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract). [Citation Graph (1, 0)][DBLP ] FCT, 1989, pp:470-479 [Conf ] Thomas Lengauer , Egon Wanke Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract). [Citation Graph (1, 0)][DBLP ] ICALP, 1988, pp:379-393 [Conf ] Franz Höfting , Thomas Lengauer , Egon Wanke Processing of Hierarchically Defined Graphs and Graph Families. [Citation Graph (0, 0)][DBLP ] Data Structures and Efficient Algorithms, 1992, pp:44-69 [Conf ] Jochen Rethmann , Egon Wanke Competivive Analysis of on-line Stack-Up Algorithms. [Citation Graph (0, 0)][DBLP ] ESA, 1997, pp:402-415 [Conf ] Egon Wanke On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages. [Citation Graph (0, 0)][DBLP ] FCT, 1991, pp:415-426 [Conf ] Egon Wanke PLEXUS: Tools for Analyzing Graph Grammars. [Citation Graph (0, 0)][DBLP ] Graph-Grammars and Their Application to Computer Science, 1990, pp:68-69 [Conf ] Franz Höfting , Egon Wanke Polynomial Time Analysis of Torodial Periodic Graphs. [Citation Graph (0, 0)][DBLP ] ICALP, 1994, pp:544-555 [Conf ] Jochen Rethmann , Egon Wanke An Optimal Algorithm for On-Line Palletizing at Delivery Industry. [Citation Graph (0, 0)][DBLP ] ISAAC, 1998, pp:109-118 [Conf ] Egon Wanke , Rolf Kötter Oriented Paths in Mixed Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 2004, pp:629-643 [Conf ] Frank Gurski , Egon Wanke Vertex Disjoint Paths on Clique-Width Bounded Graphs. [Citation Graph (0, 0)][DBLP ] LATIN, 2004, pp:119-128 [Conf ] Wolfgang Espelage , Egon Wanke A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing. [Citation Graph (0, 0)][DBLP ] MFCS, 2001, pp:363-374 [Conf ] Egon Wanke Paths and Cycles in Finite Periodic Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 1993, pp:751-760 [Conf ] Wolfgang Espelage , Egon Wanke Movement minimization in conveyor flow shop processing. [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:233-234 [Conf ] Franz Höfting , Egon Wanke Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs. [Citation Graph (0, 0)][DBLP ] SODA, 1993, pp:493-499 [Conf ] Franz Höfting , Egon Wanke , Aurel Balmosan , Curd Bergmann 1st Grade - A System for Implementation, Testing and Animation of Graph Algorithms. [Citation Graph (0, 0)][DBLP ] STACS, 1993, pp:706-707 [Conf ] Egon Wanke PLEXUS: A System for Implementing Hierarchical Graph Algorithms. [Citation Graph (0, 0)][DBLP ] STACS, 1988, pp:403-404 [Conf ] Konstantin Skodinis , Egon Wanke The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars. [Citation Graph (0, 0)][DBLP ] TAGT, 1994, pp:211-224 [Conf ] Konstantin Skodinis , Egon Wanke Neighborhood-Preserving Node Replacements. [Citation Graph (0, 0)][DBLP ] TAGT, 1998, pp:45-58 [Conf ] Wolfgang Espelage , Frank Gurski , Egon Wanke Deciding Clique-Width for Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP ] WADS, 2001, pp:87-98 [Conf ] Jochen Rethman , Egon Wanke An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets. [Citation Graph (0, 0)][DBLP ] WADS, 1997, pp:440-449 [Conf ] Wolfgang Espelage , Frank Gurski , Egon Wanke How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. [Citation Graph (0, 0)][DBLP ] WG, 2001, pp:117-128 [Conf ] Frank Gurski , Egon Wanke The Tree-Width of Clique-Width Bounded Graphs Without Kn, n . [Citation Graph (0, 0)][DBLP ] WG, 2000, pp:196-205 [Conf ] Frank Gurski , Egon Wanke Minimizing NLC-Width is NP-Complete. [Citation Graph (0, 0)][DBLP ] WG, 2005, pp:69-80 [Conf ] Konstantin Skodinis , Egon Wanke Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages. [Citation Graph (0, 0)][DBLP ] WG, 1994, pp:180-192 [Conf ] Egon Wanke Bounded Tree-Width and LOGCFL. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:33-44 [Conf ] Egon Wanke Undecidability of Restricted Uniform Recurrence Equations. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1996, v:33, n:5, pp:463-475 [Journal ] Egon Wanke k-NLC Graphs and Polynomial Algorithms. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:54, n:2-3, pp:251-266 [Journal ] Frank Gurski , Egon Wanke A local characterization of bounded clique-width for line graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:6, pp:756-759 [Journal ] Thomas Lengauer , Egon Wanke Efficient processing of hierarchical graphs for engineering design. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1988, v:35, n:, pp:143-157 [Journal ] Konstantin Skodinis , Egon Wanke The Bounded Degree Problem for eNCE Graph Grammars. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1997, v:135, n:1, pp:15-35 [Journal ] Egon Wanke Algorithms for Graph Problems on BNLC Structured Graphs [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1991, v:94, n:1, pp:93-122 [Journal ] Egon Wanke On the Decidability of Certain Integer Subgraph Problems on Context-Free Graph Languages [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1994, v:113, n:1, pp:26-49 [Journal ] Egon Wanke , Manfred Wiegers Undecidability of the Bandwidth Problem on Linear Graph Languages. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:4, pp:193-197 [Journal ] Thomas Lengauer , Egon Wanke Efficient Decision Procedures for Graph Properties on Centext-Free Graph Languages. [Citation Graph (0, 0)][DBLP ] J. ACM, 1993, v:40, n:2, pp:368-393 [Journal ] Franz Höfting , Egon Wanke Polynomial-Time Analysis of Toroidal Periodic Graphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2000, v:34, n:1, pp:14-39 [Journal ] Egon Wanke Bounded Tree-Width and LOGCFL. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1994, v:16, n:3, pp:470-491 [Journal ] Ina Koch , Thomas Lengauer , Egon Wanke An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein Structures. [Citation Graph (0, 0)][DBLP ] Journal of Computational Biology, 1996, v:3, n:2, pp:289-306 [Journal ] Konstantin Skodinis , Egon Wanke Node Replacements in Embedding Normal Form. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2002, v:65, n:2, pp:351-376 [Journal ] Konstantin Skodinis , Egon Wanke Emptiness Problems of eNCE Graph Languages. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1995, v:51, n:3, pp:472-485 [Journal ] Egon Wanke The Complexity of Connectivity Problems on Context-Free Graph Languages. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1994, v:49, n:1, pp:57-82 [Journal ] Wolfgang Espelage , Frank Gurski , Egon Wanke Deciding Clique-Width for Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 2003, v:7, n:2, pp:141-180 [Journal ] Franz Höfting , Egon Wanke Minimum Cost Paths in Periodic Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:5, pp:1051-1067 [Journal ] Thomas Lengauer , Egon Wanke Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:6, pp:1063-1080 [Journal ] Frank Gurski , Egon Wanke On the relationship between NLC-width and linear NLC-width. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:347, n:1-2, pp:76-89 [Journal ] Frank Gurski , Egon Wanke Vertex disjoint paths on clique-width bounded graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:359, n:1-3, pp:188-199 [Journal ] Wolfgang Espelage , Egon Wanke A linear time approximation algorithm for movement minimization in conveyor flow shop processing. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:160, n:2, pp:485-500 [Journal ] A Connectivity Rating for Vertices in Networks. [Citation Graph (, )][DBLP ] Brief announcement: complexity and solution of the send-receive correlation problem. [Citation Graph (, )][DBLP ] The Clique-Width of Tree-Power and Leaf-Power Graphs. [Citation Graph (, )][DBLP ] On Module-Composed Graphs. [Citation Graph (, )][DBLP ] The NLC-width and clique-width for powers of graphs of bounded tree-width. [Citation Graph (, )][DBLP ] Line graphs of bounded clique-width. [Citation Graph (, )][DBLP ] Search in 0.051secs, Finished in 0.053secs