Sabine Cornelsen

address   University of Konstanz Department of Computer & Information Science Box D 67 78457 Konstanz, Germany phone +49 +7531 / 88-4375 fax +49 +7531 / 88-3577 email cornelse @ inf.uni-konstanz.de url http://www.inf.uni-konstanz.de/~cornelse/ office E 216 (map of the university) meeting hours by appointment

Vita
	10/04-12/10   Maternal leave since 03/04 Teaching and research assistant with Prof. Dr. Ulrik Brandes (Algorithmics) at the University of Konstanz. 04/03-01/04 Scholarship within the EU-project AMORE at the University of L'Aquila 08/98-03/03 PhD student with Prof. Dr. Dorothea Wagner ( Algorithms and Data Structures) at the University of Konstanz. thesis on Drawing Families of Cuts in a Graph 10/91-07/98 Studied Mathematics with Physics minor at the University of Konstanz thesis (in German) on Stetigkeitsfragen rund ums 17. Hilbertsche Problem (ps,pdf) under supervision of Prof. Dr. Alexander Prestel

Teaching
	In Konstanz, teaching is mostly done in German: SS 11   Übungen zur Vorlesung Graph Drawing WS 10/11 Teile der Vorlesung Design and Analysis of Algorithms SS 10 Seminar Algorithmische Geometrie WS 09/10 Teile der Vorlesung Algorithmen und Datenstrukturen SS 09 Teile der Vorlesung Zeichnen von Graphen WS 08/09 Teile der Vorlesung Design and Analysis of Algorithms WS 06/07 Entwurf und Analyse von Algorithmen SS 04 Übungen zur Vorlesung Zeichnen von Graphen (Graph Drawing) WS 02/03 Seminar Netzwerkanalyse und das Internet SS 02 Übungen zur Vorlesung Methoden der Netzwerkanalyse WS 01/02 Übungen zur Vorlesung Entwurf und Analyse von Algorithmen SS 01 Übungen zur Vorlesung Theoretische Grundlagen der Informatik WS 2000/01 Übungen zur Vorlesung Entwurf und Analyse von Algorithmen SS 2000 Übungen zur Vorlesung Algorithmen zur Visualisierung von Graphen WS 99/2000 Übungen zur Vorlesung Mathematische Grundlagen der Informatik 1993 - 1998 Übungen zu den Vorlesungen Lineare Algebra, Algebra und Algebra und Zahlentheorie

Publications

To Appear   Sabine Cornelsen, Andreas Karrenbauer, and Shujun Li. Leveling the Grid. To appear in the Proceedings of the SIAM Meeting on Algorithm Engineerig and Experiments (ALENEX 2012). Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, and Arnaud Sallaberry. Path-Based Supports for Hypergraphs. To appear in Journal of Discrete Algorithms (JDA). Sabine Cornelsen and Andreas Karrenbauer. Accelerated Bend Minimization. To appear in the Proceedings of the 19th International Symposium on Graph Drawing (GD 2011). Journal Papers Melanie Badent, Ulrik Brandes, and Sabine Cornelsen More Canonical Ordering. Journal of Graph Algorithms and Applications 15(1):97-126, 2011. Ulrik Brandes and Sabine Cornelsen: Phylogenetic Graph Models Beyond Trees. Discrete Applied Mathematics 157(10): 2361-2369, 2009. Sabine Cornelsen and Gabriele Di Stefano: Treelike Comparability Graphs. Discrete Applied Mathematics 157(8): 1711-1722, 2009. Sabine Cornelsen and Gabriele Di Stefano: Track Assignment. Journal of Discrete Algorithms 5(2): 250-261, 2007. Sabine Cornelsen and Dorothea Wagner: Completely Connected Clustered Graphs . Journal of Discrete Algorithms 4(2): 313-323, 2006. Ulrik Brandes, Sabine Cornelsen and Dorothea Wagner: Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles. Journal of Graph Algorithms and Applications 9(1):99-115, 2005. Sabine Cornelsen, Thomas Schank, and Dorothea Wagner: Drawing Graphs on Two and Three Lines. Journal of Graph Algorithms and Applications 8(2):161-177, 2004 Ulrik Brandes, Sabine Cornelsen, Christian Fieß, and Dorothea Wagner: How to Draw the Minimum Cuts of a Planar Graph. Computational Geometry: Theory & Applications 29(2):117-133, 2004. Ulrik Brandes and Sabine Cornelsen: Visual Ranking of Link Structures. Journal of Graph Algorithms and Applications 7(2):181-201, 2003. Conference Papers Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, and Arnaud Sallaberry. Path-Based Supports for Hypergraphs. Proceedings of the 21st International Workshop on Combinatorial Algorithms (IWOCA 2010), , LNCS 6460, pp. 20 - 33. © Springer-Verlag, 2011. Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, and Arnaud Sallaberry. Blocks of Hypergraphs -- Applied to Hypergraphs and Outerplanarity. Proceedings of the 21st International Workshop on Combinatorial Algorithms (IWOCA 2010), LNCS 6460, pp. 201 - 211. © Springer-Verlag, 2011. Melanie Badent, Michael Baur, Ulrik Brandes, and Sabine Cornelsen Leftist Canonical Ordering. Proceedings of the 17th International Symposium on Graph Drawing (GD 2009), LNCS 5849, pp. 159 - 170. © Springer-Verlag, 2010. . Sabine Cornelsen and Gabriele Di Stefano: Platform Assignment. Proc. 4th International Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2004), included in Algorithmic Methods for Railway Optimization LNCS 4359, pp. 233 - 245, © Springer-Verlag, 2007. Sabine Cornelsen and Gabriele Di Stefano: Treelike Combarability Graphs: Characterization, Recognition, and Application. Proc. 30th Intl. Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004). LNCS 3353, pp. 46 - 57. © Springer-Verlag, 2004. Ulrik Brandes, Sabine Cornelsen and Dorothea Wagner: Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles. Proc. 11th Intl. Symp. Graph Drawing (GD 2003), LNCS 2912, pp. 357 - 368. © Springer-Verlag, 2004. Sabine Cornelsen and Dorothea Wagner: Completely Connected Clustered Graphs . Proc. 29th Intl. Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), LNCS 2880, pp. 168 - 179. © Springer-Verlag, 2003. Sabine Cornelsen, Thomas Schank, and Dorothea Wagner: Drawing Graphs on Two and Three Lines . Proc. 10th Intl. Symp. Graph Drawing (GD 2002), LNCS 2528, pp. 31 - 41. © Springer-Verlag, 2002. Sabine Cornelsen, Yefim Dinitz, and Dorothea Wagner: Planarity of the 2-level Cactus Model. Proc. 27th Intl. Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001). LNCS 2204, pp. 91 - 102. © Springer-Verlag, 2001. Ulrik Brandes and Sabine Cornelsen: Visual Ranking of Link Structures. Proc. 7th Intl. Workshop on Algorithms and Data Structures (WADS 2001). LNCS 2125, pp. 222 - 233. © Springer-Verlag, 2001. Ulrik Brandes, Sabine Cornelsen, and Dorothea Wagner: How to Draw the Minimum Cuts of a Planar Graph. Proc. 8th Intl. Symp. Graph Drawing (GD 2000), LNCS 1984, pp. 103 - 114. © Springer-Verlag, 2001. Book Chapters Ralf Brockenauer and Sabine Cornelsen: Drawing Clusters and Hierarchies. In Michael Kaufmann and Dorothea Wagner (Eds.): Drawing Graphs: Methods and Models. LNCS Tutorial 2025, pp. 193-227. © Springer-Verlag, 2001.

Some Talks

Polnet 2004, Introductory lecture on Graphs and Matrices: slides (pdf) and bibliography (pdf)