Konstantin Skodinis

From MaRDI portal
Person:1363780

Available identifiers

zbMath Open skodinis.konstantinMaRDI QIDQ1363780

List of research outcomes





PublicationDate of PublicationType
Exponential time analysis of confluent and boundary eNCE graph languages2024-01-05Paper
The bounded degree problem for non-obstructing eNCE graph grammars2019-01-10Paper
Graph automata for linear graph languages2019-01-10Paper
Finite graph automata for linear and boundary graph languages2005-04-06Paper
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time2003-08-17Paper
Node replacements in embedding normal form.2003-05-14Paper
The complexity of the \(K_{n,n}\)-problem for node replacement graph languages2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q27539562001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45028042000-09-12Paper
https://portal.mardi4nfdi.de/entity/Q49449752000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q43736891998-06-23Paper
The bounded degree problem for eNCE graph grammars1997-08-11Paper
Emptiness problems of eNCE graph languages1996-02-26Paper

Research outcomes over time

This page was built for person: Konstantin Skodinis

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:1363780&oldid=11112091"
Powered by MediaWiki