#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1994

2005

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Falk Schreiber, Konstantin Skodinis
- Graph Drawing
- 1998

A graph is a tree of paths (cycles), if its vertex set can be partitioned into clusters, such that each cluster induces a simple path (cycle), and the clusters form a tree. Our main result states that the problem whether or not a given graph is a tree of paths (cycles) is NP-complete. Moreover, if the length of the paths (cycles) is bounded by a constant,… (More)

- Konstantin Skodinis
- J. Algorithms
- 2003

- Konstantin Skodinis
- ESA
- 2000

We present a linear time algorithm which, given a tree, computes a linear layout optimal with respect to vertex separation. As a consequence optimal edge search strategies, optimal node search strategies, and optimal interval augmentations can be computed also in O(n) for trees. This improves the running time of former algorithms from O(n log n) to O(n) and… (More)

- Franz-Josef Brandenburg, Konstantin Skodinis
- Theor. Comput. Sci.
- 2005

- Konstantin Skodinis, Egon Wanke
- J. Comput. Syst. Sci.
- 1995

We consider the complexity of the emptiness problem for various classes of graph languages deened by eNCE (edge label neighborhood controlled embedding) graph grammars. In particular, we show that the emptiness problem is undecidable for general eNCE graph grammars, DEXPTIME-complete for connuent and boundary eNCE graph grammars, PSPACE-complete for linear… (More)

- Konstantin Skodinis, Egon Wanke
- Inf. Comput.
- 1997

- Konstantin Skodinis, Egon Wanke
- WG
- 1994

- Konstantin Skodinis
- WG
- 1997

We show that the following (equivalent) problems are P-complete: 1. Does a given connuent NCE graph grammar only generate graphs of bounded tree-width? and 2. is the graph language generated by a given connuent NCE graph grammar an HR language? This settles the complexity of these important problems on graph grammars .

- Konstantin Skodinis
- Inf. Comput.
- 2001