Erweiterte Suche

Prof. Dr. André Schulz
Institut für Mathematische Logik und Grundlagenforschung


Seit August 2015 bin ich an der FernUniversität in Hagen.

Lehre

  • SS 2015 Algorithmische Graphentheorie | Webseite
  • WS 2014 Berechenbarkeitstheorie | Webseite
  • SS 2014 Datenstrukturen für Fortgeschrittene | Webseite
  • WS 2013 Berechenbarkeitstheorie | Webseite
  • SS 2013 Effiziente Algorithmen | Webseite
  • WS 2012 Berechenbarkeitstheorie | Webseite
  • SS 2012 Geometrische Algorithmen zum Falten und Entfalten | Webseite
  • SS 2012 Seminar zur Analyse von Sozialen Netzwerken und Informationsnetzwerken | Webseite
  • WS 2011 Berechenbarkeitstheorie | Webseite
  • SS 2011 Effiziente Algorithmen | Webseite
  • WS 2010 Datenstrukturen für Fortgeschrittene | Webseite
  • SS 2010 Seminar Algorithmische Graphentheorie (Suchen von Mustern in Graphen und Texten)
  • SS 2010 6.851 Advanced Data Structures at MIT | Webseite

Laufende Projekte


Abschlussarbeiten

Es sind Themen fr Abschlussarbeiten vorhanden (Bachelor, Master, Diplom). Ausgewählte Themen sind:

  • Durchführung von Benutzerstudien zum Verifizieren von Hypothesen auf dem Gebiet des Graphen-Zeichnens inklusive Erstellung eines Online-Fragebogens, welcher Reaktionszeiten der Benutzer misst
  • Implementierung von Algorithmen (in der Entwicklungsphase) zur optimalen Platzierung von Labels auf Landkarten
  • Kombinatorische Probleme für planare Graphen

Publikationen

In umgekehrter chronologischer Reihenfolge.


On Monotone Drawings of Trees
P. Kindermann, A. Schulz, J. Spoerhase and A. Wolff
in: Graph Drawing - 22th International Symposium, GD 2014, Würzburg, Germany, September 2014, pages 488-500
doi

The union of colorful simplices spanned by a colored point set
A. Schulz and C. D. Tóth
Comput. Geom. 46(5) :574-590 (2013)
doi

Drawing Graphs with Few Arcs
A. Schulz
in: Proc. 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lübeck 2013, Lecture Notes in Computer Science to appear
pdf

Counting Carambolas
M. Löffler, A. Schulz and C. D. Tóth
in: Proceedings of the 25rd Annual Canadian Conference on Computational Geometry (CCCG), Waterloo, ON, Canada, 2013
pdf

Two-Sided Boundary Labeling with Adjacent Sides
P. Kindermann, B. Niedermann, I. Rutter, M. Schaefer, A. Schulz and A. Wolff
in: Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings, pages 463-474, Lecture Notes in Computer Science 8037, Springer
doi

A Duality Transform for Constructing Small Grid Embeddings of 3d Polytopes
A. Igamberdiev and A. Schulz
in: Graph Drawing - 21th International Symposium, GD 2013, Bordeaux, France, September 2013, Lecture Notes in Computer Science to appear, Springer


On numbers of pseudo-triangulations
M. Ben-Ner, A. Schulz and A. Sheffer
Comput. Geom. 46(6) :688-699 (2013)
doi

Bounded-degree polyhedronization of point sets
G. Barequet, N. Benbernou, D. Charlton, E. D. Demaine, M. L. Demaine, M. Ishaque, A. Lubiw, A. Schulz, D. L. Souvaine, G. T. Toussaint and A. Winslow
Comput. Geom. 46(2) :148-153 (2013)
doi

Counting plane graphs: flippability and its applications
M. Hoffmann, A. Schulz, M. Sharir, A. Sheffer, C. D. Tóth and E. Welzl
in: Thirty Essays on Geometric Graph Theory(Editor:M. Hoffmann, A. Schulz, M. Sharir, A. Sheffer, C. D. Tóth and E. Welzl, Springer


Algorithms for Designing Pop-Up Cards
Z. Abel, E. D. Demaine, M. L. Demaine, S. Eisenstat, A. Lubiw, A. Schulz, D. L. Souvaine, G. Viglietta and A. Winslow
in: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), pages 269-280, Leibniz International Proceedings in Informatics (LIPIcs) 20, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
doi

Pinning balloons with perfect angles and optimal area
I. Halupczok and A. Schulz
J. Graph Algorithms Appl. 16(4) :847-870 (2012)
doi

Algorithms for Labeling Focus Regions
M. Fink, J. Haunert, A. Schulz, J. Spoerhase and A. Wolff
IEEE Trans. Vis. Comput. Graph. 18(12) :2583-2592 (2012)
doi

Pointed drawings of planar graphs
O. Aichholzer, G. Rote, A. Schulz and B. Vogtenhuber
Computational Geometry 45(9) :482-494 (2012)
doi

Flip Graphs of Bounded Degree Triangulations
O. Aichholzer, T. Hackl, D. Orden, P. Ramos, G. Rote, A. Schulz and B. Speckmann
Graphs and Combinatorics to appear:1-17 (2012)
open access
doi | full

Drawing 3-polytopes with good vertex resolution
A. Schulz
Journal of Graph Algorithms and Applications 15(1) :33-52 (2011)
doi | pdf

Small Grid Embeddings of 3-Polytopes
A. Ribó Mor, G. Rote and A. Schulz
Discrete & Computational Geometry 45(1) :65-87 (2011)
doi | pdf

Pinning Balloons with Perfect Angles and Optimal Area
I. Halupczok and A. Schulz
in: Graph Drawing - 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011, pages 154-165, Lecture Notes in Computer Science 7034, Springer
doi | full

Bounds on the maximum multiplicity of some common geometric graphs
A. Dumitrescu, A. Schulz, A. Sheffer and C. D. Tóth
in: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), Dortmund, Germany, 2011, pages 637-648, Leibniz International Proceedings in Informatics (LIPIcs) 9, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
doi | full

Embedding stacked polytopes on a polynomial-size grid
E. D. Demaine and A. Schulz
in: Proc. 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francsico, 2011, pages 1177-1187, ACM Press
doi

Convexifying Polygons Without Losing Visibilities
O. Aichholzer, G. Aloupis, E. D. Demaine, M. L. Demaine, V. Dujmovic, F. Hurtado, A. Lubiw, G. Rote, A. Schulz, D. L. Souvaine and A. Winslow
in: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011
pdf

The Union of Colorful Simplices Spanned by a Colored Point Set
A. Schulz and C. D. Tóth
in: Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I, pages 324-338, Lecture Notes in Computer Science 6508, Springer
doi

On the Number of Spanning Trees a Planar Graph Can Have
K. Buchin and A. Schulz
in: Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I, pages 110-121, Lecture Notes in Computer Science 6346, Springer
doi | full

Fréchet Distance of Surfaces: Some Simple Hard Cases
K. Buchin, M. Buchin and A. Schulz
in: Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II, pages 63-74, Lecture Notes in Computer Science 6347, Springer
doi

Bounded-degree polyhedronization of point sets
G. Barequet, N. Benbernou, D. Charlton, E. D. Demaine, M. L. Demaine, M. Ishaque, A. Lubiw, A. Schulz, D. L. Souvaine, G. T. Toussaint and A. Winslow
in: Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010, pages 99-102
doi

Drawing 3-Polytopes with Good Vertex Resolution
A. Schulz
in: Graph Drawing, pages 33-44
doi

Resolving Loads with Positive Interior Stresses
G. Rote and A. Schulz
in: Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, pages 530-541, Lecture Notes in Computer Science 5664, Springer
doi | full

Flip Graphs of Bounded-Degree Triangulations
O. Aichholzer, T. Hackl, D. Orden, P. Ramos, G. Rote, A. Schulz and B. Speckmann
Electronic Notes in Discrete Mathematics 34:509-513 (2009)
doi | full

Lifting planar graphs to realize integral 3-polytopes and topics in pseudo-triangulations.
André Schulz
PhD thesis, Free University Berlin, 2008.
Advisor Prof. Dr. Günter Rote
pdf

Embedding 3-polytopes on a small grid
A. Ribó Mor, G. Rote and A. Schulz
in: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pages 112-118, ACM Press
doi | pdf

Inflating the cube by shrinking
K. Buchin and A. Schulz
in: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pages 125-126, ACM Press
doi | pdf | video

On the Number of Cycles in Planar Graphs
K. Buchin, C. Knauer, K. Kriegel, A. Schulz and R. Seidel
in: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pages 97-107, Lecture Notes in Computer Science 4598, Springer
doi | pdf

On Rolling Cube Puzzles
K. Buchin, M. Buchin, E. D. Demaine, M. L. Demaine, D. El-Khechen, S. P. Fekete, C. Knauer, A. Schulz and P. Taslakian
in: Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada, pages 141-144, Carleton University, Ottawa, Canada
full | pdf

Pointed Drawings of Planar Graphs
O. Aichholzer, G. Rote, A. Schulz and B. Vogtenhuber
in: Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada, pages 237-240, Carleton University, Ottawa, Canada
full | pdf

The existence of a pseudo-triangulation in a given geometric graph
A. Schulz
in: Proc. 22nd European Workshop on Computational Geometry, Delphi, Greece
pdf

Threshold arrangements and the knapsack problem
G. Rote and A. Schulz
Appl. Math. Lett. 19(1) :108-112 (2006)
doi | pdf

New results on pseudo-triangulations with low vertex degree
A. Schulz
in: Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG), Windsor, Canada, pages 130-133
pdf

A pointed Delaunay pseudo-triangulation of a simple polygon.
G. Rote and A. Schulz
in: Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, pages 77-80
pdf

Impressum | © 2007 FB10 WWU Münster
Universität Münster
Schlossplatz 2 - 48149 Münster
Tel.: +49 (251) 83-0 - Fax: +49 (251) 83-3 20 90
E-Mail: