The following pages link to Konstantin Skodinis (Q1363780):
Displaying 13 items.
- The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
- (Q1770386) (redirect page) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- Emptiness problems of eNCE graph languages (Q1908340) (← links)
- (Q2753956) (← links)
- (Q4373689) (← links)
- Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time (Q4420425) (← links)
- (Q4502804) (← links)
- The bounded degree problem for non-obstructing eNCE graph grammars (Q4645278) (← links)
- Graph automata for linear graph languages (Q4645286) (← links)
- (Q4944975) (← links)
