Konstantin Skodinis

15 papers A 2B 3Journal 6Unranked 3
YearRankTypeTitle / Venue / Authors
2005 J jnl
Finite graph automata for linear and boundary graph languages.
Theor. Comput. Sci.
Franz-Josef Brandenburg, Konstantin Skodinis
2003 J jnl
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time.
J. Algorithms
Konstantin Skodinis
2002 J jnl
Node Replacements in Embedding Normal Form.
J. Comput. Syst. Sci.
Konstantin Skodinis, Egon Wanke
2001 J jnl
The Complexity of the K
Inf. Comput.
Konstantin Skodinis
2000 A conf
Computing Optimal Linear Layouts of Trees in Linear Time.
ESA
Konstantin Skodinis
1999 B conf
Efficient Analysis of Graphs with Small Minimal Separators.
WG
Konstantin Skodinis
1998 A conf
NP-Completeness of Some Tree-Clustering Problems.
GD
Falk Schreiber, Konstantin Skodinis
1998 — conf
Neighborhood-Preserving Node Replacements.
TAGT
Konstantin Skodinis, Egon Wanke
1997 J jnl
The Bounded Degree Problem for eNCE Graph Grammars.
Inf. Comput.
Konstantin Skodinis, Egon Wanke
1997 B conf
The Bounded Tree-Width Problem of Context-Free Graph Languages.
WG
Konstantin Skodinis
1996 — —
Komplexität bei Graph Grammatiken und Graph Automaten.
Konstantin Skodinis
1995 J jnl
Emptiness Problems of eNCE Graph Languages.
J. Comput. Syst. Sci.
Konstantin Skodinis, Egon Wanke
1994 B conf
Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages.
WG
Konstantin Skodinis, Egon Wanke
1994 — conf
Graph Automata for Linear Graph Languages.
TAGT
Franz-Josef Brandenburg, Konstantin Skodinis
1994 — conf
The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars.
TAGT
Konstantin Skodinis, Egon Wanke