New results on Pseudo-triangulations with low vertex degree. - André Schulz 001 (CCCG, 2005)

A pointed Delaunay pseudo-triangulation of a simple polygon. - Günter Rote; André Schulz 001 (EuroCG, 2005)

Threshold arrangements and the knapsack problem. - Günter Rote; André Schulz 001 (Appl. Math. Lett., 2006)

On Rolling Cube Puzzles. - Kevin Buchin; Maike Buchin; Erik D. Demaine; Martin L. Demaine; Dania El-Khechen; Sándor P. Fekete; Christian Knauer; André Schulz 001; Perouz Taslakian (CCCG, 2007)

On the Number of Cycles in Planar Graphs. - Kevin Buchin; Christian Knauer; Klaus Kriegel; André Schulz 001; Raimund Seidel (COCOON, 2007)

Inflating the cube by shrinking. - Kevin Buchin; André Schulz 001 (SCG, 2007)

Embedding 3-polytopes on a small grid. - Ares Ribó Mor; Günter Rote; André Schulz 001 (SCG, 2007)

Lifting planar graphs to realize integral 3-polytopes and topics in pseudo- triangulations (Heben von planaren Graphen zur ganzzahligen Einbettung von 3-Polytopen und Themen über Pseudo-Triangulierungen) - André Schulz 001 (2008)

Resolving Loads with Positive Interior Stresses. - Günter Rote; André Schulz 001 (WADS, 2009)

Flip Graphs of Bounded-Degree Triangulations. - Oswin Aichholzer; Thomas Hackl; David Orden; Pedro Ramos 001; Günter Rote; André Schulz 001; Bettina Speckmann (Electron. Notes Discret. Math., 2009)

Fréchet Distance of Surfaces: Some Simple Hard Cases. - Kevin Buchin; Maike Buchin; André Schulz 001 (ESA (2), 2010)

On the Number of Spanning Trees a Planar Graph Can Have. - Kevin Buchin; André Schulz 001 (ESA (1), 2010)

Convexifying Polygons Without Losing Visibilities. - Oswin Aichholzer; Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; Ferran Hurtado; Anna Lubiw; Günter Rote; André Schulz 001; Diane L. Souvaine; Andrew Winslow (CCCG, 2011)

Small Grid Embeddings of 3-Polytopes. - Ares Ribó Mor; Günter Rote; André Schulz 001 (Discret. Comput. Geom., 2011)

Drawing 3-Polytopes with Good Vertex Resolution. - André Schulz 001 (J. Graph Algorithms Appl., 2011)

Pointed drawings of planar graphs. - Oswin Aichholzer; Günter Rote; André Schulz 001; Birgit Vogtenhuber (Comput. Geom., 2012)

Pinning balloons with perfect angles and optimal area. - Immanuel Halupczok; André Schulz 001 (J. Graph Algorithms Appl., 2012)

Algorithms for Labeling Focus Regions. - Martin Fink 001; Jan-Henrik Haunert; André Schulz 001; Joachim Spoerhase; Alexander Wolff 001 (IEEE Trans. Vis. Comput. Graph., 2012)

Counting Carambolas. - Maarten Löffler; André Schulz 001; Csaba D. Tóth (CCCG, 2013)

Algorithms for Designing Pop-Up Cards. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Anna Lubiw; André Schulz 001; Diane L. Souvaine; Giovanni Viglietta; Andrew Winslow (STACS, 2013)

Two-Sided Boundary Labeling with Adjacent Sides. - Philipp Kindermann; Benjamin Niedermann; Ignaz Rutter; Marcus Schaefer 001; André Schulz 001; Alexander Wolff 001 (WADS, 2013)

Memory-constrained algorithms for simple polygons. - Tetsuo Asano; Kevin Buchin; Maike Buchin; Matias Korman; Wolfgang Mulzer; Günter Rote; André Schulz 001 (Comput. Geom., 2013)

Bounded-degree polyhedronization of point sets. - Gill Barequet; Nadia M. Benbernou; David Charlton; Erik D. Demaine; Martin L. Demaine; Mashhood Ishaque; Anna Lubiw; André Schulz 001; Diane L. Souvaine; Godfried T. Toussaint; Andrew Winslow (Comput. Geom., 2013)

On numbers of pseudo-triangulations. - Moria Ben-Ner; André Schulz 001; Adam Sheffer (Comput. Geom., 2013)

The union of colorful simplices spanned by a colored point set. - André Schulz 001; Csaba D. Tóth (Comput. Geom., 2013)

Bounds on the Maximum Multiplicity of Some Common Geometric Graphs. - Adrian Dumitrescu; André Schulz 001; Adam Sheffer; Csaba D. Tóth (SIAM J. Discret. Math., 2013)

On Monotone Drawings of Trees. - Philipp Kindermann; André Schulz 001; Joachim Spoerhase; Alexander Wolff 001 (GD, 2014)

Reprint of: Memory-constrained algorithms for simple polygons. - Tetsuo Asano; Kevin Buchin; Maike Buchin; Matias Korman; Wolfgang Mulzer; Günter Rote; André Schulz 001 (Comput. Geom., 2014)

Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees. - Clinton Bowen; Stephane Durocher; Maarten Löffler; Anika Rounds; André Schulz 001; Csaba D. Tóth (GD, 2015)

Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments. - Alexander Igamberdiev; Wouter Meulemans; André Schulz 001 (GD, 2015)

On Minimizing Crossings in Storyline Visualizations. - Irina Kostitsyna; Martin Nöllenburg; Valentin Polishchuk; André Schulz 001; Darren Strash (GD, 2015)

A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams. - Wouter Meulemans; André Schulz 001 (GD, 2015)

Contact Graphs of Circular Arcs. - Md. Jawaherul Alam; David Eppstein; Michael Kaufmann 001; Stephen G. Kobourov; Sergey Pupyrev; André Schulz 001; Torsten Ueckerdt (WADS, 2015)

Contact Representations of Sparse Planar Graphs. - Md. Jawaherul Alam; David Eppstein; Michael Kaufmann 001; Stephen G. Kobourov; Sergey Pupyrev; André Schulz 001; Torsten Ueckerdt (CoRR, 2015)

Drawing Graphs with Few Arcs. - André Schulz 001 (J. Graph Algorithms Appl., 2015)

Multi-sided Boundary Labeling. - Philipp Kindermann; Benjamin Niedermann; Ignaz Rutter; Marcus Schaefer 001; André Schulz 001; Alexander Wolff 001 (Algorithmica, 2016)

A duality transform for constructing small grid embeddings of 3d polytopes. - Alexander Igamberdiev; André Schulz 001 (Comput. Geom., 2016)

Counting Carambolas. - Adrian Dumitrescu; Maarten Löffler; André Schulz 001; Csaba D. Tóth (Graphs Comb., 2016)

On Gallai's conjecture for series-parallel graphs and planar 3-trees. - Philipp Kindermann; Lena Schlipf; André Schulz 001 (CoRR, 2017)

Embedding Stacked Polytopes on a Polynomial-Size Grid. - Erik D. Demaine; André Schulz 001 (Discret. Comput. Geom., 2017)

Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments. - Alexander Igamberdiev; Wouter Meulemans; André Schulz 001 (J. Graph Algorithms Appl., 2017)

The Partition Spanning Forest Problem. - Philipp Kindermann; Boris Klemz; Ignaz Rutter; Patrick Schnider; André Schulz 001 (CoRR, 2018)

Saturated simple and 2-simple topological graphs with few edges. - Péter Hajnal; Alexander Igamberdiev; Günter Rote; André Schulz 001 (J. Graph Algorithms Appl., 2018)

Drawing Planar Graphs with Few Geometric Primitives. - Gregor Hültenschmidt; Philipp Kindermann; Wouter Meulemans; André Schulz 001 (J. Graph Algorithms Appl., 2018)

Experimental Analysis of the Accessibility of Drawings with Few Segments. - Philipp Kindermann; Wouter Meulemans; André Schulz 001 (J. Graph Algorithms Appl., 2018)

Recognizing Planar Laman Graphs. - Jonathan Rollin; Lena Schlipf; André Schulz 001 (ESA, 2019)

Lombardi drawings of knots and links. - Philipp Kindermann; Stephen G. Kobourov; Maarten Löffler; Martin Nöllenburg; André Schulz 001; Birgit Vogtenhuber (J. Comput. Geom., 2019)

Augmenting Geometric Graphs with Matchings. - Alexander Pilz; Jonathan Rollin; Lena Schlipf; André Schulz 001 (GD, 2020)

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. - Philipp Kindermann; Fabrizio Montecchiani; Lena Schlipf; André Schulz 001 (J. Graph Algorithms Appl., 2021)

Computing Schematic Layouts for Spatial Hypergraphs on Concentric Circles and Grids. - Michael A. Bekos; D. J. C. Dekker; F. Frank; Wouter Meulemans; Peter J. Rodgers; André Schulz 001; Sten Wessel (Comput. Graph. Forum, 2022)

On the Geometric Thickness of 2-Degenerate Graphs. - Rahul Jain 015; Marco Ricci 002; Jonathan Rollin; André Schulz 001 (SoCG, 2023)

Side-Contact Representations with Convex Polygons in 3D: New Results for Complete Bipartite Graphs. - André Schulz 001 (GD (1), 2023)

Arrangements of orthogonal circles with many intersections. - Sarah Carmesin; André Schulz 001 (J. Graph Algorithms Appl., 2023)

Color-Encoded Links Improve Homophily Perception in Node-Link Diagrams. - Daniel Reimann; André Schulz 001; Nilam Ram; Robert Gaschler (IEEE Trans. Vis. Comput. Graph., 2023)

Adjacency Graphs of Polyhedral Surfaces. - Elena Arseneva; Linda Kleist; Boris Klemz; Maarten Löffler; André Schulz 001; Birgit Vogtenhuber; Alexander Wolff 001 (Discret. Comput. Geom., 2024)

Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple Settings. - Mikkel Abrahamsen; Kevin Buchin; Maike Buchin; Linda Kleist; Maarten Löffler; Lena Schlipf; André Schulz 001; Jack Stade (SoCG, 2025)

On plane cycles in geometric multipartite graphs. - Marco Ricci 002; Jonathan Rollin; André Schulz 001; Alexandra Weinberger (CoRR, 2025)