Dr. Carsten Gutwenger

Chair of Algorithm Engineering
Department of Computer Science
Technische Universität Dortmund

You can also find me on Google+.

• Algorithm engineering
• Multicore and manycore algorithms
• Graph drawing (e.g. crossing minimization, planar graphs, cluster graphs)
• Graph algorithms
• Combinatorial optimization

A complete list of my publications can be found here or at DBLP.

• Layer-Free Upward Crossing Minimization
  Markus Chimani , Carsten Gutwenger, Petra Mutzel, and Hoi-Ming Wong
  ACM Journal of Experimental Algorithmics 15, Article No. 2.2, 2010

• Graph Drawing Algorithms
  Peter Eades, Carsten Gutwenger, Seok-Hee Hong, and Petra Mutzel
  Chapter 6 in: M. Attallah and M. Blanton (eds.), Algorithms and Theory of Computation Handbook, Volume 2: Special Topics and Techniques, 2nd edition, CRC Press, 2009

• HONEI: A collection of libraries for numerical computations targeting multiple processor architectures
  Danny van Dyk, Markus Geveler, Sven Mallach, Dirk Ribbrock, Dominik Göddeke, and Carsten Gutwenger
  Computer Physics Communications 180, 2009, 2534-2543, CPC's 40th anniversary issue

• On the Hardness and Approximability of Planar Biconnectivity Augmentation
  Carsten Gutwenger, Petra Mutzel, and Bernd Zey
  In: H. Q. Ngo (ed.), 15th Annual International Computing and Combinatorics Conference 2009, Niagara Falls, New York, USA
  Lecture Notes in Computer Science 5609, Springer-Verlag, 2009, 249-257

• Inserting a Vertex into a Planar Graph
  Markus Chimani, Carsten Gutwenger, Petra Mutzel, and Christian Wolf
  In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, (SODA '2009), New York, ACM Press, 2009, 375-383

• Inserting an Edge Into a Planar Graph
  Carsten Gutwenger, Petra Mutzel, and René Weiskircher
  Algorithmica 41(4), 2005, 289-308

• A Linear Time Implementation of SPQR Trees
  Carsten Gutwenger and Petra Mutzel
  In: Marks, J. (ed.), Graph Drawing, 8th International Symposium on Graph Drawing, GD '2000, Colonial Williamsburg, Virginia
  Lecture Notes in Computer Science 1984, Springer-Verlag, 2001, 77-90

• OGDF - The Open Graph Drawing Framework
  OGDF is a C++ class library that offers a broad range of algorithms for two-dimensional graph drawing.

• DFG Priority Programme 1307 Algorithm Engineering
  Project Planarisierungsverfahren im Automatischen Zeichnen von Graphen

• GoVisual Diagram Editor
  The GoVisual Diagram editor (GDE) provides powerful functionality for editing and automatic layout of diagrams. Diagrams are represented in form of graphs and cluster graphs.

• The gml2pic utility
  A nice command line tool for converting GML files that store graph layouts into graphics files (like PNG, PDF etc.).

• Graph Drawing '12 Contest committee chair
• COCOA '12 program committee member
• Graph Drawing '11 program committee member
• Graph Drawing '11 Contest committee chair (see also contest report)
• Graph Drawing '10 Contest committee member (see also contest report)
• COCOON '10 program committee member
• Graph Drawing '09 Contest committee member (see also contest report)
• Graph Drawing '08 Contest committee member (see also contest report)

• Object-oriented Programming (Exportveranstaltung für Automation & Robotics)

• Projektgruppe: Drug Hunting
• Fachprojekt Algorithm Engineering

Lehrveranstaltungen aus früheren Semestern sind hier zu finden.

• Moritz Schallaböck: New Optimal Compaction Strategies for Orthogonal Graph Layout
• Sebastian Sondern: Konzeption und Realisierung einer Graphenbibliothek zur Evaluierung von Visualisierungsmethoden für Graphen
• Hendrik Ewerlin: Energiebasierte Optimierung geradlinig planarer Graphzeichnungen, 2009
• Martin Gronemann: Engineering the Fast-Multipole-Multilevel Method for multicore and SIMD architectures, 2009
• Bernd Zey: Algorithms for planar graph augmentation, 2008
• Sven Mallach: Beschleunigung ausgewählter paralleler Standard Template Library Algorithmen, 2008
• Christian Wolf: Inserting a vertex into a planar graph, 2008
• Thorsten Kerkhof: Algorithmen zur Bestimmung von guten Graph-Einbettungen für orthogonale Zeichnungen, 2007
• Jan Papenfuß: Dynamisches Einfügen von Kanten zur Beschleunigung der Planarisierungsmethode, 2007
• Hoi-Ming Wong: Kreuzungsminimales Einfügen einer Kante in einen aufwärtsplanaren sT-Graphen, 2006

• Hinweise zur Foliengestaltung

• Conference calendar
  A collection of interesting conferences and workshops in the field of combinatorial optimization, discrete and parallel algorithms, with deadlines and conference dates.
• Automatic Graph Drawing
  Various links to books, conferences, people, etc.
• Algorithm Engineering
  Various links to books, conferences, etc.