The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Frank Kammer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Frank Kammer, Hanjo Täubig
    Connectivity. [Citation Graph (0, 0)][DBLP]
    Network Analysis, 2004, pp:143-177 [Conf]
  2. Frank Kammer
    Simultaneous Embedding with Two Bends per Edge in Polynomial Area. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:255-267 [Conf]
  3. Frank Kammer
    Determining the Smallest k Such That G Is k -Outerplanar. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:359-370 [Conf]

  4. Approximation Algorithms for Intersection Graphs. [Citation Graph (, )][DBLP]


  5. The Complexity of Minimum Convex Coloring. [Citation Graph (, )][DBLP]


  6. The k-Disjoint Paths Problem on Chordal Graphs. [Citation Graph (, )][DBLP]


  7. Removing Local Extrema from Imprecise Terrains [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.001secs
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