Prof. Dr. André Schulz

Foto: Hardy Welsch

E-Mail: andre.schulz

Telefon: +49 2331 987 - 2639

Fax: +49 2331 987 - 339

Raum: Informatikzentrum, 3 H 09

Publikationen

Artikel in Zeitschriften

• Gregor Hültenschmidt; Philipp Kindermann; Wouter Meulemans; André Schulz: Drawing Planar Graphs with Few Geometric Primitives, in J. Graph Algorithms Appl., Vol. 22, No. 2, 2018, pp. 357--387
• Philipp Kindermann; Wouter Meulemans; André Schulz: Experimental Analysis of the Accessibility of Drawings with Few Segments, in J. Graph Algorithms Appl., Vol. 22, No. 3, 2018, pp. 501-518
• Péter Hajnal; Alexander Igamberdiev; Günter Rote; André Schulz: Saturated simple and 2-simple topological graphs with few edges, in J. Graph Algorithms Appl., Vol. 22, No. 1, 2018, pp. 117--138
• Alexander Igamberdiev; Wouter Meulemans; André Schulz: Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments, in Journal of Graph Algorithms and Applications, Vol. 21, Nr. 4, 2017, pp. 561-588
• Erik D. Demaine; André Schulz: Embedding Stacked Polytopes on a Polynomial-Size Grid, in Discrete & Computational Geometry, Vol. 57, Nr. 4, 2017, pp. 782-809
• Alexander Igamberdiev; André Schulz: A duality transform for constructing small grid embeddings of 3d polytopes, in Computational Geometry, Vol. 56, 2016, pp. 19-36
• Adrian Dumitrecu; Maarten Löffler; André Schulz; Csaba D. Tóth: Counting Carambolas, in Graphs and Combinatorics, Volume 32, Issue 3, 2016, pp. 923–942
• Philipp Kindermann; Benjamin Niedermann; Ignaz Rutter; Marcus Schaefer; André Schulz; Alexander Wolff: Multi-Sided Boundary Labeling, in Algorithmica, Vol. 76, no. 1, 2016, pp. 225-258
• André Schulz: Drawing Graphs with Few Arcs, in Journal of Graph Algorithms and Applications, Vol. 19, no. 1, 2015, pp. 393-412

Konferenzbandbeiträge

• Alexander Pilz; Jonathan Rollin; Lena Schlipf; André Schulz: Augmenting Polygons with Matchings, in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG'20)
• Jonathan Rollin; Lena Schlipf; André Schulz: Recognizing Planar Laman Graphs, in Proceedings of the 27th Annual European Symposium on Algorithms (ESA'19), Seiten 79:1--79:12
• Philipp Kindermann; Fabrizio Montecchiani; Lena Schlipf; André Schulz: Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles, in Graph Drawing, Lecture Notes in Computer Science, Springer, Vol. 11282, 2018, pp. 152-166
• Gregor Hültenschmidt; Philipp Kindermann; Wouter Meulemans; André Schulz: Drawing Trees and Triangulations with Few Geometric Primitives, in Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'17), pp. 316-329
• Philipp Kindermann; Wouter Meulemans; André Schulz: Experimental analysis of the accessibility of drawings with few segments, in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17), pp. 52-64
• Philipp Kindermann; Stephen Kobourov; Maarten Löffler; Martin Nöllenburg; André Schulz; Birgit Vogtenhuber: Lombardi Drawings of Knots and Links, in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17), pp. 113-126
• Kevin Buchin; Maike Buchin; Wolfgang Mulzer; Maximilian Konzack; André Schulz: Fine-Grained Analysis of Problems on Curves, in Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG'16), Abstract
• Wouter Meulemans; André Schulz: A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams, in Graph Drawing and Network Visualization - 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers, pp. 489-501
• Md. Jawaherul Alam; David Eppstein; Michael Kaufmann; Stephen G. Kobourov; Sergey Pupyrev; André Schulz; Torsten Ueckerdt: Contact Graphs of Circular Arcs, in Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, pp. 1-13
• Alexander Igamberdiev; Wouter Meulemans; André Schulz: Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments, in Graph Drawing and Network Visualization - 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers, pp. 113-124
• Irina Kostitsyna; Martin Nöllenburg; Valentin Polishchuk; André Schulz; Darren Strash: On Minimizing Crossings in Storyline Visualizations, in Graph Drawing and Network Visualization - 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers, pp. 192-198
• Clinton Bowen; Stephane Durocher; Maarten Löffler; Anika Rounds; André Schulz; Csaba D. Tóth: Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees, in Graph Drawing and Network Visualization - 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers, pp. 447-459

Workshopbeiträge

• Jonathan Rollin; Lena Schlipf; André Schulz: Recognizing Planar Laman Graphs, in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG’19)
• Philipp Kindermann; Boris Klemz; Ignaz Rutter; Patrick Schnider; André Schulz: The Partition Spanning Forest Problem, in Proc. 34th European Workshop on Computational Geometry (EuroCG'18). To appear.
• Gregor Hültenschmidt; Philipp Kindermann; Wouter Meulemans; André Schulz: Drawing Trees and Triangulations with Few Geometric Primitives, in Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG'16), pp. 55-58, Abstract

Konferenzbände

• Péter Hajnal; Alexander Igamberdiev; Günter Rote; André Schulz: Saturated simple and 2-simple topological graphs with few edges, in International Workshop on Graph-Theoretic Concepts in Computer Science, Springer, Vol. 9224, 2015, pp. 391-405

Sonstiges

• Philipp Kindermann; Lena Schlipf; André Schulz: On Gallai's conjecture for series-parallel graphs and planar 3-trees, in CoRR, Vol. abs/1706.04130, 2017