The SCEAS System
| |||||||

## Search the dblp DataBase
Konstantin Skodinis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Konstantin Skodinis
**Computing Optimal Linear Layouts of Trees in Linear Time.**[Citation Graph (0, 0)][DBLP] ESA, 2000, pp:403-414 [Conf] - Falk Schreiber, Konstantin Skodinis
**NP-Completeness of Some Tree-Clustering Problems.**[Citation Graph (0, 0)][DBLP] Graph Drawing, 1998, pp:288-301 [Conf] - Franz-Josef Brandenburg, Konstantin Skodinis
**Graph Automata for Linear Graph Languages.**[Citation Graph (0, 0)][DBLP] TAGT, 1994, pp:336-350 [Conf] - Konstantin Skodinis, Egon Wanke
**The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars.**[Citation Graph (0, 0)][DBLP] TAGT, 1994, pp:211-224 [Conf] - Konstantin Skodinis, Egon Wanke
**Neighborhood-Preserving Node Replacements.**[Citation Graph (0, 0)][DBLP] TAGT, 1998, pp:45-58 [Conf] - Konstantin Skodinis
**The Bounded Tree-Width Problem of Context-Free Graph Languages.**[Citation Graph (0, 0)][DBLP] WG, 1997, pp:303-317 [Conf] - Konstantin Skodinis
**Efficient Analysis of Graphs with Small Minimal Separators.**[Citation Graph (0, 0)][DBLP] WG, 1999, pp:155-166 [Conf] - Konstantin Skodinis, Egon Wanke
**Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages.**[Citation Graph (0, 0)][DBLP] WG, 1994, pp:180-192 [Conf] - Konstantin Skodinis
**The Complexity of the K**[Citation Graph (0, 0)][DBLP]_{n, n}-Problem for Node Replacement Graph Languages. Inf. Comput., 2001, v:168, n:2, pp:95-112 [Journal] - Konstantin Skodinis, Egon Wanke
**The Bounded Degree Problem for eNCE Graph Grammars.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1997, v:135, n:1, pp:15-35 [Journal] - Konstantin Skodinis
**Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:47, n:1, pp:40-59 [Journal] - Konstantin Skodinis, Egon Wanke
**Node Replacements in Embedding Normal Form.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:65, n:2, pp:351-376 [Journal] - Konstantin Skodinis, Egon Wanke
**Emptiness Problems of eNCE Graph Languages.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1995, v:51, n:3, pp:472-485 [Journal] - Franz-Josef Brandenburg, Konstantin Skodinis
**Finite graph automata for linear and boundary graph languages.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:332, n:1-3, pp:199-232 [Journal]
Search in 1.435secs, Finished in 1.435secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |