Planarization Approaches in Automatic Graph Drawing


Prof. Dr. Michael Jünger; Universität zu Köln
Prof. Dr. Petra Mutzel; Universität Dortmund


Project website


This automatic graph drawing project concerns the transfer of planarization approaches that have been used primarily in academia so far, to practical applications. We consider a selection of important use-cases, and we try to address the problems arising in these applications. We integrate various application specific constraints into the planarization method, and we provide open source software (see OGDF library) as well as benchmarks instances.

Currently, the application domains include visualization in software engineering and biochemistry, e.g. the visualization of metabolic and protein interaction networks. We will continuously apply the algorithm engineering cycle to our results, so that the engineering process is significantly influenced by the feedback from our cooperation partners.



  • M. Chimani, C. Gutwenger, M. Jünger, G. W. Klau, K. Klein and P. Mutzel. "The Open Graph Drawing Framework (OGDF)". R. Tamassia ed. CRC Press. 2012. [More] 
  • C. Buchheim, M. Chimani, C. Gutwenger, M. Jünger and P. Mutzel. "Crossings and Planarization". R. Tamassia ed. CRC Press. 2012. [More] 
  • C. Bachmaier et al.. "The Open Graph Archive: A Community-Driven Effort". Graph Drawing. M. van Kreveld and B. Speckmann eds. 2012. pp. 435-440. [More] 
  • N. Kriege and P. Mutzel. "Subgraph Matching Kernels for Attributed Graphs". International Conference on Machine Learning (ICML). 2012. [More] 
  • M. Chimani, P. Hliněný and P. Mutzel. "Vertex insertion approximates the crossing number of apex graphs", European Journal of Combinatorics, Vol. 33. 2012, pp. 326-335. [More] 
View All


[ Back ]