Graph Automata for Linear Graph Languages. - Franz-Josef Brandenburg; Konstantin Skodinis (TAGT, 1994)

The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars. - Konstantin Skodinis; Egon Wanke (TAGT, 1994)

Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages. - Konstantin Skodinis; Egon Wanke (WG, 1994)

Emptiness Problems of eNCE Graph Languages. - Konstantin Skodinis; Egon Wanke (J. Comput. Syst. Sci., 1995)

Komplexität bei Graph Grammatiken und Graph Automaten. - Konstantin Skodinis (Shaker, 1996)

The Bounded Tree-Width Problem of Context-Free Graph Languages. - Konstantin Skodinis (WG, 1997)

The Bounded Degree Problem for eNCE Graph Grammars. - Konstantin Skodinis; Egon Wanke (Inf. Comput., 1997)

NP-Completeness of Some Tree-Clustering Problems. - Falk Schreiber; Konstantin Skodinis (GD, 1998)

Neighborhood-Preserving Node Replacements. - Konstantin Skodinis; Egon Wanke (TAGT, 1998)

Efficient Analysis of Graphs with Small Minimal Separators. - Konstantin Skodinis (WG, 1999)

Computing Optimal Linear Layouts of Trees in Linear Time. - Konstantin Skodinis (ESA, 2000)

The Complexity of the Kn, n-Problem for Node Replacement Graph Languages. - Konstantin Skodinis (Inf. Comput., 2001)

Node Replacements in Embedding Normal Form. - Konstantin Skodinis; Egon Wanke (J. Comput. Syst. Sci., 2002)

Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time. - Konstantin Skodinis (J. Algorithms, 2003)

Finite graph automata for linear and boundary graph languages. - Franz-Josef Brandenburg; Konstantin Skodinis (Theor. Comput. Sci., 2005)