default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonstantin Skodinis
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j6]Franz-Josef Brandenburg, Konstantin Skodinis:
Finite graph automata for linear and boundary graph languages. Theor. Comput. Sci. 332(1-3): 199-232 (2005)- 2003
- [j5]Konstantin Skodinis:
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time. J. Algorithms 47(1): 40-59 (2003) - 2002
- [j4]Konstantin Skodinis, Egon Wanke:
Node Replacements in Embedding Normal Form. J. Comput. Syst. Sci. 65(2): 351-376 (2002) - 2001
- [j3]Konstantin Skodinis:
The Complexity of the Kn, n-Problem for Node Replacement Graph Languages. Inf. Comput. 168(2): 95-112 (2001) - 2000
- [c8]Konstantin Skodinis:
Computing Optimal Linear Layouts of Trees in Linear Time. ESA 2000: 403-414
1990 – 1999
- 1999
- [c7]Konstantin Skodinis:
Efficient Analysis of Graphs with Small Minimal Separators. WG 1999: 155-166 - 1998
- [c6]Falk Schreiber, Konstantin Skodinis:
NP-Completeness of Some Tree-Clustering Problems. GD 1998: 288-301 - [c5]Konstantin Skodinis, Egon Wanke:
Neighborhood-Preserving Node Replacements. TAGT 1998: 45-58 - 1997
- [j2]Konstantin Skodinis, Egon Wanke:
The Bounded Degree Problem for eNCE Graph Grammars. Inf. Comput. 135(1): 15-35 (1997) - [c4]Konstantin Skodinis:
The Bounded Tree-Width Problem of Context-Free Graph Languages. WG 1997: 303-317 - 1996
- [b1]Konstantin Skodinis:
Komplexität bei Graph Grammatiken und Graph Automaten. University of Passau, Germany, Shaker 1996, ISBN 978-3-8265-1954-3, pp. 1-102 - 1995
- [j1]Konstantin Skodinis, Egon Wanke:
Emptiness Problems of eNCE Graph Languages. J. Comput. Syst. Sci. 51(3): 472-485 (1995) - 1994
- [c3]Konstantin Skodinis, Egon Wanke:
The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars. TAGT 1994: 211-224 - [c2]Franz-Josef Brandenburg, Konstantin Skodinis:
Graph Automata for Linear Graph Languages. TAGT 1994: 336-350 - [c1]Konstantin Skodinis, Egon Wanke:
Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages. WG 1994: 180-192
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
