Graph Drawing Contest Report

  • Ugur Dogrusoz
  • Christian A. Duncan
  • Carsten Gutwenger
  • Georg Sander
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5417)


This report describes the \(15^{\mbox{\scriptsize th}}\) Annual Graph Drawing Contest, held in conjunction with the 2008 Graph Drawing Symposium in Heraklion, Crete, Greece. The purpose of the contest is to monitor and challenge the current state of graph-drawing technology.


Manual Team Supervisory Board Undirected Edge Graph Draw Employee Union 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    AT&T: Graphviz,
  2. 2.
    Chimani, M., Gutwenger, C., Mutzel, P., Wong, H.: Layer-free upward crossing minimization. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 55–68. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical systems. IEEE Trans. Sys. Man, and Cyb. SMC 11(2), 109–125 (1981)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Sukemura, T.: FR500 VLIW-architecture high-performance embedded microprocessor. FUJITSU Sci. Tech. J. 36(1), 31–38 (2000)Google Scholar
  5. 5.
    Wikipedia: Olympic flame (accessed, March 2008),
  6. 6.
    yWorks: yFiles,

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Ugur Dogrusoz
    • 1
  • Christian A. Duncan
    • 2
  • Carsten Gutwenger
    • 3
  • Georg Sander
    • 4
  1. 1.Bilkent University and Tom Sawyer SoftwareTurkey
  2. 2.Louisiana Tech UniversityRustonUSA
  3. 3.University of DortmundGermany
  4. 4.ILOGGentilly CedexFrance

Personalised recommendations