The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Konstantin Skodinis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Konstantin Skodinis
    Computing Optimal Linear Layouts of Trees in Linear Time. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:403-414 [Conf]
  2. Falk Schreiber, Konstantin Skodinis
    NP-Completeness of Some Tree-Clustering Problems. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:288-301 [Conf]
  3. Franz-Josef Brandenburg, Konstantin Skodinis
    Graph Automata for Linear Graph Languages. [Citation Graph (0, 0)][DBLP]
    TAGT, 1994, pp:336-350 [Conf]
  4. Konstantin Skodinis, Egon Wanke
    The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars. [Citation Graph (0, 0)][DBLP]
    TAGT, 1994, pp:211-224 [Conf]
  5. Konstantin Skodinis, Egon Wanke
    Neighborhood-Preserving Node Replacements. [Citation Graph (0, 0)][DBLP]
    TAGT, 1998, pp:45-58 [Conf]
  6. Konstantin Skodinis
    The Bounded Tree-Width Problem of Context-Free Graph Languages. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:303-317 [Conf]
  7. Konstantin Skodinis
    Efficient Analysis of Graphs with Small Minimal Separators. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:155-166 [Conf]
  8. Konstantin Skodinis, Egon Wanke
    Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:180-192 [Conf]
  9. Konstantin Skodinis
    The Complexity of the Kn, n-Problem for Node Replacement Graph Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:168, n:2, pp:95-112 [Journal]
  10. Konstantin Skodinis, Egon Wanke
    The Bounded Degree Problem for eNCE Graph Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:135, n:1, pp:15-35 [Journal]
  11. Konstantin Skodinis
    Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:47, n:1, pp:40-59 [Journal]
  12. Konstantin Skodinis, Egon Wanke
    Node Replacements in Embedding Normal Form. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:2, pp:351-376 [Journal]
  13. Konstantin Skodinis, Egon Wanke
    Emptiness Problems of eNCE Graph Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:472-485 [Journal]
  14. Franz-Josef Brandenburg, Konstantin Skodinis
    Finite graph automata for linear and boundary graph languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:199-232 [Journal]

Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002