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
[2]
Hilfe
Suche: Author="Gurski, Frank"
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
Polynomial algorithms for protein similarity search for restricted mRNA structures
Frank Gurski
Information Processing Letters
105
(5), 2007, pp. 170-176
Characterizations for restricted graphs of NLC-width 2
Frank Gurski
Theoretical Computer Science
372
(1), 2007, pp. 108-114
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
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
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