====== Publications ====== **//Carsten Gutwenger's list of publications//** Other sources: [[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/g/Gutwenger:Carsten.html|DBLP]], [[http://gdea.informatik.uni-koeln.de/view/people/Gutwenger,_Carsten.html|GDEA]], [[http://liinwww.ira.uka.de/csbib?query=au:(GutwengerC*+Gutwenger)|CSB]], [[http://www.metapress.com/content?k=author:Gutwenger|Metapress]], [[http://www.zentralblatt-math.org/ioport/en/?q=au:Gutwenger, C*|io-port.net]] ===== Overview and Book ===== * **[[http://www.cs.brown.edu/~rt/gdhandbook/chapters/crossings.pdf|Crossings and Planarization]]** [[bib-BCGJM2013|(BibTeX)]]\\ //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://www.cs.brown.edu/~rt/gdhandbook/chapters/ogdf.pdf|The Open Graph Drawing Framework (OGDF)]]** [[bib-CGJKKM2013|(BibTeX)]]\\ //Markus Chimani, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Karsten Klein, and Petra Mutzel//\\ Chapter 17 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, 543-569 * **Graph Drawing Algorithms** [[bib-EGHM2009|(BibTeX)]]\\ //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 * **GoVisual: A Diagramming Software for UML Class Diagrams** [[bib-GJKKLM2003|(BibTeX)]]\\ //Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, and Petra Mutzel//\\ In: M. Jünger and P. Mutzel (eds.), [[http://www.springer.com/mathematics/numerical+and+computational+mathematics/book/978-3-540-00881-1|Graph Drawing Software]]\\ Springer-Verlag, 2003, 257-278 * **Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS** [[bib-EGJR2001|(BibTeX)]]\\ //Matthias Elf, Carsten Gutwenger, Michael Jünger, and Giovanni Rinaldi//\\ In: M. Jünger and D. Naddef (eds.), [[http://dx.doi.org/10.1007/3-540-45586-8_5|Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions]]\\ Lecture Notes in Computer Science 2241, Springer Verlag, 2001, 157-222 ===== Journals ===== * **[[http://dx.doi.org/10.1007/s00287-013-0682-3|Algorithm Engineering im Graphenzeichnen]]** [[bib-GGJM2013|(BibTeX)]]\\ //Martin Gronemann, Carsten Gutwenger, Michael Jünger, and Petra Mutzel//\\ Informatik-Spektrum 36(2), 2013, 162-173 * **[[http://dx.doi.org/10.7155/jgaa.00264|Advances in the Planarization Method: Eff ective Multiple Edge Insertions]]** [[bib-CG2012|(BibTeX)]]\\ //Markus Chimani and Carsten Gutwenger//\\ Journal of Graph Algorithms and Applications 16(3), 2012, 729-757 * **[[http://dx.doi.org/10.1007/s00453-010-9433-x|Colored Simultaneous Geometric Embeddings and Universal Pointsets]]** [[bib-BEEFFetal2011|(BibTeX)]]\\ //Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, and Antonios Symvonis//\\ Algorithmica 60(3), 2011, 569-592 * **[[http://dx.doi.org/10.7155/jgaa.00220|Upward Planarization Layout]]** [[bib-CGMW2011|(BibTeX)]]\\ //Markus Chimani, Carsten Gutwenger, Petra Mutzel, and Hoi-Ming Wong//\\ Journal of Graph Algorithms and Applications 15(1), 2011, 127-155 * **[[http://doi.acm.org/10.1145/1671973.1671975|Layer-Free Upward Crossing Minimization]]** [[bib-CGMW2010|(BibTeX)]]\\ //Markus Chimani , Carsten Gutwenger, Petra Mutzel, and Hoi-Ming Wong//\\ ACM Journal of Experimental Algorithmics 15, Article No. 2.2, 2010 * **[[http://dx.doi.org/10.1016/j.cpc.2009.04.018|HONEI: A collection of libraries for numerical computations targeting multiple processor architectures]]** [[bib-DGMRGG2009|(BibTeX)]]\\ //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://doi.acm.org/10.1145/1498698.1564504|Experiments on Exact Crossing Minimization Using Column Generation]]** [[bib-CGM2009|(BibTeX)]]\\ //Markus Chimani, Carsten Gutwenger, and Petra Mutzel//\\ ACM Journal of Experimental Algorithmics 14, Article No. 3.4, 2009 * **[[http://dx.doi.org/10.1016/j.disc.2007.12.078|Non-Planar Core Reduction of Graphs]]** [[bib-CG2009|(BibTeX)]]\\ //Markus Chimani and Carsten Gutwenger//\\ Discrete Mathematics 309(7), 2009, 1838-1855 * **[[http://dx.doi.org/10.1016/j.disopt.2007.05.006|A Branch-and-Cut Approach to the Crossing Number Problem]]** [[bib-BCEGJetal2008|(BibTeX)]]\\ //Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, and René Weiskircher//\\ Discrete Optimization 5(2), 2008, 373-388 * **[[http://dx.doi.org/10.7155/jgaa.00160|Planarity Testing and Optimal Edge Insertion with Embedding Constraints]]** [[bib-GKM2008|(BibTeX)]]\\ //Carsten Gutwenger, Karsten Klein, and Petra Mutzel//\\ Journal of Graph Algorithms and Applications 12(1), 2008, 73-95 * **[[http://dx.doi.org/10.1016/j.endm.2007.01.036|On the Minimum Cut of Planarizations]]** [[bib-CGM2007|(BibTeX)]]\\ //Markus Chimani, Carsten Gutwenger, and Petra Mutzel//\\ Electronic Notes in Discrete Mathematics 28, 2007, 177-184 * **[[http://dx.doi.org/10.1007/s00453-004-1128-8|Inserting an Edge Into a Planar Graph]]** [[bib-GMW2005|(BibTeX)]]\\ //Carsten Gutwenger, Petra Mutzel, and René Weiskircher//\\ Algorithmica 41(4), 2005, 289-308 * **[[http://dx.doi.org/10.1057/palgrave.ivs.9500078|Automatic Layout of UML Class Diagrams in Orthogonal Style]]** [[bib-EGKKJetal2004|(BibTeX)]]\\ //Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Karsten Klein, Sebastian Leipert, and Martin Siebenhaller//\\ Information Visualization 3(3), 2004, 189-208 ===== Refereed Conference Proceedings ===== * **Drawing Partially Embedded and Simultaneously Planar Graphs**\\ //Timothy Chan, Farbrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, and Marcus Schaefer//\\ In: 22nd Symposium on Graph Drawing 2014\\ Lecture Notes in Computer Science, Springer-Verlag, to appear. * **Examining the Compactness of Automatically Generated Layouts for Practical Diagrams**\\ //Carsten Gutwenger, Reinhard von Hanxleden, Petra Mutzel, Ulf Rüegg, and Miro Spönemann//\\ In: Proceedings of Graph Visualization in Practice (GraphVIP), to appear in 2014. * **[[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://dx.doi.org/10.1007/978-3-642-36763-2_7|Progress on Partial Edge Drawings]] [[http://arxiv.org/abs/1209.0830|(Full Version)]]**\\ //Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, and Alexander Wolff//\\ In: W. Didimo, M. Patrignani (eds.), 20th Symposium on Graph Drawing 2012, Redmond\\ Lecture Notes in Computer Science 7704, Springer-Verlag, 2013, 67-78 * **[[http://dx.doi.org/10.1007/978-3-642-25878-7_10|Advances in the Planarization Method: Effective Multiple Edge Insertions]]**\\ //Markus Chimani and Carsten Gutwenger//\\ In: M. van Kreveld, B. Speckmann (eds.), 19th Symposium on Graph Drawing 2011, Eindhoven\\ Lecture Notes in Computer Science 7034, Springer-Verlag, 2011, 87-98 * **[[http://dx.doi.org/10.1007/978-3-642-18469-7_8|An Experimental Evaluation of Multilevel Layout Methods]]**\\ //Carsten Gutwenger, Karsten Klein, and Petra Mutzel//\\ In: U. Brandes, S. Cornelsen (eds.), 18th Symposium on Graph Drawing 2010, Konstanz\\ Lecture Notes in Computer Science 6502, Springer-Verlag, 2011, 80-91 * **[[http://dx.doi.org/10.1007/978-3-642-18469-7_13|Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints]]**\\ //Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, and Hoi-Ming Wong//\\ In: U. Brandes, S. Cornelsen (eds.), 18th Symposium on Graph Drawing 2010, Konstanz\\ Lecture Notes in Computer Science 6502, Springer-Verlag, 2011, 141-152 * **[[http://dx.doi.org/10.1007/978-3-642-16233-6_6|Improved Scalability by Using Hardware-Aware Thread Affinities]]**\\ //Sven Mallach and Carsten Gutwenger//\\ In: R. Keller, D. Kramer, J.-P. Weiß (eds.), Proceedings of Facing the Multicore-Challenge, Heidelberg Academy of Sciences and Humanities\\ Lecture Notes in Computer Science 6310, Springer-Verlag, 2010, 29-41 * **[[http://dx.doi.org/10.1007/978-3-642-11805-0_11|Upward Planarization Layout]]**\\ //Markus Chimani, Carsten Gutwenger, Petra Mutzel, and Hoi-Ming Wong//\\ In: D. Eppstein, E. Gansner (eds.), 17th Symposium on Graph Drawing 2009, Chicago\\ Lecture Notes in Computer Science 5849, Springer-Verlag, 2010, 94-106 * **[[http://dx.doi.org/10.1007/978-3-642-10217-2_29|Planar Biconnectivity Augmentation With Fixed Embedding]]**\\ //Carsten Gutwenger, Petra Mutzel, and Bernd Zey//\\ In: J. Fiala, J. Kratochvíl, M. Miller (eds.), 20th International Workshop on Combinatorial Algorithms 2009, Hradez nad Moravicí, Czech Republic\\ Lecture Notes in Computer Science 5874, Springer-Verlag, 2009, 289-300 * **[[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/978-3-642-00219-9_16|An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges]]**\\ //J. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel, and Michael Schulz//\\ In: I. G. Tollis, M. Patrignani (eds.), 16th Symposium on Graph Drawing 2008, Crete\\ Lecture Notes in Computer Science 5417, Springer-Verlag, 2009, 157-168 * **[[http://dx.doi.org/10.1007/978-3-642-00219-9_12|Computing Maximum C-Planar Subgraphs]]**\\ //Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, and Petra Mutzel//\\ In: I. G. Tollis, M. Patrignani (eds.), 16th Symposium on Graph Drawing 2008, Crete\\ Lecture Notes in Computer Science 5417, Springer-Verlag, 2009, 114-120 * **[[http://dx.doi.org/10.1007/978-3-540-68552-4_5|Layer-Free Upward Crossing Minimization]]**\\ //Markus Chimani , Carsten Gutwenger, Petra Mutzel, and Hoi-Ming Wong//\\ In: C. McGeoch (ed.), Experimental Algorithms (7th International Workshop, WEA 2008), Provincetown, MA, USA\\ Lecture Notes in Computer Science 5038, Springer-Verlag, 2008, 55-68 * **[[http://dx.doi.org/10.1007/978-3-540-77120-3_18|Algorithms for the Hypergraph and the Minor Crossing Number Problems]]**\\ //Markus Chimani and Carsten Gutwenger//\\ In: T. Nishizeki (ed.), 18th International Symposium on Algorithms and Computation (ISAAC 2007), Sendai, Japan\\ Lecture Notes in Computer Science 4835, Springer-Verlag, 2007, 184-195 * **[[http://dx.doi.org/10.1007/978-3-540-73545-8_26|Colored Simultaneous Geometric Embeddings]]**\\ //Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen Kobourov, Giuseppe Liotta, Petra Mutzel, and Antonios Symvonis//\\ In: G. Lin (ed.), 13th Annual International Computing and Combinatorics Conference 2007, Banff, Canada\\ Lecture Notes in Computer Science 4598, Springer-Verlag, 2007, 254-263 * **[[http://dx.doi.org/10.1007/978-3-540-70904-6_14|Planarity Testing and Optimal Edge Insertion with Embedding Constraints]]**\\ //Carsten Gutwenger, Karsten Klein, and Petra Mutzel//\\ In: M. Kaufmann, D. Wagner (eds.), 14th Symposium on Graph Drawing 2006, Karlsruhe\\ Lecture Notes in Computer Science 4372, Springer-Verlag, 2007, 126-137 * **[[http://dx.doi.org/10.1007/11764298_28|Experiments on Exact Crossing Minimization Using Column Generation]]**\\ //Markus Chimani, Carsten Gutwenger, and Petra Mutzel//\\ In: M. Serna (ed.), Proceedings of WEA 2006, Menorca\\ Lecture Notes in Computer Science 4007, Springer-Verlag, 2006, 303-315 * **[[http://dx.doi.org/10.1007/11618058_21|Non-Planar Core Reduction of Graphs]]**\\ //Carsten Gutwenger and Markus Chimani//\\ In: P. Healy, N. S. Nikolov (eds.), 13th Symposium on Graph Drawing 2005, Limerick\\ Lecture Notes in Computer Science 3843, Springer-Verlag, 2006, 223-234 * **[[http://www.springerlink.com/content/dbcv5uptvh1uyt92|Graph Embedding with Minimum Depth and Maximum External Face]]**\\ //Carsten Gutwenger and Petra Mutzel//\\ In: Liotta, G. (ed.), 11th Symposium on Graph Drawing 2003, Perugia\\ Lecture Notes in Computer Science 2912, Springer-Verlag, 2004, 259-272 * **[[http://www.springerlink.com/content/6ac0pmpyqwcg0txr|An Experimental Study of Crossing Minimization Heuristics]]**\\ //Carsten Gutwenger and Petra Mutzel//\\ In: Liotta, G. (ed.), 11th Symposium on Graph Drawing 2003, Perugia\\ Lecture Notes in Computer Science 2912, Springer-Verlag, 2004, 13-24 * **[[http://www.springerlink.com/content/wgj7w9rhbgd4yv9m|Subgraph Induced Planar Connectivity Augmentation]]**\\ //Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, and René Weiskircher//\\ In: Bodlaender, H. (ed.), Graph-Theoretic Concepts in Computer Science, 29-th International Workshop, WG 2003, Elspeet, The Netherlands\\ Lecture Notes in Computer Science 2880, Springer-Verlag, 2003, 261-272 * **[[http://doi.acm.org/10.1145/774833.774859|A New Approach for Visualizing UML Class Diagrams]]**\\ //Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, and Petra Mutzel//\\ In: S. Diehl, J. Stasko (eds.), Software Visualization\\ 1st ACM Symposium on Software Visualization (SoftVis' 03), FCRC 2003, San Diego, California, 179-188, 2003 * **[[http://dx.doi.org/10.1007/3-540-36151-0_21|Advances in C-Planarity Testing of Clustered Graphs]]**\\ //Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, and René Weiskircher//\\ In: M. Goodrich, S. G. Kobourov (eds.), Graph Drawing, 10th International Symposium on Graph Drawing, GD '2002, Irvine, California\\ Lecture Notes in Computer Science 2528, Springer-Verlag, 220-235, 2002 * **[[http://dx.doi.org/10.1007/3-540-45875-1_24|Graph Drawing Algorithm Engineering with AGD]]**\\ //Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, and Petra Mutzel//\\ In: S. Diehl (ed.), International Dagstuhl Seminar on Software Visualization 2001\\ Lecture Notes in Computer Science 2269, Springer-Verlag, 2002, 307-323 * **[[http://portal.acm.org/citation.cfm?id=365455|Inserting an Edge into a Planar Graph]]**\\ //Carsten Gutwenger, Petra Mutzel, and René Weiskircher//\\ In: Proceedings of the Twelfth ACM-SIAM Symposium on Discrete Algorithms, (SODA '2001), Washington, DC, ACM Press, 2001, 246-255 * **[[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 * **[[http://dx.doi.org/10.1007/3-540-37623-2_13|Planar Polyline Drawings with Good Angular Resolution]]**\\ //Carsten Gutwenger and Petra Mutzel//\\ Whitesides, S. (ed.), Graph Drawing, 6th International Symposium on Graph Drawing, GD '98, Montreal, Canada\\ Lecture Notes in Computer Science 1547, Springer-Verlag, 1998, 167-182 * **[[http://ls11-www.cs.tu-dortmund.de/people/gutweng/MPI-I-97-1-019.pdf|AGD-Library: A Library of Algorithms for Graph Drawing]]**\\ //David Alberts, Carsten Gutwenger, Petra Mutzel, and Stefan Näher//\\ G.F. Italiano, S. Orlando (eds.), WAE '97 ([[http://www.dsi.unive.it/~wae97/proceedings/|Proceedings of the Workshop on Algorithm Engineering]]), Venice, Italy, Sept. 11-13, 1997, 112-123 ===== Posters and Demos ===== * **[[http://dx.doi.org/10.1007/978-3-642-25878-7_42|The Open Graph Archive: A Community-Driven Effort]] [[http://arxiv.org/abs/1109.1465v1|(Full Version)]]**\\ //Christian Bachmaier, Franz J. Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein, Miro Spönemann, Matthias Stegmeier, and Michael Wybrow//\\ In: M. van Kreveld, B. Speckmann (eds.), 19th Symposium on Graph Drawing 2011, Eindhoven\\ Lecture Notes in Computer Science 7034, Springer-Verlag, 2011, 435-440 * **The Open Graph Drawing Framework [[http://ogdf.net/lib/exe/fetch.php/ogdf:ogdfposter_a1.pdf|(Poster)]] [[http://ogdf.net/lib/exe/fetch.php/ogdf:ogdfposter.pdf|(Abstract)]]**\\ //Markus Chimani, Carsten Gutwenger, Michael Jünger, Karsten Klein, Petra Mutzel, and Michael Schulz//\\ 15th International Symposium on Graph Drawing 2007, Sydney (GD07) * **[[http://www.springerlink.com/content/nee0ww72mgtcpjmj|GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon - System Demonstration]]**\\ //Carsten Gutwenger, Joachim Kupke, Karsten Klein, and Sebastian Leipert//\\ In: Liotta, G. (ed.), 11th Symposium on Graph Drawing 2003, Perugia\\ Lecture Notes in Computer Science 2912, Springer-Verlag, 2004, 123-128 * **[[http://dx.doi.org/10.1007/3-540-45848-4_52|AGD: A Library of Algorithms for Graph Drawing]]**\\ //Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, and René Weiskircher//\\ In: Mutzel, P., Jünger, M., and Leipert, S. (eds.), 9th International Symposium on Graph Drawing, GD '2001, Vienna, Austria\\ Lecture Notes in Computer Science 2265, Springer-Verlag, 2002, 473-474 * **[[http://dx.doi.org/10.1007/3-540-45848-4_46|Caesar Automatic Layout of UML Class Diagrams]]**\\ //Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, and Petra Mutzel//\\ In: Mutzel, P., Jünger, M., and Leipert, S. (eds.), 9th International Symposium on Graph Drawing, GD '2001, Vienna, Austria\\ Lecture Notes in Computer Science 2265, Springer-Verlag, 2002, 461-462 * **[[http://dx.doi.org/10.1007/3-540-37623-2_44|AGD: A Library of Algorithms for Graph Drawing (Poster-Abstract)]]**\\ //Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, and Sebastian Leipert//\\ Whitesides, S. (ed.), Graph Drawing, 6th International Symposium on Graph Drawing, GD '98, Montreal, Canada\\ Lecture Notes in Computer Science 1547, Springer-Verlag, 1998, 456-457 ===== Contest Reports ===== * **Graph Drawing Contest Report**\\ //Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, and Georg Sander//\\ In: S. Wismath, A. Wolff (eds.), 21st Symposium on Graph Drawing **2013**, Bordeaux (Talence)\\ Lecture Notes in Computer Science 8242, Springer-Verlag, 2013, 508-513 * **[[http://dx.doi.org/10.1007/978-3-642-36763-2_58|Graph Drawing Contest Report]]**\\ //Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, and Georg Sander//\\ In: W. Didimo, M. Patrignani (eds.), 20th Symposium on Graph Drawing **2012**, Redmond\\ Lecture Notes in Computer Science 7704, Springer-Verlag, 2013, 575-579 * **[[http://dx.doi.org/10.1007/978-3-642-25878-7_47|Graph Drawing Contest Report]]**\\ //Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, and Georg Sander//\\ In: M. van Kreveld, B. Speckmann (eds.), 19th Symposium on Graph Drawing **2011**, Eindhoven\\ Lecture Notes in Computer Science 7034, Springer-Verlag, 2011, 449-455 * **[[http://dx.doi.org/10.1007/978-3-642-18469-7_44|Graph Drawing Contest Report]]**\\ //Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, and Georg Sander//\\ In: U. Brandes (ed.), 18th Symposium on Graph Drawing **2010**, Konstanz\\ Lecture Notes in Computer Science 6502, Springer-Verlag, 2011, 406-411 * **[[http://dx.doi.org/10.1007/978-3-642-11805-0_48|Graph Drawing Contest Report]]**\\ //Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, and Georg Sander//\\ In: D. Eppstein, E. Gansner (eds.), 17th Symposium on Graph Drawing **2009**, Chicago\\ Lecture Notes in Computer Science 5849, Springer-Verlag, 2010, 428-433 * **[[http://dx.doi.org/10.1007/978-3-642-00219-9_52|Graph Drawing Contest Report]]**\\ //Ugur Dogrusoz, Christian A. Duncan, Carsten Gutwenger, and Georg Sander//\\ In: I. G. Tollis, M. Patrignani (eds.), 16th Symposium on Graph Drawing **2008**, Crete\\ Lecture Notes in Computer Science 5417, Springer-Verlag, 2009, 453-458 ===== Theses ===== * **[[http://ls11-www.cs.tu-dortmund.de/people/gutweng/diss.pdf|Application of SPQR-Trees in the Planarization Approach for Drawing Graphs]]** [[bib-Gut2010|(BibTeX)]]\\ //Carsten Gutwenger//\\ PhD Thesis, Technische Universität Dortmund, 2010 * **[[http://ls11-www.cs.tu-dortmund.de/people/gutweng/diplom.pdf|Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen]]** [[bib-Gut1999|(BibTeX)]]\\ //Carsten Gutwenger//\\ Diplomarbeit, Universität des Saarlandes, 1999