Konstantin Skodinis

According to our database1, Konstantin Skodinis authored at least 15 papers between 1994 and 2005.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
Finite graph automata for linear and boundary graph languages.
Theor. Comput. Sci., 2005

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

2002
Node Replacements in Embedding Normal Form.
J. Comput. Syst. Sci., 2002

2001
The Complexity of the K<sub>n, n</sub>-Problem for Node Replacement Graph Languages.
Inf. Comput., 2001

2000
Computing Optimal Linear Layouts of Trees in Linear Time.
Proceedings of the Algorithms, 2000

1999
Efficient Analysis of Graphs with Small Minimal Separators.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998
Neighborhood-Preserving Node Replacements.
Proceedings of the Theory and Application of Graph Transformations, 1998

NP-Completeness of Some Tree-Clustering Problems.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997
The Bounded Degree Problem for eNCE Graph Grammars.
Inf. Comput., 1997

The Bounded Tree-Width Problem of Context-Free Graph Languages.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996
Komplexität bei Graph Grammatiken und Graph Automaten.
PhD thesis, 1996

1995
Emptiness Problems of eNCE Graph Languages.
J. Comput. Syst. Sci., 1995

1994
Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

Graph Automata for Linear Graph Languages.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994


  Loading...