Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Wanke, Egon"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On module-composed graphs
Frank Gurski
,
Egon Wanke
Lecture Notes in Computer Science
5911
, 2010, pp. 166-177
The clique-width of tree-power and leaf-power graphs
Frank Gurski
,
Egon Wanke
Lecture Notes in Computer Science
4769
, 2007, pp. 76-85
Vertex disjoint paths on clique-width bounded graphs
Frank Gurski
,
Egon Wanke
Theoretical Computer Science
359
(1-3), 2006, pp. 188-199
Minimizing NLC-width is
NP
-complete
Frank Gurski
,
Egon Wanke
Lecture Notes in Computer Science
3787
, 2005, pp. 69-80
On the relationship between NLC-width and linear NLC-width
Frank Gurski
,
Egon Wanke
Theoretical Computer Science
347
(1-2), 2005, pp. 76-89
Oriented paths in mixed graphs
Egon Wanke
,
Rolf Kötter
Lecture Notes in Computer Science
3341
, 2004, pp. 629-643
Deciding clique-width for graphs of bounded tree-width
Wolfgang Espelage
,
Frank Gurski
,
Egon Wanke
Lecture Notes in Computer Science
2125
, 2001, pp. 87-98
How to solve
NP
-hard graph problems on clique-width bounded graphs in polynomial time
Wolfgang Espelage
,
Frank Gurski
,
Egon Wanke
Lecture Notes in Computer Science
2204
, 2001, pp. 117-128
A 3-approximation algorithm for movement minimization in conveyor flow shop processing
Wolfgang Espelage
,
Egon Wanke
Lecture Notes in Computer Science
2136
, 2001, pp. 363-374
The tree-width of clique-width bounded graphs without
K_{n,n}
Frank Gurski
,
Egon Wanke
Lecture Notes in Computer Science
1928
, 2000, pp. 196-205
The bounded degree problem for eNCE graph grammars
Konstantin Skodinis
,
Egon Wanke
Information and Computation
135
(1), 1997, pp. 15-35
Minimum cost paths in periodic graphs
Frans Höfting
,
Egon Wanke
SIAM Journal on Computing
24
(5), 1995, October, pp. 1051-1067
Emptiness problems of eNCE graph languages
Konstantin Skodinis
,
Egon Wanke
Journal of Computer and System Sciences
51
(3), 1995, pp. 472-485
k
-NLC graphs and polynomial algorithms
Egon Wanke
Discrete Applied Mathematics
54
, 1994, pp. 251-266
The complexity of connectivity problems on context-free graph languages
Egon Wanke
Journal of Computer and System Sciences
49
(1), 1994, pp. 57-82
On the decidability of certain integer subgraph problems on context-free graph languages
Egon Wanke
Information and Computation
113
(1), 1994, August, pp. 26-49
Bounded tree-width and LOGCFL
Egon Wanke
Journal of Algorithms
16
(3), 1994, pp. 470-491
1st grade - A system for implementation, testing and animation of graph algorithms
Franz Höfting
,
Egon Wanke
,
Aurel Balmoŝan
,
Curd Bergmann
Lecture Notes in Computer Science
665
, 1993, pp. 706-707
Polynomial algorithms for minimum cost paths in periodic graphs
Franz Höfting
,
Egon Wanke
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993)
, 1993, pp. 493-499
Efficient decision procedures for graph properties on context-free graph languages
Thomas Lengauer
,
Egon Wanke
Journal of the ACM
40
(2), 1993, April, pp. 368-393
Paths and cycles in finite periodic graphs
Egon Wanke
Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science 1993. MFCS'93(Gdańsk, Poland, August/September 1993)
LNCS 711
, 1993, pp. 751-760
Bounded tree-width and LOGCFL
Egon Wanke
Lecture Notes in Computer Science
790
, 1993, pp. 33-44
Processing of hierarchically defined graphs and graph families
Franz Höfting
,
Thomas Lengauer
,
Egon Wanke
Lecture Notes in Computer Science
594
, 1992, pp. 44-69
Algorithms for Graph Problems on BNLC Structured Graphs
Egon Wanke
Information and Computation
94
(1), 1991, pp. 93-122
On the decidability of integer subgraph problems on context-free graph languages
Egon Wanke
Lecture Notes in Computer Science
529
, 1991, pp. 415-426
Seiten 1
2
>