\(k\)-NLC graphs and polynomial algorithms. Zbl 0812.68106
Wanke, Egon |
|
1994
|
How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. Zbl 1042.68626
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon |
|
2001
|
The tree-width of clique-width bounded graphs without \(K_{n,n}\). Zbl 0988.68131
Gurski, Frank; Wanke, Egon |
|
2000
|
On the relationship between NLC-width and linear NLC-width. Zbl 1080.68086
Gurski, Frank; Wanke, Egon |
|
2005
|
Deciding clique-width for graphs of bounded tree-width. Zbl 1027.05093
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon |
|
2003
|
Line graphs of bounded clique-width. Zbl 1128.05049
Gurski, Frank; Wanke, Egon |
|
2007
|
Efficient solution of connectivity problems on hierarchically defined graphs. Zbl 0673.05085
Lengauer, Thomas; Wanke, Egon |
|
1988
|
Directed NLC-width. Zbl 1334.05166
Gurski, Frank; Wanke, Egon; Yilmaz, Eda |
|
2016
|
Vertex disjoint paths on clique-width bounded graphs. Zbl 1099.68078
Gurski, Frank; Wanke, Egon |
|
2006
|
Efficient analysis of graph properties on context-free graph languages. Zbl 0649.68076
Lengauer, Thomas; Wanke, Egon |
|
1988
|
A linear time algorithm for metric dimension of cactus block graphs. Zbl 1339.05388
Hoffmann, Stefan; Elterman, Alina; Wanke, Egon |
|
2016
|
Computing directed Steiner path covers for directed co-graphs (extended abstract). Zbl 1440.68188
Gurski, Frank; Hoffmann, Stefan; Komander, Dominique; Rehs, Carolin; Rethmann, Jochen; Wanke, Egon |
|
2020
|
Storage controlled pile-up systems, theoretical foundations. Zbl 0921.90069
Rethmann, J.; Wanke, E. |
|
1997
|
Bounded tree-width and LOGCFL. Zbl 0804.68048
Wanke, Egon |
|
1994
|
Minimizing NLC-width is NP-complete. (Extended abstract). Zbl 1171.05427
Gurski, Frank; Wanke, Egon |
|
2005
|
The NLC-width and clique-width for powers of graphs of bounded tree-width. Zbl 1173.05342
Gurski, Frank; Wanke, Egon |
|
2009
|
Efficient decision procedures for graph properties on contex-free graph languages. Zbl 0768.68085
Lengauer, Thomas; Wanke, Egon |
|
1993
|
Vertex disjoint paths on clique-width bounded graphs. Zbl 1196.68173
Gurski, Frank; Wanke, Egon |
|
2004
|
On the complexity of the FIFO stack-up problem. Zbl 1396.90073
Gurski, Frank; Rethmann, Jochen; Wanke, Egon |
|
2016
|
Stack-up algorithms for palletizing at delivery industry. Zbl 0983.90016
Rethmann, J.; Wanke, E. |
|
2001
|
Algorithms for graph problems on BNLC structured garphs. Zbl 0751.68034
Wanke, Egon |
|
1991
|
Emptiness problems of eNCE graph languages. Zbl 0839.68057
Skodinis, Konstantin; Wanke, Egon |
|
1995
|
The clique-width of tree-power and leaf-power graphs. (Extended abstract). Zbl 1141.68531
Gurski, Frank; Wanke, Egon |
|
2007
|
An approximation algorithm for the stack-up problem. Zbl 0971.90074
Rethmann, Jochen; Wanke, Egon |
|
2000
|
The bounded degree problem for eNCE graph grammars. Zbl 0879.68069
Skodinis, Konstantin; Wanke, Egon |
|
1997
|
Polynomial algorithms for minimum cost paths in periodic graphs. Zbl 0801.68133
Höfting, Franz; Wanke, Egon |
|
1993
|
Algorithms for controlling palletizers. Zbl 1342.90007
Gurski, Frank; Rethmann, Jochen; Wanke, Egon |
|
2016
|
Minimum cost paths in periodic graphs. Zbl 0839.05063
Höfting, Franz; Wanke, Egon |
|
1995
|
Neighborhood-preserving node replacements. Zbl 0958.68079
Skodinis, Konstantin; Wanke, Egon |
|
2000
|
Deciding clique-width for graphs of bounded tree-width (extended abstract). Zbl 0997.68530
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon |
|
2001
|
Paths and cycles in finite periodic graphs. Zbl 0925.05038
Wanke, Egon |
|
1993
|
The complexity of connectivity problems on context-free graph languages. Zbl 0756.68067
Wanke, Egon |
|
1989
|
Algorithms and complexity analysis for the processing of hierarchically defined graphs and hierarchically defined families of graphs.
(Algorithmen und Komplexitätsanalyse für die Verarbeitung hierarchisch definierter Graphen und hierarchisch definierter Graphfamilien.) Zbl 0772.68058
Wanke, Egon |
|
1989
|
On the decidability of certain integer subgraph problems on context-free graph languages. Zbl 0820.68067
Wanke, Egon |
|
1994
|
Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements. Zbl 1457.68218
Hoffmann, Stefan; Kampermann, Thomas; Wanke, Egon |
|
2018
|
The fault-tolerant metric dimension of cographs. Zbl 1534.68187
Vietz, Duygu; Wanke, Egon |
|
2019
|
A practical approach for the FIFO stack-up problem. Zbl 1370.90299
Gurski, Frank; Rethmann, Jochen; Wanke, Egon |
|
2015
|
Competitive analysis of on-line stack-up algorithms. Zbl 1477.68544
Rethmann, J.; Wanke, E. |
|
1997
|
Exact solutions for the Steiner path cover problem on special graph classes. Zbl 1471.90047
Gurski, Frank; Hoffmann, Stefan; Komander, Dominique; Rehs, Carolin; Rethmann, Jochen; Wanke, Egon |
|
2020
|
Directed pathwidth and palletizers. Zbl 1478.90107
Gurski, Frank; Rethmann, Jochen; Wanke, Egon |
|
2015
|
Movement minimization for unit distances in conveyor flow shop processing. Zbl 1023.90025
Espelage, W.; Wanke, E. |
|
2003
|
Storage controlled pile-up systems, theoretical foundations. Zbl 0916.90155
Rethmann, J.; Wanke, E. |
|
1997
|
An approximation algorithm for stacking up bins from a conveyer onto pallets. Zbl 1497.68574
Rethmann, J.; Wanke, E. |
|
1997
|
An experimental study of algorithms for controlling palletizers. Zbl 1375.90323
Gurski, Frank; Rethmann, Jochen; Wanke, Egon |
|
2017
|
Computing the metric dimension by decomposing graphs into extended biconnected components (extended abstract). Zbl 1522.68430
Vietz, Duygu; Hoffmann, Stefan; Wanke, Egon |
|
2019
|
Computing directed Steiner path covers for directed co-graphs (extended abstract). Zbl 1440.68188
Gurski, Frank; Hoffmann, Stefan; Komander, Dominique; Rehs, Carolin; Rethmann, Jochen; Wanke, Egon |
|
2020
|
Exact solutions for the Steiner path cover problem on special graph classes. Zbl 1471.90047
Gurski, Frank; Hoffmann, Stefan; Komander, Dominique; Rehs, Carolin; Rethmann, Jochen; Wanke, Egon |
|
2020
|
The fault-tolerant metric dimension of cographs. Zbl 1534.68187
Vietz, Duygu; Wanke, Egon |
|
2019
|
Computing the metric dimension by decomposing graphs into extended biconnected components (extended abstract). Zbl 1522.68430
Vietz, Duygu; Hoffmann, Stefan; Wanke, Egon |
|
2019
|
Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements. Zbl 1457.68218
Hoffmann, Stefan; Kampermann, Thomas; Wanke, Egon |
|
2018
|
An experimental study of algorithms for controlling palletizers. Zbl 1375.90323
Gurski, Frank; Rethmann, Jochen; Wanke, Egon |
|
2017
|
Directed NLC-width. Zbl 1334.05166
Gurski, Frank; Wanke, Egon; Yilmaz, Eda |
|
2016
|
A linear time algorithm for metric dimension of cactus block graphs. Zbl 1339.05388
Hoffmann, Stefan; Elterman, Alina; Wanke, Egon |
|
2016
|
On the complexity of the FIFO stack-up problem. Zbl 1396.90073
Gurski, Frank; Rethmann, Jochen; Wanke, Egon |
|
2016
|
Algorithms for controlling palletizers. Zbl 1342.90007
Gurski, Frank; Rethmann, Jochen; Wanke, Egon |
|
2016
|
A practical approach for the FIFO stack-up problem. Zbl 1370.90299
Gurski, Frank; Rethmann, Jochen; Wanke, Egon |
|
2015
|
Directed pathwidth and palletizers. Zbl 1478.90107
Gurski, Frank; Rethmann, Jochen; Wanke, Egon |
|
2015
|
The NLC-width and clique-width for powers of graphs of bounded tree-width. Zbl 1173.05342
Gurski, Frank; Wanke, Egon |
|
2009
|
Line graphs of bounded clique-width. Zbl 1128.05049
Gurski, Frank; Wanke, Egon |
|
2007
|
The clique-width of tree-power and leaf-power graphs. (Extended abstract). Zbl 1141.68531
Gurski, Frank; Wanke, Egon |
|
2007
|
Vertex disjoint paths on clique-width bounded graphs. Zbl 1099.68078
Gurski, Frank; Wanke, Egon |
|
2006
|
On the relationship between NLC-width and linear NLC-width. Zbl 1080.68086
Gurski, Frank; Wanke, Egon |
|
2005
|
Minimizing NLC-width is NP-complete. (Extended abstract). Zbl 1171.05427
Gurski, Frank; Wanke, Egon |
|
2005
|
Vertex disjoint paths on clique-width bounded graphs. Zbl 1196.68173
Gurski, Frank; Wanke, Egon |
|
2004
|
Deciding clique-width for graphs of bounded tree-width. Zbl 1027.05093
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon |
|
2003
|
Movement minimization for unit distances in conveyor flow shop processing. Zbl 1023.90025
Espelage, W.; Wanke, E. |
|
2003
|
How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. Zbl 1042.68626
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon |
|
2001
|
Stack-up algorithms for palletizing at delivery industry. Zbl 0983.90016
Rethmann, J.; Wanke, E. |
|
2001
|
Deciding clique-width for graphs of bounded tree-width (extended abstract). Zbl 0997.68530
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon |
|
2001
|
The tree-width of clique-width bounded graphs without \(K_{n,n}\). Zbl 0988.68131
Gurski, Frank; Wanke, Egon |
|
2000
|
An approximation algorithm for the stack-up problem. Zbl 0971.90074
Rethmann, Jochen; Wanke, Egon |
|
2000
|
Neighborhood-preserving node replacements. Zbl 0958.68079
Skodinis, Konstantin; Wanke, Egon |
|
2000
|
Storage controlled pile-up systems, theoretical foundations. Zbl 0921.90069
Rethmann, J.; Wanke, E. |
|
1997
|
The bounded degree problem for eNCE graph grammars. Zbl 0879.68069
Skodinis, Konstantin; Wanke, Egon |
|
1997
|
Competitive analysis of on-line stack-up algorithms. Zbl 1477.68544
Rethmann, J.; Wanke, E. |
|
1997
|
Storage controlled pile-up systems, theoretical foundations. Zbl 0916.90155
Rethmann, J.; Wanke, E. |
|
1997
|
An approximation algorithm for stacking up bins from a conveyer onto pallets. Zbl 1497.68574
Rethmann, J.; Wanke, E. |
|
1997
|
Emptiness problems of eNCE graph languages. Zbl 0839.68057
Skodinis, Konstantin; Wanke, Egon |
|
1995
|
Minimum cost paths in periodic graphs. Zbl 0839.05063
Höfting, Franz; Wanke, Egon |
|
1995
|
\(k\)-NLC graphs and polynomial algorithms. Zbl 0812.68106
Wanke, Egon |
|
1994
|
Bounded tree-width and LOGCFL. Zbl 0804.68048
Wanke, Egon |
|
1994
|
On the decidability of certain integer subgraph problems on context-free graph languages. Zbl 0820.68067
Wanke, Egon |
|
1994
|
Efficient decision procedures for graph properties on contex-free graph languages. Zbl 0768.68085
Lengauer, Thomas; Wanke, Egon |
|
1993
|
Polynomial algorithms for minimum cost paths in periodic graphs. Zbl 0801.68133
Höfting, Franz; Wanke, Egon |
|
1993
|
Paths and cycles in finite periodic graphs. Zbl 0925.05038
Wanke, Egon |
|
1993
|
Algorithms for graph problems on BNLC structured garphs. Zbl 0751.68034
Wanke, Egon |
|
1991
|
The complexity of connectivity problems on context-free graph languages. Zbl 0756.68067
Wanke, Egon |
|
1989
|
Algorithms and complexity analysis for the processing of hierarchically defined graphs and hierarchically defined families of graphs.
(Algorithmen und Komplexitätsanalyse für die Verarbeitung hierarchisch definierter Graphen und hierarchisch definierter Graphfamilien.) Zbl 0772.68058
Wanke, Egon |
|
1989
|
Efficient solution of connectivity problems on hierarchically defined graphs. Zbl 0673.05085
Lengauer, Thomas; Wanke, Egon |
|
1988
|
Efficient analysis of graph properties on context-free graph languages. Zbl 0649.68076
Lengauer, Thomas; Wanke, Egon |
|
1988
|