{{ :staff:cg-perugia.jpg?315px}} ====== Dr. Carsten Gutwenger ====== [[http://ls11-www.informatik.uni-dortmund.de|Chair of Algorithm Engineering]] \\ [[http://www.cs.uni-dortmund.de|Department of Computer Science]]\\ [[http://www.tu-dortmund.de/|Technische Universität Dortmund]] | Room: | 238 | | Address: | Otto-Hahn-Str. 14 | | | 44227 Dortmund, Germany | | Phone: | +49 231 755-7707 | | Fax: | +49 231 755-7740 | | E-mail: | | You can also find me on [[https://plus.google.com/106422086393783942209/|Google+]]. ===== Research Topics ===== * Algorithm engineering * Multicore and manycore algorithms * Graph drawing (e.g. crossing minimization, planar graphs, cluster graphs) * Graph algorithms * Combinatorial optimization ===== Selected Publications ===== A complete list of my publications can be found **[[staff/gutwenger/pubs|here]]** or at [[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/g/Gutwenger:Carsten.html|DBLP]]. * **[[http://doi.acm.org/10.1145/1671973.1671975|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.), [[http://www.crcpress.com/product/isbn/9781584888185|Algorithms and Theory of Computation Handbook]], Volume 2: Special Topics and Techniques, 2nd edition, CRC Press, 2009 * **[[http://dx.doi.org/10.1016/j.cpc.2009.04.018|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 * **[[http://dx.doi.org/10.1007/978-3-642-02882-3_25|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 * **[[http://www.siam.org/proceedings/soda/2009/SODA09_042_chimanim.pdf|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 * **[[http://dx.doi.org/10.1007/s00453-004-1128-8|Inserting an Edge Into a Planar Graph]]**\\ //Carsten Gutwenger, Petra Mutzel, and René Weiskircher//\\ Algorithmica 41(4), 2005, 289-308 * **[[http://dx.doi.org/10.1007/3-540-44541-2_8|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 ===== Projects ===== * **[[http://www.ogdf.net|OGDF - The Open Graph Drawing Framework]]**\\ OGDF is a C++ class library that offers a broad range of algorithms for two-dimensional graph drawing. * [[http://www.algorithm-engineering.de/?language=en|DFG Priority Programme 1307 Algorithm Engineering]]\\ Project **[[http://ls11-www.cs.uni-dortmund.de/people/wong/DFGWEB/start.html|Planarisierungsverfahren im Automatischen Zeichnen von Graphen]]** * **[[http://www.oreas.com/gde_en.php|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. * **[[http://www.ogdf.net/doku.php/project:gml2pic|The gml2pic utility]]**\\ A nice command line tool for converting GML files that store graph layouts into graphics files (like PNG, PDF etc.). ===== Committee Memberships ===== * [[http://www.gd2012.org/|Graph Drawing '12]] Contest committee chair * [[http://www.cocoa2012.ca/|COCOA '12]] program committee member * [[http://www.win.tue.nl/GD2011/|Graph Drawing '11]] program committee member * [[http://www.win.tue.nl/GD2011/|Graph Drawing '11]] [[http://www.graphdrawing.de/contest2011/|Contest]] committee chair (see also [[http://dx.doi.org/10.1007/978-3-642-25878-7_47|contest report]]) * [[http://www.graphdrawing.org/gd2010/|Graph Drawing '10]] [[http://www.graphdrawing.de/contest2010/|Contest]] committee member (see also [[http://dx.doi.org/10.1007/978-3-642-18469-7_44|contest report]]) * [[http://www.cise.ufl.edu/cocoon2010/|COCOON '10]] program committee member * [[http://www.cdm.depaul.edu/gd2009|Graph Drawing '09]] [[http://www.graphdrawing.de/contest2009/|Contest]] committee member (see also [[http://dx.doi.org/10.1007/978-3-642-11805-0_48|contest report]]) * [[http://www.ics.forth.gr/gd2008/|Graph Drawing '08]] [[http://www.graphdrawing.de/contest2008/gdcontest2008.html|Contest]] committee member (see also [[http://dx.doi.org/10.1007/978-3-642-00219-9_52|contest report]]) ===== Teaching / Lehre ===== ==== Wintersemester 2011/12 ==== * [[teaching:oop-2011|Object-oriented Programming]] (Exportveranstaltung für [[http://www.automationrobotics.uni-dortmund.de/|Automation & Robotics]]) ==== Sommersemester 2011 ==== * Projektgruppe: [[teaching:drughunting|Drug Hunting]] * Fachprojekt [[teaching:FP_AE-2011|Algorithm Engineering]] ==== Frühere Semester ==== Lehrveranstaltungen aus früheren Semestern sind [[staff:gutwenger:prev-teaching|hier]] zu finden. ==== Diplom- und Master-Studenten ==== * 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 * [[http://www.informatik.uni-koeln.de/ls_juenger/people/gronemann/|Martin Gronemann:]] Engineering the Fast-Multipole-Multilevel Method for multicore and SIMD architectures, 2009 * [[zey|Bernd Zey:]] [[http://ls11-www.cs.uni-dortmund.de/people/gutweng/diploma_thesis_zey.pdf|Algorithms for planar graph augmentation]], 2008 * [[http://www.informatik.uni-koeln.de/ls_juenger/people/mallach/|Sven Mallach:]] Beschleunigung ausgewählter paralleler Standard Template Library Algorithmen, 2008 * Christian Wolf: [[http://ls11-www.cs.uni-dortmund.de/people/gutweng/diploma_thesis_wolf.pdf|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 * [[wong|Hoi-Ming Wong:]] Kreuzungsminimales Einfügen einer Kante in einen aufwärtsplanaren sT-Graphen, 2006 ==== Infos für Studenten ==== * [[http://ls11-www.cs.uni-dortmund.de/people/chimani/seminarfolien.html|Hinweise zur Foliengestaltung]] ===== Useful Links ===== * **[[http://ls11-www.cs.uni-dortmund.de/people/gutweng/Conferences.html|Conference calendar]]**\\ A collection of interesting conferences and workshops in the field of combinatorial optimization, discrete and parallel algorithms, with deadlines and conference dates. * **[[staff/gutwenger/gd|Automatic Graph Drawing]]**\\ Various links to books, conferences, people, etc. * **[[staff/gutwenger/ae|Algorithm Engineering]]**\\ Various links to books, conferences, etc.