Graph Drawing Contest Report

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


This report describes the 19th Annual Graph Drawing Contest, held in conjunction with the 2012 Graph Drawing Symposium in Redmond, USA. The purpose of the contest is to monitor and challenge the current state of graph-drawing technology. For the first time, we introduced a graph drawing game contest and asked conference attendees to judge the games.


Restricted Area Graph Draw Conference Attendee Edge Crossing Karlsruhe Institute 
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.
    Auer, C., Gleißner, A., Hanauer, K., Vetter, S.: Testing Planarity by Switching Trains. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 563–565. Springer, Heidelberg (2013), Google Scholar
  2. 2.
    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)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Christian A. Duncan
    • 1
  • Carsten Gutwenger
    • 2
  • Lev Nachmanson
    • 3
  • Georg Sander
    • 4
  1. 1.Quinnipiac UniversityUSA
  2. 2.Technische Universität DortmundGermany
  3. 3.MicrosoftUSA
  4. 4.IBMGermany

Personalised recommendations