| 2005 |
|---|
| 14 | EE | Franz-Josef Brandenburg,
Konstantin Skodinis:
Finite graph automata for linear and boundary graph languages.
Theor. Comput. Sci. 332(1-3): 199-232 (2005) |
| 2003 |
|---|
| 13 | EE | Konstantin Skodinis:
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time.
J. Algorithms 47(1): 40-59 (2003) |
| 2002 |
|---|
| 12 | EE | Konstantin Skodinis,
Egon Wanke:
Node Replacements in Embedding Normal Form.
J. Comput. Syst. Sci. 65(2): 351-376 (2002) |
| 2001 |
|---|
| 11 | | Konstantin Skodinis:
The Complexity of the Kn, n-Problem for Node Replacement Graph Languages.
Inf. Comput. 168(2): 95-112 (2001) |
| 2000 |
|---|
| 10 | | Konstantin Skodinis:
Computing Optimal Linear Layouts of Trees in Linear Time.
ESA 2000: 403-414 |
| 1999 |
|---|
| 9 | EE | Konstantin Skodinis:
Efficient Analysis of Graphs with Small Minimal Separators.
WG 1999: 155-166 |
| 1998 |
|---|
| 8 | EE | Falk Schreiber,
Konstantin Skodinis:
NP-Completeness of Some Tree-Clustering Problems.
Graph Drawing 1998: 288-301 |
| 7 | | Konstantin Skodinis,
Egon Wanke:
Neighborhood-Preserving Node Replacements.
TAGT 1998: 45-58 |
| 1997 |
|---|
| 6 | | Konstantin Skodinis:
The Bounded Tree-Width Problem of Context-Free Graph Languages.
WG 1997: 303-317 |
| 5 | | Konstantin Skodinis,
Egon Wanke:
The Bounded Degree Problem for eNCE Graph Grammars.
Inf. Comput. 135(1): 15-35 (1997) |
| 1995 |
|---|
| 4 | | Konstantin Skodinis,
Egon Wanke:
Emptiness Problems of eNCE Graph Languages.
J. Comput. Syst. Sci. 51(3): 472-485 (1995) |
| 1994 |
|---|
| 3 | | Konstantin Skodinis,
Egon Wanke:
The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars.
TAGT 1994: 211-224 |
| 2 | | Franz-Josef Brandenburg,
Konstantin Skodinis:
Graph Automata for Linear Graph Languages.
TAGT 1994: 336-350 |
| 1 | | Konstantin Skodinis,
Egon Wanke:
Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages.
WG 1994: 180-192 |
