Konstantin Skodinis

From MaRDI portal
(Redirected from Konstantin Skodinis)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Exponential time analysis of confluent and boundary eNCE graph languages
Graph-Theoretic Concepts in Computer Science
2024-01-05Paper
The bounded degree problem for non-obstructing eNCE graph grammars
Lecture Notes in Computer Science
2019-01-10Paper
Graph automata for linear graph languages
Lecture Notes in Computer Science
2019-01-10Paper
Finite graph automata for linear and boundary graph languages
Theoretical Computer Science
2005-04-06Paper
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
Journal of Algorithms
2003-08-17Paper
Node replacements in embedding normal form.
Journal of Computer and System Sciences
2003-05-14Paper
The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
Information and Computation
2003-01-14Paper
scientific article; zbMATH DE number 1670677 (Why is no real title available?)2001-11-11Paper
scientific article; zbMATH DE number 1504826 (Why is no real title available?)2000-09-12Paper
scientific article; zbMATH DE number 1420906 (Why is no real title available?)2000-06-07Paper
scientific article; zbMATH DE number 1107740 (Why is no real title available?)1998-06-23Paper
The bounded degree problem for eNCE graph grammars
Information and Computation
1997-08-11Paper
Emptiness problems of eNCE graph languages
Journal of Computer and System Sciences
1996-02-26Paper


Research outcomes over time


This page was built for person: Konstantin Skodinis