Professor Dr. André Schulz

Kontakt

Professur für Mathematische Logik und Theoretische Informatik (Prof. Schulz)
Einsteinstraße 62
48149 Münster

Publikationen

  • P. Kindermann, J. Spörhase, A. Schulz, A. Wollf. 2014. ‘On Monotone Drawings of Trees.’Contributed to the 22th International Symposium, GD 2014, Würzburg. doi: 10.1007/978-3-662-45803-7_41.
  • Hoffmann Michael, Schulz Andre, Sharir Micha, Sheffer Adam , Tóth D. Csaba, Welzl Emo. 2014. ‘Counting plane graphs: flippability and its applications.’ In Thirty Essays on Geometric Graph Theory, edited by Pach Janos, tbd.
  • T. Asano, K. Buchin, M. Buchin, M. Korman, W. Mulzer, G. Rote und A. Schulz. 2013. ‘Memory-Constrained Algorithms for Simple Polygons.’ Computational Geometry 46, Nr. 8: 959-969. doi: 10.1016/j.comgeo.2013.04.005.
  • Barequet Gill , Benbernou Nadia , Charlton David , Demaine D Erik , Demaine L Martin , Ishaque Mashhood , Lubiw Anna , Schulz Andre, Souvaine L Diane , Toussaint T Godfried , Winslow Andrew. 2013. ‘Bounded-degree polyhedronization of point sets.’ Computational Geometry 46, Nr. 2: 148-153. doi: 10.1016/j.comgeo.2012.02.008.
  • Aichholzer Oswin , Hackl Thomas , Orden David , Ramos Pedro , Rote Günter , Schulz Andre , Speckmann Bettina. 2013. ‘Flip Graphs of Bounded Degree Triangulations.’ Graphs and Combinatorics 29, Nr. 6: 1577-1593. doi: 10.1007/s00373-012-1229-0.
  • A. Dumitrescu, A. Schulz, A. Sheffer and C.D. Tóth. 2013. ‘Bounds on the maximum multiplicity of some common geometric graphs.’ SIAM Journal of Discrete Mathematics 27, Nr. 2: 802-826. doi: 10.1137/110849407.
  • M. Hoffmann, A. Schulz, M. Sharir, A. Sheffer, C. D. Tóth and E. Welzl. 2013. ‘Counting plane graphs: flippability and its applications.’ In hirty Essays on Geometric Graph Theory, edited by Janos Pach, 303-326.: Springer.
  • Z. Abel, E. D. Demaine, M. L. Demaine, S. Eisenstat, A. Lubiw, A. Schulz, D. L. Souvaine, G. Viglietta, and A. Winslow. 2013. ‘Algorithms for Designing Pop-Up Cards.’Contributed to the 30th Symposium on Theoretical Aspects of Computer Science (STACS), Kiel.
  • P. Kindermann, B. Niedermann, I. Rutter , M. Schaefer, André Schulz and A. Wolff. 2013. ‘Two-Sided Boundary Labeling with Adjacent Sides.’Contributed to the 13th Algorithms And Data Structures Symposium (WADS), London, Ontario.
  • A Schulz. 2013. ‘Drawing Graphs with Few Arcs.’Contributed to the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lübeck, Germany.
  • A. Igamberdiev and A. Schulz. 2013. ‘A Duality Transform for Constructing Small Grid Embeddings of 3d Polytopes.’Contributed to the Graph Drawing - 21th International Symposium (GD), Bordeaux, France.
  • Schulz Andre, Tóth D. Csaba. 2013. ‘The union of colorful simplices spanned by a colored point set.’ Computational Geometry 46, Nr. 5: 574-590. doi: 10.1016/j.comgeo.2012.01.006.
  • M. Löffler, A. Schulz and C. D. Tóth. 2013. ‘Counting Carambolas.’Contributed to the 25rd Annual Canadian Conference on Computational Geometry (CCCG), Waterloo.
  • Ben-Ner Moria , Schulz Andre, Sheffer Adam. 2012. ‘On Numbers of Pseudo-Triangulations.’ Computational Geometry 46, Nr. 6: 688-699. doi: 10.1016/j.comgeo.2012.11.002. [Akzeptiert]
  • Aichholzer Oswin, Rote Günter, Schulz, Andre, Vogtenhuber Birgit. 2012. ‘Pointed drawings of planar graphs.’ Computational Geometry 45, Nr. 9: 482-494. doi: 10.1016/j.comgeo.2010.08.001.
  • T. Asano, K. Buchin, M. Buchin, M. Korman, W. Mulzer, G. Rote und A. Schulz. 2012. ‘Memory-Constrained Algorithms for Simple Polygons.’Contributed to the European Workshop on Computational Geometry EWCG, Perugia, Italien.
  • Halupczok Immanuel, Schulz Andre. 2012. ‘Pinning balloons with perfect angles and optimal area.’ Journal of Graph Algoirthms and Applications 2012: 847-870. doi: 10.7155/jgaa.00280.
  • Mor Ares Ribó,Rote Günter,Schulz André. 2011. ‘Small grid embeddings of 3-polytopes.’ Discrete and Computational Geometry 15, Nr. 1: 847-870.
  • Demaine Erik D.,Schulz André. 2011. ‘Embedding stacked polytopes on a polynomial-size grid.’Contributed to the ACM-SIAM Symposium on Discrete Algorithms (SODA11).
  • A. Dumitrescu, A. Schulz, A. Sheffer and C. D. Tóth. 2011. ‘Bounds on the maximum multiplicity of some common geometric graphs.’Contributed to the 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), Dortmund.
  • Halupczok Immanuel, Schulz André. 2011. ‘Pinning balloons with perfect angles and optimal area.’Contributed to the International Symposium of Graph Drawing, Eindhoven, NL. doi: 10.1007/978-3-642-25878-7_16.
  • O. Aichholzer, G. Aloupis, E.D. Demaine, M.L. Demaine, V. Dujmovic, F. Hurtado, A. Lubiw, G. Rote, A. Schulz, D.L. Souvaine und A. Winslow. 2011. ‘Convexifying Polygons Without Losing Visibilities.’Contributed to the Canadian Conference on Computational Geometry, Toronto.
  • Barequet Gill,Benbernou Nadia,Charlton David,Demaine Erik D.,Demaine Martin L.,Ishaque Mashhood,Lubiw Anna,Schulz André,Souvaine Diane L.,Toussaint Godfried T.,Winslow Andrew. 2010. ‘Bounded-degree polyhedronization of point sets.’Contributed to the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada.
  • Buchin Kevin,Schulz André. 2010. ‘On the Number of Spanning Trees a Planar Graph Can Have.’Contributed to the ESA 2010, 18th Annual European Symposium of Algorithms, Liverpool, UK, September 6-8. doi: 10.1007/978-3-642-15775-2_10.
  • Buchin Kevin, Buchin Maike, Schulz André. 2010. ‘Fréchet Distance of Surfaces: Some Simple Hard Cases.’Contributed to the ESA 2010, 18th Annual European Symposium of Algorithms, Liverpool, UK, September 6-8. doi: 10.1007/978-3-642-15781-3_6.
  • Schulz André,Tóth Csaba D. 2010. ‘The Union of Colorful Simplices Spanned by A Colored Point Set.’Contributed to the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010), The Big Island,Hawaii, USA.
  • Rote Günter, Schulz André. 2009. ‘Resolving Loads with Positive Interior Stresses.’Contributed to the Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada. doi: 10.1007/978-3-642-03367-4_46.
  • Schulz André. 2009. ‘Drawing 3-Polytopes with Good Vertex Resolution.’Contributed to the Graph Drawing, 17th International Symposium, GD 2009, Chicago, IL, USA. doi: 10.1007/978-3-642-11805-0_6.
  • Aichholzer Oswin,Hackl Thomas,Orden David,Ramos Pedro,Rote Günter,Schulz A.,Speckmann Bettina. 2009. ‘Flip Graphs of Bounded-Degree Triangulations.’ Electronic Notes in Discrete Mathematics 34: 509-513. doi: 10.1016/j.endm.2009.07.084.
  • Schulz André. 2008. Lifting planar graphs to realize integral 3-polytopes and topics in pseudo-triangulations Dissertation, Free University Berlin.
  • Buchin Kevin,Schulz André. 2007. ‘Inflating the cube by shrinking (Multimedia abstract).’Contributed to the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea. doi: 10.1145/1247069.1247091.
  • Aichholzer Oswin,Rote Günter,Schulz André,Vogtenhuber Birgit. 2007. ‘Pointed Drawings of Planar Graphs.’Contributed to the 19th Canadian Conference on Computational Geometry (CCCG 2007), Ottawa, Ontario, Canada.
  • Buchin Kevin,Buchin Maike,Demaine Erik D.,Demaine Martin L.,El-Khechen Dania,Fekete Sándor P.,Knauer Christian,Schulz André,Taslakian Perouz,Bose, Prosenjit. 2007. ‘On Rolling Cube Puzzles.’Contributed to the 19th Canadian Conference on Computational Geometry (CCCG 2007), Ottawa, Ontario, Canada.
  • Buchin Kevin,Knauer Christian,Kriegel Klaus,Schulz André,Seidel Raimund. 2007. ‘On the Number of Cycles in Planar Graphs.’Contributed to the Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada. doi: 10.1007/978-3-540-73545-8_12.
  • Buchin Kevin, Pak Igor, Schulz André. 2007. ‘Inflating the cube by shrinking.’Contributed to the 23rd European Workshop on Computational Geometry, Graz, Austria.
  • Mor Ares Ribó,Rote Günter,Schulz André. 2007. ‘Embedding 3-polytopes on a small grid.’Contributed to the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea. doi: 10.1145/1247069.1247086.
  • Schulz André. 2006. ‘The existence of a pseudo-triangulation in a given geometric graph.’Contributed to the 22nd European Workshop on Computational Geometry, Delphi, Greece.
  • Rote Günter,Schulz André. 2006. ‘Threshold arrangements and the knapsack problem.’ Appl. Math. Lett. 19, Nr. 1: 108-112. doi: 10.1016/j.aml.2005.03.010.
  • Schulz André. 2005. ‘New results on pseudo-triangulations with low vertex degree.’Contributed to the 17th Canadian Conference on Computational Geometry (CCCG), Windsor, Canada.
  • Rote Günter, Schulz André. 2005. ‘A pointed Delaunay pseudo-triangulation of a simple polygon..’Contributed to the 21st European Workshop on Computational Geometry, Eindhoven, NL.


Impressum | Datenschutzhinweis | © 2018 Institut
Institut
Beispielstr. 1
· 48155 Münster
Tel: +49 251 83-22223 · Fax: 0251 - 83 22 22 4
E-Mail: