×
Edit Profile (opens in new tab)

Wanke, Egon

Co-Author Distance
Author ID: wanke.egon Recent zbMATH articles by "Wanke, Egon"
Published as: Wanke, Egon; Wanke, E.
External Links: MGP
Documents Indexed: 71 Publications since 1988, including 2 Books
Co-Authors: 20 Co-Authors with 59 Joint Publications
129 Co-Co-Authors
all top 5

Co-Authors

12 single-authored
25 Gurski, Frank
16 Rethmann, Jochen
9 Espelage, Wolfgang
6 Skodinis, Konstantin
5 Hoffmann, Stefan
5 Höfting, Franz
4 Lengauer, Thomas
4 Rehs, Carolin
3 Komander, Dominique
3 Vietz, Duygu
1 Balmoŝan, Aurel
1 Bergmann, Curd
1 Elterman, Alina
1 Kampermann, Thomas
1 Kötter, Rolf
1 Rothe, Irene
1 Rothe, Jörg-Matthias
1 Schmitz, Yannick
1 Wiegers, Manfred
1 Yilmaz, Eda
all top 5

Serials

5 Mathematical Methods of Operations Research
4 Theoretical Computer Science
3 Journal of Computer and System Sciences
3 Information and Computation
3 European Journal of Operational Research
2 Discrete Applied Mathematics
2 Discrete Mathematics
2 Information Processing Letters
2 SIAM Journal on Computing
2 Journal of Algorithms
1 Acta Informatica
1 Applied Mathematics and Computation
1 Journal of the Association for Computing Machinery
1 Bulletin of the European Association for Theoretical Computer Science (EATCS)
1 Journal of Combinatorial Optimization
1 Journal of Graph Algorithms and Applications
1 OR Spectrum
all top 5

Fields

47 Computer science (68-XX)
25 Combinatorics (05-XX)
22 Operations research, mathematical programming (90-XX)
4 Mathematical logic and foundations (03-XX)
2 Numerical analysis (65-XX)
1 Number theory (11-XX)

Publications by Year

all cited Publications top 5 cited Publications

Citations contained in zbMATH Open

45 Publications have been cited 454 times in 273 Documents Cited by ▼ Year ▼
\(k\)-NLC graphs and polynomial algorithms. Zbl 0812.68106
Wanke, Egon
66
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
66
2001
The tree-width of clique-width bounded graphs without \(K_{n,n}\). Zbl 0988.68131
Gurski, Frank; Wanke, Egon
44
2000
On the relationship between NLC-width and linear NLC-width. Zbl 1080.68086
Gurski, Frank; Wanke, Egon
27
2005
Deciding clique-width for graphs of bounded tree-width. Zbl 1027.05093
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon
23
2003
Line graphs of bounded clique-width. Zbl 1128.05049
Gurski, Frank; Wanke, Egon
22
2007
Efficient solution of connectivity problems on hierarchically defined graphs. Zbl 0673.05085
Lengauer, Thomas; Wanke, Egon
18
1988
Directed NLC-width. Zbl 1334.05166
Gurski, Frank; Wanke, Egon; Yilmaz, Eda
16
2016
Vertex disjoint paths on clique-width bounded graphs. Zbl 1099.68078
Gurski, Frank; Wanke, Egon
15
2006
Efficient analysis of graph properties on context-free graph languages. Zbl 0649.68076
Lengauer, Thomas; Wanke, Egon
12
1988
A linear time algorithm for metric dimension of cactus block graphs. Zbl 1339.05388
Hoffmann, Stefan; Elterman, Alina; Wanke, Egon
12
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
10
2020
Storage controlled pile-up systems, theoretical foundations. Zbl 0921.90069
Rethmann, J.; Wanke, E.
9
1997
Bounded tree-width and LOGCFL. Zbl 0804.68048
Wanke, Egon
9
1994
Minimizing NLC-width is NP-complete. (Extended abstract). Zbl 1171.05427
Gurski, Frank; Wanke, Egon
9
2005
The NLC-width and clique-width for powers of graphs of bounded tree-width. Zbl 1173.05342
Gurski, Frank; Wanke, Egon
9
2009
Efficient decision procedures for graph properties on contex-free graph languages. Zbl 0768.68085
Lengauer, Thomas; Wanke, Egon
8
1993
Vertex disjoint paths on clique-width bounded graphs. Zbl 1196.68173
Gurski, Frank; Wanke, Egon
8
2004
On the complexity of the FIFO stack-up problem. Zbl 1396.90073
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
7
2016
Stack-up algorithms for palletizing at delivery industry. Zbl 0983.90016
Rethmann, J.; Wanke, E.
6
2001
Algorithms for graph problems on BNLC structured garphs. Zbl 0751.68034
Wanke, Egon
5
1991
Emptiness problems of eNCE graph languages. Zbl 0839.68057
Skodinis, Konstantin; Wanke, Egon
5
1995
The clique-width of tree-power and leaf-power graphs. (Extended abstract). Zbl 1141.68531
Gurski, Frank; Wanke, Egon
4
2007
An approximation algorithm for the stack-up problem. Zbl 0971.90074
Rethmann, Jochen; Wanke, Egon
4
2000
The bounded degree problem for eNCE graph grammars. Zbl 0879.68069
Skodinis, Konstantin; Wanke, Egon
3
1997
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
3
2016
Minimum cost paths in periodic graphs. Zbl 0839.05063
Höfting, Franz; Wanke, Egon
3
1995
Neighborhood-preserving node replacements. Zbl 0958.68079
Skodinis, Konstantin; Wanke, Egon
2
2000
Deciding clique-width for graphs of bounded tree-width (extended abstract). Zbl 0997.68530
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon
2
2001
Paths and cycles in finite periodic graphs. Zbl 0925.05038
Wanke, Egon
2
1993
The complexity of connectivity problems on context-free graph languages. Zbl 0756.68067
Wanke, Egon
2
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
2
1989
On the decidability of certain integer subgraph problems on context-free graph languages. Zbl 0820.68067
Wanke, Egon
2
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
2
2018
The fault-tolerant metric dimension of cographs. Zbl 1534.68187
Vietz, Duygu; Wanke, Egon
2
2019
A practical approach for the FIFO stack-up problem. Zbl 1370.90299
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
2
2015
Competitive analysis of on-line stack-up algorithms. Zbl 1477.68544
Rethmann, J.; Wanke, E.
2
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
2
2020
Directed pathwidth and palletizers. Zbl 1478.90107
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
Storage controlled pile-up systems, theoretical foundations. Zbl 0916.90155
Rethmann, J.; Wanke, E.
1
1997
An approximation algorithm for stacking up bins from a conveyer onto pallets. Zbl 1497.68574
Rethmann, J.; Wanke, E.
1
1997
An experimental study of algorithms for controlling palletizers. Zbl 1375.90323
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
1
2017
Computing the metric dimension by decomposing graphs into extended biconnected components (extended abstract). Zbl 1522.68430
Vietz, Duygu; Hoffmann, Stefan; Wanke, Egon
1
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
10
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
2
2020
The fault-tolerant metric dimension of cographs. Zbl 1534.68187
Vietz, Duygu; Wanke, Egon
2
2019
Computing the metric dimension by decomposing graphs into extended biconnected components (extended abstract). Zbl 1522.68430
Vietz, Duygu; Hoffmann, Stefan; Wanke, Egon
1
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
2
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
16
2016
A linear time algorithm for metric dimension of cactus block graphs. Zbl 1339.05388
Hoffmann, Stefan; Elterman, Alina; Wanke, Egon
12
2016
On the complexity of the FIFO stack-up problem. Zbl 1396.90073
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
7
2016
Algorithms for controlling palletizers. Zbl 1342.90007
Gurski, Frank; Rethmann, Jochen; Wanke, Egon
3
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 1478.90107
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
9
2009
Line graphs of bounded clique-width. Zbl 1128.05049
Gurski, Frank; Wanke, Egon
22
2007
The clique-width of tree-power and leaf-power graphs. (Extended abstract). Zbl 1141.68531
Gurski, Frank; Wanke, Egon
4
2007
Vertex disjoint paths on clique-width bounded graphs. Zbl 1099.68078
Gurski, Frank; Wanke, Egon
15
2006
On the relationship between NLC-width and linear NLC-width. Zbl 1080.68086
Gurski, Frank; Wanke, Egon
27
2005
Minimizing NLC-width is NP-complete. (Extended abstract). Zbl 1171.05427
Gurski, Frank; Wanke, Egon
9
2005
Vertex disjoint paths on clique-width bounded graphs. Zbl 1196.68173
Gurski, Frank; Wanke, Egon
8
2004
Deciding clique-width for graphs of bounded tree-width. Zbl 1027.05093
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon
23
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
66
2001
Stack-up algorithms for palletizing at delivery industry. Zbl 0983.90016
Rethmann, J.; Wanke, E.
6
2001
Deciding clique-width for graphs of bounded tree-width (extended abstract). Zbl 0997.68530
Espelage, Wolfgang; Gurski, Frank; Wanke, Egon
2
2001
The tree-width of clique-width bounded graphs without \(K_{n,n}\). Zbl 0988.68131
Gurski, Frank; Wanke, Egon
44
2000
An approximation algorithm for the stack-up problem. Zbl 0971.90074
Rethmann, Jochen; Wanke, Egon
4
2000
Neighborhood-preserving node replacements. Zbl 0958.68079
Skodinis, Konstantin; Wanke, Egon
2
2000
Storage controlled pile-up systems, theoretical foundations. Zbl 0921.90069
Rethmann, J.; Wanke, E.
9
1997
The bounded degree problem for eNCE graph grammars. Zbl 0879.68069
Skodinis, Konstantin; Wanke, Egon
3
1997
Competitive analysis of on-line stack-up algorithms. Zbl 1477.68544
Rethmann, J.; Wanke, E.
2
1997
Storage controlled pile-up systems, theoretical foundations. Zbl 0916.90155
Rethmann, J.; Wanke, E.
1
1997
An approximation algorithm for stacking up bins from a conveyer onto pallets. Zbl 1497.68574
Rethmann, J.; Wanke, E.
1
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
66
1994
Bounded tree-width and LOGCFL. Zbl 0804.68048
Wanke, Egon
9
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
8
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
5
1991
The complexity of connectivity problems on context-free graph languages. Zbl 0756.68067
Wanke, Egon
2
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
2
1989
Efficient solution of connectivity problems on hierarchically defined graphs. Zbl 0673.05085
Lengauer, Thomas; Wanke, Egon
18
1988
Efficient analysis of graph properties on context-free graph languages. Zbl 0649.68076
Lengauer, Thomas; Wanke, Egon
12
1988
all cited Publications top 5 cited Publications
all top 5

Cited by 329 Authors

37 Gurski, Frank
27 Wanke, Egon
20 Paulusma, Daniël
16 Rehs, Carolin
15 Courcelle, Bruno
13 Dabrowski, Konrad Kazimierz
12 Komander, Dominique
12 Lozin, Vadim Vladislavovich
12 Rethmann, Jochen
11 Kwon, O. joung
10 Oum, Sang-Il
8 Kanté, Mamadou Moustapha
7 Milanič, Martin
6 Ganian, Robert
6 Huang, Shenwei
6 Lampis, Michael
6 Makowsky, Johann-Andreas
6 Rotics, Udi
6 Skodinis, Konstantin
5 Bodlaender, Hans L.
5 Brandstädt, Andreas
5 Das, Bireswar
5 Heggernes, Pinar
5 Meister, Daniel
5 Rao, Michaël
4 Eiben, Eduard
4 Engelfriet, Joost
4 Eppstein, David Arthur
4 Fomin, Fedor V.
4 Hliněný, Petr
4 Hunt, Harry Bowen III
4 Malyshev, Dmitriĭ Sergeevich
4 Marathe, Madhav V.
4 Van Leeuwen, Erik Jan
4 Zamaraev, Victor A.
3 Alecu, Bogdan
3 Drewes, Frank
3 Ducoffe, Guillaume
3 Fiala, Jiří
3 Golovach, Petr A.
3 Grohe, Martin
3 Habel, Annegret
3 Hoppen, Carlos
3 Jacobs, David P.
3 Johnson, Matthew
3 Katsikarelis, Ioannis
3 Kreowski, Hans-Jörg
3 Lohrey, Markus
3 Mitsou, Valia
3 Obdržálek, Jan
3 Ono, Hirotaka
3 Papadopoulos, Charis
3 Paschos, Vangelis Th.
3 Pilipczuk, Michał
3 Radhakrishnan, Venkatesh
3 Ravi, S. S.
3 Trevisan, Vilmar
2 Adler, Isolde
2 Ahn, Jungho
2 Arvind, Vikraman
2 Bergougnoux, Benjamin
2 Blanché, Alexandre
2 Bojańczyk, Mikołaj
2 Broersma, Hajo J.
2 Chang, Maw-Shang
2 Cicalese, Ferdinando
2 Dross, François
2 Fernández-Baca, David
2 Flarup, Uffe
2 Fraser, Dallas J.
2 Fürer, Martin
2 Gaspers, Serge
2 Gavenčiak, Tomáš
2 Göller, Stefan
2 Habib, Michel
2 Hamm, Thekla
2 Hanaka, Tesshu
2 Havvaei, Elham
2 Hoàng, Chính T.
2 Hoffmann, Stefan
2 Holmes, Kevin
2 Hung, Ruowei
2 Jaffke, Lars
2 Kawai, Kazuma
2 Kern, Walter
2 Klavžar, Sandi
2 Kneis, Joachim
2 Knop, Dušan
2 Köbler, Johannes
2 Korhonen, Tuukka
2 Koutecký, Martin
2 Kratochvíl, Jan
2 LaMantia, Tom P.
2 Langer, Alexander
2 Lengauer, Thomas
2 Lindemann, Marvin
2 Lyaudet, Laurent
2 Makino, Kazuhisa
2 Martin, Barnaby D.
2 Masařík, Tomáš
...and 229 more Authors
all top 5

Cited in 48 Serials

39 Discrete Applied Mathematics
31 Theoretical Computer Science
11 Discrete Mathematics
11 Theory of Computing Systems
10 Journal of Computer and System Sciences
10 Algorithmica
7 Information and Computation
5 Journal of Combinatorial Theory. Series B
5 Journal of Graph Theory
5 SIAM Journal on Discrete Mathematics
5 Mathematical Methods of Operations Research
4 Acta Informatica
4 European Journal of Combinatorics
4 International Journal of Foundations of Computer Science
4 Journal of Combinatorial Optimization
4 Journal of Graph Algorithms and Applications
3 Information Processing Letters
3 European Journal of Operational Research
3 Logical Methods in Computer Science
3 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
2 Annals of Pure and Applied Logic
2 Order
2 The Electronic Journal of Combinatorics
2 ACM Transactions on Computational Logic
2 Journal of Applied Logic
2 Algorithms
2 ACM Transactions on Algorithms
1 Applied Mathematics and Computation
1 Computing
1 Networks
1 SIAM Journal on Computing
1 Transactions of the American Mathematical Society
1 Graphs and Combinatorics
1 Discrete Mathematics and Applications
1 Linear Algebra and its Applications
1 SIAM Review
1 Journal of Logic, Language and Information
1 Computational and Applied Mathematics
1 Constraints
1 INFORMS Journal on Computing
1 ELA. The Electronic Journal of Linear Algebra
1 RAIRO. Theoretical Informatics and Applications
1 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
1 OR Spectrum
1 Journal of Applied Mathematics and Computing
1 Journal of Discrete Algorithms
1 Discrete Optimization
1 Mathematics
all top 5

Cited in 14 Fields

193 Combinatorics (05-XX)
169 Computer science (68-XX)
32 Operations research, mathematical programming (90-XX)
25 Mathematical logic and foundations (03-XX)
4 Biology and other natural sciences (92-XX)
3 Order, lattices, ordered algebraic structures (06-XX)
3 Numerical analysis (65-XX)
2 General algebraic systems (08-XX)
2 Linear and multilinear algebra; matrix theory (15-XX)
2 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
2 Information and communication theory, circuits (94-XX)
1 Operator theory (47-XX)
1 Probability theory and stochastic processes (60-XX)
1 Mechanics of deformable solids (74-XX)

Citations by Year