×

zbMATH — the first resource for mathematics

Wanke, Egon

Compute Distance To:
Author ID: wanke.egon Recent zbMATH articles by "Wanke, Egon"
Published as: Wanke, E.; Wanke, Egon
External Links: MGP
Documents Indexed: 64 Publications since 1988, including 2 Books

Publications by Year

Citations contained in zbMATH Open

39 Publications have been cited 319 times in 182 Documents Cited by Year
\(k\)-NLC graphs and polynomial algorithms. Zbl 0812.68106
Wanke, Egon
52
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
43
2001
The tree-width of clique-width bounded graphs without \(K_{n,n}\). Zbl 0988.68131
Gurski, Frank; Wanke, Egon
30
2000
On the relationship between NLC-width and linear NLC-width. Zbl 1080.68086
Gurski, Frank; Wanke, Egon
23
2005
Deciding clique-width for graphs of bounded tree-width. Zbl 1027.05093
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon
19
2003
Line graphs of bounded clique-width. Zbl 1128.05049
Gurski, Frank; Wanke, Egon
16
2007
Efficient solution of connectivity problems on hierarchically defined graphs. Zbl 0673.05085
Lengauer, Thomas; Wanke, Egon
14
1988
Vertex disjoint paths on clique-width bounded graphs. Zbl 1099.68078
Gurski, Frank; Wanke, Egon
12
2006
Efficient analysis of graph properties on context-free graph languages. Zbl 0649.68076
Lengauer, Thomas; Wanke, Egon
9
1988
Directed NLC-width. Zbl 1334.05166
Gurski, Frank; Wanke, Egon; Yilmaz, Eda
8
2016
Minimizing NLC-width is NP-complete. (Extended abstract). Zbl 1171.05427
Gurski, Frank; Wanke, Egon
8
2005
Storage controlled pile-up systems, theoretical foundations. Zbl 0921.90069
Rethmann, J.; Wanke, E.
7
1997
Bounded tree-width and LOGCFL. Zbl 0804.68048
Wanke, Egon
7
1994
The NLC-width and clique-width for powers of graphs of bounded tree-width. Zbl 1173.05342
Gurski, Frank; Wanke, Egon
6
2009
Vertex disjoint paths on clique-width bounded graphs. Zbl 1196.68173
Gurski, Frank; Wanke, Egon
6
2004
Stack-up algorithms for palletizing at delivery industry. Zbl 0983.90016
Rethmann, J.; Wanke, E.
5
2001
Emptiness problems of eNCE graph languages. Zbl 0839.68057
Skodinis, Konstantin; Wanke, Egon
5
1995
Efficient decision procedures for graph properties on contex-free graph languages. Zbl 0768.68085
Lengauer, Thomas; Wanke, Egon
5
1993
On the complexity of the FIFO stack-up problem. Zbl 1396.90073
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
4
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
3
2020
A linear time algorithm for metric dimension of cactus block graphs. Zbl 1339.05388
Hoffmann, Stefan; Elterman, Alina; Wanke, Egon
3
2016
An approximation algorithm for the stack-up problem. Zbl 0971.90074
Rethmann, Jochen; Wanke, Egon
3
2000
The bounded degree problem for eNCE graph grammars. Zbl 0879.68069
Skodinis, Konstantin; Wanke, Egon
3
1997
Minimum cost paths in periodic graphs. Zbl 0839.05063
Höfting, Franz; Wanke, Egon
3
1995
Polynomial algorithms for minimum cost paths in periodic graphs. Zbl 0801.68133
Höfting, Franz; Wanke, Egon
3
1993
Algorithms for controlling palletizers. Zbl 1342.90007
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
2
2016
A practical approach for the FIFO stack-up problem. Zbl 1370.90299
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
2
2015
The clique-width of tree-power and leaf-power graphs. (Extended abstract). Zbl 1141.68531
Gurski, Frank; Wanke, Egon
2
2007
On the decidability of certain integer subgraph problems on context-free graph languages. Zbl 0820.68067
Wanke, Egon
2
1994
Paths and cycles in finite periodic graphs. Zbl 0925.05038
Wanke, Egon
2
1993
Algorithms for graph problems on BNLC structured garphs. Zbl 0751.68034
Wanke, Egon
2
1991
Algorithms and complexity analysis for the processing of hierarchically defined graphs and hierarchically defined families of graphs. Zbl 0772.68058
Wanke, Egon
2
1989
The complexity of connectivity problems on context-free graph languages. Zbl 0756.68067
Wanke, Egon
2
1989
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
1
2018
An experimental study of algorithms for controlling palletizers. Zbl 1375.90323
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
1
2017
Directed pathwidth and palletizers. Zbl 06539302
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
1
2015
Movement minimization for unit distances in conveyor flow shop processing. Zbl 1023.90025
Espelage, W.; Wanke, E.
1
2003
Deciding clique-width for graphs of bounded tree-width (extended abstract). Zbl 0997.68530
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon
1
2001
Neighborhood-preserving node replacements. Zbl 0958.68079
Skodinis, Konstantin; Wanke, Egon
1
2000
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
3
2020
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
1
2018
An experimental study of algorithms for controlling palletizers. Zbl 1375.90323
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
1
2017
Directed NLC-width. Zbl 1334.05166
Gurski, Frank; Wanke, Egon; Yilmaz, Eda
8
2016
On the complexity of the FIFO stack-up problem. Zbl 1396.90073
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
4
2016
A linear time algorithm for metric dimension of cactus block graphs. Zbl 1339.05388
Hoffmann, Stefan; Elterman, Alina; Wanke, Egon
3
2016
Algorithms for controlling palletizers. Zbl 1342.90007
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
2
2016
A practical approach for the FIFO stack-up problem. Zbl 1370.90299
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
2
2015
Directed pathwidth and palletizers. Zbl 06539302
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
1
2015
The NLC-width and clique-width for powers of graphs of bounded tree-width. Zbl 1173.05342
Gurski, Frank; Wanke, Egon
6
2009
Line graphs of bounded clique-width. Zbl 1128.05049
Gurski, Frank; Wanke, Egon
16
2007
The clique-width of tree-power and leaf-power graphs. (Extended abstract). Zbl 1141.68531
Gurski, Frank; Wanke, Egon
2
2007
Vertex disjoint paths on clique-width bounded graphs. Zbl 1099.68078
Gurski, Frank; Wanke, Egon
12
2006
On the relationship between NLC-width and linear NLC-width. Zbl 1080.68086
Gurski, Frank; Wanke, Egon
23
2005
Minimizing NLC-width is NP-complete. (Extended abstract). Zbl 1171.05427
Gurski, Frank; Wanke, Egon
8
2005
Vertex disjoint paths on clique-width bounded graphs. Zbl 1196.68173
Gurski, Frank; Wanke, Egon
6
2004
Deciding clique-width for graphs of bounded tree-width. Zbl 1027.05093
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon
19
2003
Movement minimization for unit distances in conveyor flow shop processing. Zbl 1023.90025
Espelage, W.; Wanke, E.
1
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
43
2001
Stack-up algorithms for palletizing at delivery industry. Zbl 0983.90016
Rethmann, J.; Wanke, E.
5
2001
Deciding clique-width for graphs of bounded tree-width (extended abstract). Zbl 0997.68530
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon
1
2001
The tree-width of clique-width bounded graphs without \(K_{n,n}\). Zbl 0988.68131
Gurski, Frank; Wanke, Egon
30
2000
An approximation algorithm for the stack-up problem. Zbl 0971.90074
Rethmann, Jochen; Wanke, Egon
3
2000
Neighborhood-preserving node replacements. Zbl 0958.68079
Skodinis, Konstantin; Wanke, Egon
1
2000
Storage controlled pile-up systems, theoretical foundations. Zbl 0921.90069
Rethmann, J.; Wanke, E.
7
1997
The bounded degree problem for eNCE graph grammars. Zbl 0879.68069
Skodinis, Konstantin; Wanke, Egon
3
1997
Emptiness problems of eNCE graph languages. Zbl 0839.68057
Skodinis, Konstantin; Wanke, Egon
5
1995
Minimum cost paths in periodic graphs. Zbl 0839.05063
Höfting, Franz; Wanke, Egon
3
1995
\(k\)-NLC graphs and polynomial algorithms. Zbl 0812.68106
Wanke, Egon
52
1994
Bounded tree-width and LOGCFL. Zbl 0804.68048
Wanke, Egon
7
1994
On the decidability of certain integer subgraph problems on context-free graph languages. Zbl 0820.68067
Wanke, Egon
2
1994
Efficient decision procedures for graph properties on contex-free graph languages. Zbl 0768.68085
Lengauer, Thomas; Wanke, Egon
5
1993
Polynomial algorithms for minimum cost paths in periodic graphs. Zbl 0801.68133
Höfting, Franz; Wanke, Egon
3
1993
Paths and cycles in finite periodic graphs. Zbl 0925.05038
Wanke, Egon
2
1993
Algorithms for graph problems on BNLC structured garphs. Zbl 0751.68034
Wanke, Egon
2
1991
Algorithms and complexity analysis for the processing of hierarchically defined graphs and hierarchically defined families of graphs. Zbl 0772.68058
Wanke, Egon
2
1989
The complexity of connectivity problems on context-free graph languages. Zbl 0756.68067
Wanke, Egon
2
1989
Efficient solution of connectivity problems on hierarchically defined graphs. Zbl 0673.05085
Lengauer, Thomas; Wanke, Egon
14
1988
Efficient analysis of graph properties on context-free graph languages. Zbl 0649.68076
Lengauer, Thomas; Wanke, Egon
9
1988
all top 5

Cited by 240 Authors

25 Gurski, Frank
19 Wanke, Egon
13 Courcelle, Bruno
12 Paulusma, Daniël
10 Lozin, Vadim Vladislavovich
9 Rehs, Carolin
8 Dabrowski, Konrad Kazimierz
7 Rethmann, Jochen
6 Oum, Sang-Il
5 Bodlaender, Hans L.
5 Kanté, Mamadou Moustapha
5 Komander, Dominique
5 Makowsky, Johann-Andreas
5 Milanič, Martin
5 Rao, Michaël
5 Rotics, Udi
5 Skodinis, Konstantin
4 Brandstädt, Andreas
4 Das, Bireswar
4 Engelfriet, Joost
4 Heggernes, Pinar
4 Huang, Shenwei
4 Kwon, Ojoung
4 Lampis, Michael
4 Meister, Daniel
4 Zamaraev, Victor A.
3 Fiala, Jiří
3 Ganian, Robert
3 Golovach, Petr A.
3 Hliněný, Petr
3 Johnson, Matthew
3 Lohrey, Markus
2 Adler, Isolde
2 Alecu, Bogdan
2 Blanché, Alexandre
2 Broersma, Hajo J.
2 Chang, Maw-Shang
2 Cicalese, Ferdinando
2 Drewes, Frank
2 Eppstein, David Arthur
2 Fomin, Fedor V.
2 Gavenčiak, Tomáš
2 Göller, Stefan
2 Habel, Annegret
2 Habib, Michel A.
2 Hung, Ruowei
2 Hunt, Harry Bowen III
2 Katsikarelis, Ioannis
2 Knop, Dušan
2 Koutecký, Martin
2 Kratochvíl, Jan
2 Kreowski, Hans-Jörg
2 Lengauer, Thomas
2 Malyshev, Dmitry S.
2 Marathe, Madhav V.
2 Mitsou, Valia
2 Nešetřil, Jaroslav
2 Obdržálek, Jan
2 Ossona de Mendez, Patrice
2 Papadopoulos, Charis
2 Paschos, Vangelis Th.
2 Patel, Viresh
2 Pilipczuk, Michał
2 Ravi, S. S.
2 Siebertz, Sebastian
2 Thilikos, Dimitrios M.
2 Van Leeuwen, Erik Jan
2 van ’t Hof, Pim
2 Wagner, Fabian
2 Wagner, Klaus W.
2 Yilmaz, Eda
1 Abiad, Aida
1 Arvind, Vikraman
1 Atminas, Aistis
1 Barbero, Florian
1 Bazgan, Cristina
1 Bergougnoux, Benjamin
1 Blumensath, Achim
1 Bojańczyk, Mikołaj
1 Bonomo, Flavia
1 Brandenburg, Franz-Josef
1 Brignall, Robert
1 Brimkov, Boris
1 Briquel, Irénée
1 Bui-Xuan, Binh-Minh
1 Cameron, Kathie
1 Caro, Yair
1 Carrère, Frédérique
1 Chaplick, Steven
1 Chen, Hubie
1 Cogis, Olivier
1 Cohen-Addad, Vincent
1 Corneil, Derek Gordon
1 da Silva, Murilo V. G.
1 Daligault, Jean
1 DasGupta, Anirban
1 Datta, Samir
1 de Montgolfier, Fabien
1 Dell, Holger
1 Deutch, Daniel
...and 140 more Authors

Citations by Year