The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jens Schreyer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jens Schreyer, Hansjoachim Walther
    Edge-oblique polyhedral graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:315-327 [Journal]
  2. Jens Schreyer
    Almost every graph is vertex-oblique. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:983-989 [Journal]
  3. Jens Schreyer, Hansjoachim Walther, Leonid S. Melnikov
    Vertex-oblique graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1538-1544 [Journal]
  4. Anja Kohl, Jens Schreyer, Zsolt Tuza, Margit Voigt
    List version of L(d, s)-labelings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:92-98 [Journal]

  5. A Game Theoretic Approach to Graph Probleras. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002