On the number of spanning trees a planar graph can have.
Kevin Buchin and André Schulz
Manuscript at arxiv [Math.Co]

Drawing 3-polytopes with good vertex resolution.
André Schulz
in Proceedings of the 17th International Symposium on Graph Drawing September 2009, Chicago, Lecture Notes in Computer Science, Springer 2009,
pdf | ( LNCS version to appear)

Resolving loads with positive interior stresses.
Günter Rote and André Schulz
in Algorithms and Data Structures Symposium-WADS 2009, Banff, August 2009, Editors: Frank Dehne, Ian Munro, Jörg-Rüdiger Sack und Roberto Tamassia, Lecture Notes in Computer Science, Volume 5664, Springer-Verlag, 2009.
pdf | doi

Flip graphs of bounded-degree triangulations.
Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz und Bettina Speckmann
in Electronic Notes in Discrete Mathematics, European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2009, (2009).
Full version at arxiv [Math.Co].

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

Pointed drawings of planar graphs.
Oswin Aichholzer, Günter Rote, André Schulz und Birgit Vogtenhuber
in Proceedings of the 19th Canadian Conference on Computational Geometry, Ottawa, August 20-22, 2007, pp. 237-240.
pdf (Full version submitted)

On rolling cube puzzles.
Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor Fekete, Christian Knauer, André Schulz, Perouz Taslakian
In Proceedings of the 19th Canadian Conference on Computational Geometry, Pages 141–144, 2007.
pdf | Full version pdf

On the number of cycles in planar graphs.
Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
In Proc. 13th International Computing and Combinatorics Conference (COCOON), Pages 97–107, 2007.
pdf | doi

Embedding 3-polytopes on a small grid.
Ares Ribó Mor, Günter Rote und André Schulz
In: Proceedings of the 23rd Annual Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007. Association for Computing Machinery, 2007, pp. 112-118.
pdf | doi

Inflating the cube by shrinking (Multimedia Abstract).
Kevin Buchin, André Schulz
In: Proceedings of the 23rd Annual Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007. Association for Computing Machinery, 2007,
pdf | doi | video

Inflating the cube by shrinking.
Kevin Buchin, Igor Pak, André Schulz
In Proc. 23rd European Workshop on Computational Geometry, Pages 46–49, Graz, Austria, March 2007.
pdf

Threshold arrangements and the knapsack problem.
Günter Rote und André Schulz
Applied Mathematics Letters 19 (2006), 108-112.
pdf | doi

The existence of a pseudo-triangulation in a given geometric graph.
André Schulz
In Proc. 22nd European Workshop on Computational Geometry, Delphi, Greece, Pages 17–20, March 2006.
pdf

New results on pseudo-triangulations with low vertex degree.
André Schulz
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), Pages 130-133, Windsor, 2005.
pdf

A pointed Delaunay pseudo-triangulation of a simple polygon.
Günter Rote, André Schulz
In Proceedings of the 21st European Workshop on Computational Geometry, Pages 77-80, Eindhoven, 2005.
pdf

List of my co-authors: Oswin Aichholzer, Kevin Buchin, Maike Buchin, Erik Demaine, Martin Demaine, Thomas Hackl, Dania El-Khechen, Sandor Fekete, Christian Knauer, Klaus Kriegel, David Orden, Igor Pak, Pedro Ramos, Ares Ribó, Günter Rote, Raimund Seidel, Bettina Speckmann, Perouz Taslakian, Birgit Vogtenhuber.