The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Burkay Genc: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Therese C. Biedl, Burkay Genc
    When can a graph form an orthogonal polyhedron? [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:53-56 [Conf]
  2. Therese C. Biedl, Burkay Genc
    Complexity of Octagonal and Rectangular Cartograms. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:117-120 [Conf]
  3. Ugur Dogrusöz, Burkay Genc
    A Framework for Complexity Management in Graph Visualization. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:368-369 [Conf]
  4. Burkay Genc, Ugur Dogrusöz
    A Constrained, Force-Directed Layout Algorithm for Biological Pathways. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:314-319 [Conf]
  5. Ugur Dogrusöz, Burkay Genc
    A multi-graph approach to complexity management in interactive graph visualization. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 2006, v:30, n:1, pp:86-97 [Journal]
  6. Burkay Genc, Ugur Dogrusöz
    A layout algorithm for signaling pathways. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2006, v:176, n:2, pp:135-149 [Journal]

  7. Cauchy's Theorem for Orthogonal Polyhedra of Genus 0. [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