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="Skodinis, Konstantin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
Konstantin Skodinis
Journal of Algorithms
47
(1), 2003, pp. 40-59
The complexity of the
K_{n,n}
-problem for node replacement graph languages
Konstantin Skodinis
Information and Computation
168
(2), 2001, pp. 95-112
Computing optimal linear layouts of trees in linear time
Konstantin Skodinis
Lecture Notes in Computer Science
1879
, 2000, pp. 403-414
NP
-completeness of some tree-clustering problems
Falk Schreiber
,
Konstantinos Skodinis
Lecture Notes in Computer Science
1547
, 1998, pp. 288-301
The bounded degree problem for eNCE graph grammars
Konstantin Skodinis
,
Egon Wanke
Information and Computation
135
(1), 1997, pp. 15-35
Emptiness problems of eNCE graph languages
Konstantin Skodinis
,
Egon Wanke
Journal of Computer and System Sciences
51
(3), 1995, pp. 472-485