Differences
This shows you the differences between two versions of the page.
staff:gutwenger [2014-08-18 11:58] |
staff:gutwenger [2015-09-11 10:16] |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | {{ :staff:gutwenger:carsten-1.jpg?280|}} | ||
- | ====== 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]] | ||
- | |||
- | <html> | ||
- | <script language="JavaScript" type="text/javascript"> | ||
- | // Skript stelle Funktionen zur Verfuegung, um eMails zu maskieren | ||
- | |||
- | function em_maskieren (ename, dname, etext, esubject, ebody) { | ||
- | var apre = "<a href='mailto:"; | ||
- | var asubject = "?subject="; | ||
- | var abody = "&body="; | ||
- | var apost = "' class=\"email_link\">"; | ||
- | var aend = "<\/a>"; | ||
- | var at = "@"; | ||
- | var leer = "<a>"; | ||
- | |||
- | if ((dname == "") ||(ename == "")) { | ||
- | document.write(leer); | ||
- | document.write(leer + aend); | ||
- | } | ||
- | else if ((etext == "") || (etext === null)) { | ||
- | document.write(apre + ename + at + dname + apost); | ||
- | document.write(ename + " AT " + dname + aend); | ||
- | } | ||
- | else if ((esubject == "") || (esubject === null)) { | ||
- | document.write(apre + ename + at + dname + apost); | ||
- | document.write(etext + aend); | ||
- | } | ||
- | else if ((ebody == "") || (ebody === null)) { | ||
- | document.write(apre + ename + at + dname + asubject + esubject + apost); | ||
- | document.write(etext + aend); | ||
- | } | ||
- | else { | ||
- | document.write(apre + ename + at + dname + asubject + esubject + abody + ebody + apost); | ||
- | document.write(etext + aend); | ||
- | } | ||
- | } | ||
- | </script> | ||
- | </html> | ||
- | |||
- | |||
- | | Room: | 238 | | ||
- | | Address: | Otto-Hahn-Str. 14 | | ||
- | | | 44227 Dortmund, Germany | | ||
- | | Phone: | +49 231 755-7707 | | ||
- | | Fax: | +49 231 755-7740 | | ||
- | | E-mail: | <html> | ||
- | <script language="JavaScript" type="text/javascript"> | ||
- | em_maskieren("carsten.gutwenger","cs.tu-dortmund.de", "Send me an email", "", "") | ||
- | </script> | ||
- | <noscript> | ||
- | carsten [dot] gutwenger [at] cs [dot] tu-dortmund [dot] de | ||
- | </noscript> | ||
- | </html> | | ||
- | |||
- | You can also find me on [[https://plus.google.com/+CarstenGutwenger|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://dx.doi.org/10.1137/1.9781611973198.9|Practical Experience with Hanani-Tutte for Testing c-Planarity]]**\\ //Carsten Gutwenger, Petra Mutzel, and Marcus Schaefer//\\ In: Proceedings of Algorithm Engineering & Experiments (ALENEX 2014), Portland, SIAM, 2014, 86-97 | ||
- | |||
- | * **[[http://www.cs.brown.edu/~rt/gdhandbook/chapters/crossings.pdf|Crossings and Planarization]]**\\ //Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael Jünger, and Petra Mutzel//\\ Chapter 2 in: R. Tamassia (ed.), [[http://www.cs.brown.edu/~rt/gdhandbook/|Handbook of Graph Drawing and Visualization]]\\ [[http://www.crcpress.com/product/isbn/9781584884125|CRC Press]], 2013, 43-85 | ||
- | |||
- | * **[[http://dx.doi.org/10.7155/jgaa.00264|Advances in the Planarization Method: Effective Multiple Edge Insertions]]**\\ //Markus Chimani and Carsten Gutwenger//\\ Journal of Graph Algorithms and Applications 16(3), 2012, 729-757 | ||
- | |||
- | * **[[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.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.bmwi.de/|BMWi]]-Projekt [[http://www.stromnetzplanung.de/|Bewertung und Planung von Stromnetzen]] | ||
- | |||
- | * [[http://www.esf.org/activities/eurocores/running-programmes/eurogiga.html|EuroGIGA]] **[[http://kam.mff.cuni.cz/gradr/index.html|Project No. 10-EuroGIGA-OP-003 GraDR: Graph Drawings and Representations]]**\\ The Collaborative Research Project aims at attacking well known hard problems in graph drawing, both from structural and algorithmic points of view. The research will be concentrated around //planarity issues//, will go //beyond planarity// and explore //geometric representations of graphs//. | ||
- | |||
- | * [[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://lamut.informatik.uni-wuerzburg.de/|Graph Drawing '14]] [[http://graphdrawing.de/contest2014/|Contest]] committee chair | ||
- | * [[http://www.diagrams-conference.org/2014/GraphViP|GraphVIP '14]] program committee member | ||
- | * [[http://gd2013.labri.fr/|Graph Drawing '13]] [[http://graphdrawing.de/contest2013/index.html|Contest]] committee chair | ||
- | * [[http://www.gd2012.org/|Graph Drawing '12]] [[http://graphdrawing.de/contest2012/index.html|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 2014/15 ==== | ||
- | |||
- | * Seminar [[teaching:seminarae-ws2014|Algorithm Engineering]] | ||
- | |||
- | ==== Sommersemester 2014 ==== | ||
- | |||
- | * [[staff/gutwenger/ea-2014|Effiziente Algorithmen]] | ||
- | |||
- | ==== Wintersemester 2013/14 ==== | ||
- | |||
- | * [[teaching:ep1314sopra|Praktikum]] zu Einführung in die Programmierung | ||
- | * Seminar [[teaching:seminarae-ws2013|Algorithm Engineering]] | ||
- | |||
- | ==== Sommersemester 2013 ==== | ||
- | |||
- | * Seminar [[teaching:seminarae-ss2013|Algorithm Engineering]] | ||
- | |||
- | |||
- | ==== Frühere Semester ==== | ||
- | |||
- | Lehrveranstaltungen aus früheren Semestern sind [[staff:gutwenger:prev-teaching|hier]] zu finden. | ||
- | |||
- | |||
- | ==== Diplom- und Master-Studenten ==== | ||
- | |||
- | Allgemeine Informationen für Diplom- und BA/MA-Studenten findet man [[de:teaching:check-io|hier]]. | ||
- | |||
- | === Aktuelle und ehemalige Diplomanden und Master-Studenten === | ||
- | |||
- | * Thorsten Flügel: Partitionsbasierte Kürzeste-Wege-Algorithmen für Grafikkarten, 2013 | ||
- | * Philipp Lewe: Consraint-basierte Layoutverfahren und ihre Integration in das Open Graph Drawing Framework, 2012 | ||
- | * Tobias Brinkjost: Touch me, I'm a node — A graph drawing related game for the iPad, 2012 | ||
- | * Moritz Schallaböck: New Optimal Compaction Strategies for Orthogonal Graph Layout, 2011 | ||
- | * Sebastian Sondern: Konzeption und Realisierung einer Graphenbibliothek zur Evaluierung von Visualisierungsmethoden für Graphen, 2011 | ||
- | * 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: [[http://home.arcor.de/dieeinzigwahretotefliege/Uni/DiplomarbeitKerkhof.pdf|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 | ||
- | |||
- | ==== Schüler und Studieninteressierte ==== | ||
- | |||
- | * Projekt [[http://ls2-www.cs.uni-dortmund.de/bwinf/graphen.shtml|Graphenzeichnen]] beim **[[http://ls2-www.cs.uni-dortmund.de/bwinf/|BWInf-Workshop 2012]]**\\ Workshop für Teilnehmer des [[http://www.bundeswettbewerb-informatik.de/|Bundeswettbewerbs Informatik]]. Wir beschäftigen uns mit dem Zeichnen hierarchischer Graphen mit Hilfe des Sugiyama-Verfahrens.\\ Weitere Informationen für Workshop-Teilnehmer **[[staff:gutwenger:bwinf-2012|gibt's hier]]**! | ||
- | |||
- | ==== 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/cf/cf.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. |