Triangulations Intersect Nicely. - Oswin Aichholzer; Franz Aurenhammer; Michael Taschwer; Günter Rote (SCG, 1995)

A Novel Type of Skeleton for Polygons. - Oswin Aichholzer; Franz Aurenhammer; David Alberts; Bernd Gärtner (J. Univers. Comput. Sci., 1995)

Straight Skeletons for General Polygonal Figures in the Plane. - Oswin Aichholzer; Franz Aurenhammer (COCOON, 1996)

Triangulations Intersect Nicely. - Oswin Aichholzer; Franz Aurenhammer; Siu-Wing Cheng; Naoki Katoh; Günter Rote; Michael Taschwer; Yin-Feng Xu (Discret. Comput. Geom., 1996)

Classifying Hyperplanes in Hypercubes. - Oswin Aichholzer; Franz Aurenhammer (SIAM J. Discret. Math., 1996)

Voronoi Diagrams for Direction-Sensitive Distances. - Oswin Aichholzer; Franz Aurenhammer; Danny Z. Chen; D. T. Lee; Asish Mukhopadhyay; Evanthia Papadopoulou (SCG, 1997)

Matching Shapes with a Reference Point. - Oswin Aichholzer; Helmut Alt; Günter Rote (Int. J. Comput. Geom. Appl., 1997)

Constant-Level Greedy Triangulations Approximate the MWT Well. - Oswin Aichholzer; Franz Aurenhammer; Günter Rote; Yin-Feng Xu (J. Comb. Optim., 1998)

The Path of a Triangulation. - Oswin Aichholzer (SCG, 1999)

Skew Voronoi Diagrams. - Oswin Aichholzer; Franz Aurenhammer; Danny Z. Chen; D. T. Lee; Evanthia Papadopoulou (Int. J. Comput. Geom. Appl., 1999)

New Results on MWT Subgraphs. - Oswin Aichholzer; Franz Aurenhammer; Reinhard Hainz (Inf. Process. Lett., 1999)

Edge Operations on Non-Crossing Spanning Trees. - Oswin Aichholzer; Franz Aurenhammer; Ferran Hurtado (EuroCG, 2000)

On the number of triangulations every planar point set must have. - Oswin Aichholzer; Ferran Hurtado; Marc Noy (CCCG, 2001)

The point set order type data base: A collection of applications and results. - Oswin Aichholzer; Hannes Krasser (CCCG, 2001)

Enumerating order types for small sets with applications. - Oswin Aichholzer; Franz Aurenhammer; Hannes Krasser (SCG, 2001)

Reconfiguring convex polygons. - Oswin Aichholzer; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; Mark H. Overmars; Michael A. Soss; Godfried T. Toussaint (Comput. Geom., 2001)

Generalized self-approaching curves. - Oswin Aichholzer; Franz Aurenhammer; Christian Icking; Rolf Klein; Elmar Langetepe; Günter Rote (Discret. Appl. Math., 2001)

Playing with Triangulations. - Oswin Aichholzer; David Bremner; Erik D. Demaine; Ferran Hurtado; Evangelos Kranakis; Hannes Krasser; Suneeta Ramaswami; Saurabh Sethia; Jorge Urrutia (JCDCG, 2002)

Sequences of spanning trees and a fixed tree theorem. - Oswin Aichholzer; Franz Aurenhammer; Ferran Hurtado (Comput. Geom., 2002)

Flipturning Polygons. - Oswin Aichholzer; Carmen Cortés; Erik D. Demaine; Vida Dujmovic; Jeff Erickson 001; Henk Meijer; Mark H. Overmars; Belén Palop; Suneeta Ramaswami; Godfried T. Toussaint (Discret. Comput. Geom., 2002)

On Flips in Polyhedral Surfaces. - Oswin Aichholzer; Lyuba Alboul; Ferran Hurtado (Int. J. Found. Comput. Sci., 2002)

Enumerating Order Types for Small Point Sets with Applications. - Oswin Aichholzer; Franz Aurenhammer; Hannes Krasser (Order, 2002)

Degree Bounds for Constrained Pseudo-Triangulations. - Oswin Aichholzer; Michael Hoffmann 001; Bettina Speckmann; Csaba D. Tóth (CCCG, 2003)

Spatial embedding of pseudo-triangulations. - Oswin Aichholzer; Franz Aurenhammer; Peter Braay (SCG, 2003)

Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips. - Oswin Aichholzer; Franz Aurenhammer; Hannes Krasser (WADS, 2003)

The Zigzag Path of a Pseudo-Triangulation. - Oswin Aichholzer; Günter Rote; Bettina Speckmann; Ileana Streinu (WADS, 2003)

Long proteins with unique optimal foldings in the H-P model. - Oswin Aichholzer; David Bremner; Erik D. Demaine; Henk Meijer; Vera Sacristán; Michael A. Soss (Comput. Geom., 2003)

Pseudotriangulations from Surfaces and a Novel Type of Edge Flip. - Oswin Aichholzer; Franz Aurenhammer; Hannes Krasser; Peter Braß (SIAM J. Comput., 2003)

Towards compatible triangulations. - Oswin Aichholzer; Franz Aurenhammer; Ferran Hurtado; Hannes Krasser (Theor. Comput. Sci., 2003)

Convexity minimizes pseudo-triangulations. - Oswin Aichholzer; Franz Aurenhammer; Hannes Krasser; Bettina Speckmann (Comput. Geom., 2004)

A lower bound on the number of triangulations of planar point sets. - Oswin Aichholzer; Ferran Hurtado; Marc Noy (Comput. Geom., 2004)

Quickest Paths, Straight Skeletons, and the City Voronoi Diagram. - Oswin Aichholzer; Franz Aurenhammer; Belén Palop (Discret. Comput. Geom., 2004)

On pseudo-convex decompositions, partitions, and coverings. - Oswin Aichholzer; Clemens Huemer; Sarah Renkl; Bettina Speckmann; Csaba D. Tóth (EuroCG, 2005)

Games on triangulations. - Oswin Aichholzer; David Bremner; Erik D. Demaine; Ferran Hurtado; Evangelos Kranakis; Hannes Krasser; Suneeta Ramaswami; Saurabh Sethia; Jorge Urrutia (Theor. Comput. Sci., 2005)

On the number of plane graphs. - Oswin Aichholzer; Thomas Hackl; Birgit Vogtenhuber; Clemens Huemer; Ferran Hurtado; Hannes Krasser (SODA, 2006)

On the Crossing Number of Complete Graphs. - Oswin Aichholzer; Franz Aurenhammer; Hannes Krasser (Computing, 2006)

Transforming spanning trees and pseudo-triangulations. - Oswin Aichholzer; Franz Aurenhammer; Clemens Huemer; Hannes Krasser (Inf. Process. Lett., 2006)

On (Pointed) Minimum Weight Pseudo-Triangulations. - Oswin Aichholzer; Franz Aurenhammer; Thomas Hackl; Bettina Speckmann (CCCG, 2007)

Abstract order type extension and new results on the rectilinear crossing number. - Oswin Aichholzer; Hannes Krasser (Comput. Geom., 2007)

A quadratic distance bound on sliding between crossing-free spanning trees. - Oswin Aichholzer; Klaus Reinhardt (Comput. Geom., 2007)

Connecting colored point sets. - Oswin Aichholzer; Franz Aurenhammer; Thomas Hackl; Clemens Huemer (Discret. Appl. Math., 2007)

Pre-Triangulations and Liftable Complexes. - Oswin Aichholzer; Franz Aurenhammer; Thomas Hackl (Discret. Comput. Geom., 2007)

New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn. - Oswin Aichholzer; Jesús García-López; David Orden; Pedro Ramos 001 (Discret. Comput. Geom., 2007)

New results on lower bounds for the number of (k)-facets: (extended abstract). - Oswin Aichholzer; Jesús García-López; David Orden; Pedro Ramos 001 (Electron. Notes Discret. Math., 2007)

Gray Code Enumeration of Plane Straight-Line Graphs. - Oswin Aichholzer; Franz Aurenhammer; Clemens Huemer; Birgit Vogtenhuber (Graphs Comb., 2007)

On the Number of Plane Geometric Graphs. - Oswin Aichholzer; Thomas Hackl; Clemens Huemer; Ferran Hurtado; Hannes Krasser; Birgit Vogtenhuber (Graphs Comb., 2007)

Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles. - Oswin Aichholzer; Clemens Huemer; Sarah Kappes; Bettina Speckmann; Csaba D. Tóth (Graphs Comb., 2007)

Matching edges and faces in polygonal partitions. - Oswin Aichholzer; Franz Aurenhammer; Paola Gonzalez-Nava; Thomas Hackl; Clemens Huemer; Ferran Hurtado; Hannes Krasser; Saurabh Ray; Birgit Vogtenhuber (Comput. Geom., 2008)

Triangulations without pointed spanning trees. - Oswin Aichholzer; Clemens Huemer; Hannes Krasser (Comput. Geom., 2008)

On the number of pseudo-triangulations of certain point sets. - Oswin Aichholzer; David Orden; Francisco Santos; Bettina Speckmann (J. Comb. Theory A, 2008)

Medial axis computation for planar free-form shapes. - Oswin Aichholzer; Wolfgang Aigner; Franz Aurenhammer; Thomas Hackl; Bert Jüttler; Margot Rabl (Comput. Aided Des., 2009)

Recovering Structure from r-Sampled Objects. - Oswin Aichholzer; Franz Aurenhammer; B. Kornberger; Simon Plantinga; Günter Rote; Astrid Sturm; Gert Vegter (Comput. Graph. Forum, 2009)

Improved upper bounds on the reflexivity of point sets. - Eyal Ackerman; Oswin Aichholzer; Balázs Keszegh (Comput. Geom., 2009)

Editorial. - Oswin Aichholzer; Franz Aurenhammer (Comput. Geom., 2009)

On minimum weight pseudo-triangulations. - Oswin Aichholzer; Franz Aurenhammer; Thomas Hackl; Bettina Speckmann (Comput. Geom., 2009)

Compatible geometric matchings. - Oswin Aichholzer; Sergey Bereg; Adrian Dumitrescu; Alfredo García Olaverri; Clemens Huemer; Ferran Hurtado; Mikio Kano; Alberto Márquez 001; David Rappaport; Shakhar Smorodinsky; Diane L. Souvaine; Jorge Urrutia; et al. (Comput. Geom., 2009)

Empty monochromatic triangles. - Oswin Aichholzer; Ruy Fabila Monroy; David Flores-Peñaloza; Thomas Hackl; Clemens Huemer; Jorge Urrutia (Comput. Geom., 2009)

New results on lower bounds for the number of (<=k)-facets. - Oswin Aichholzer; Jesús García-López; David Orden; Pedro Ramos 001 (Eur. J. Comb., 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)

Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics. - Oswin Aichholzer; Wolfgang Aigner; Franz Aurenhammer; Bert Jüttler (Curves and Surfaces, 2010)

Exact Medial Axis Computation for Circular Arc Boundaries. - Oswin Aichholzer; Wolfgang Aigner; Thomas Hackl; Nicola Wolpert (Curves and Surfaces, 2010)

Compatible pointed pseudo-triangulations. - Thomas Hackl; Oswin Aichholzer; Birgit Vogtenhuber (CCCG, 2010)

Playing Pylos with an autonomous robot. - Oswin Aichholzer; Daniel Detassis; Thomas Hackl; Gerald Steinbauer; Johannes Thonhauser (IROS, 2010)

Divide-and-conquer for Voronoi diagrams revisited. - Oswin Aichholzer; Wolfgang Aigner; Franz Aurenhammer; Thomas Hackl; Bert Jüttler; Elisabeth Pilgerstorfer; Margot Rabl (Comput. Geom., 2010)

Edge-Removal and Non-Crossing Configurations in Geometric Graphs. - Oswin Aichholzer; Sergio Cabello; Ruy Fabila Monroy; David Flores-Peñaloza; Thomas Hackl; Clemens Huemer; Ferran Hurtado; David R. Wood (Discret. Math. Theor. Comput. Sci., 2010)

Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons. - Oswin Aichholzer; Thomas Hackl; Clemens Huemer; Ferran Hurtado; Birgit Vogtenhuber (SIAM J. Discret. Math., 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)

Convexifying Monotone Polygons while Maintaining Internal Visibility. - Oswin Aichholzer; Mario Cetina; Ruy Fabila Monroy; Jesús Leaños; Gelasio Salazar; Jorge Urrutia (EGC, 2011)

On 5-Gons and 5-Holes. - Oswin Aichholzer; Thomas Hackl; Birgit Vogtenhuber (EGC, 2011)

There is a unique crossing-minimal rectilinear drawing of K18. - Oswin Aichholzer; Bernardo M. Ábrego; Silvia Fernández-Merchant; Jesús Leaños; Gelasio Salazar (Electron. Notes Discret. Math., 2011)

Computational and Structural Advantages of Circular Boundary Representation. - Oswin Aichholzer; Franz Aurenhammer; Thomas Hackl; Bert Jüttler; Margot Rabl; Zbynek Sír (Int. J. Comput. Geom. Appl., 2011)

What makes a Tree a Straight Skeleton? - Oswin Aichholzer; Howard Cheng; Satyan L. Devadoss; Thomas Hackl; Stefan Huber 001; Brian Li; Andrej Risteski (CCCG, 2012)

On k-convex polygons. - Oswin Aichholzer; Franz Aurenhammer; Erik D. Demaine; Ferran Hurtado; Pedro Ramos 001; Jorge Urrutia (Comput. Geom., 2012)

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

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. - Oswin Aichholzer; Jean Cardinal; Thomas Hackl; Ferran Hurtado; Matias Korman; Alexander Pilz; Rodrigo I. Silveira; Ryuhei Uehara; Birgit Vogtenhuber; Emo Welzl (CCCG, 2013)

Maximizing maximal angles for plane straight-line graphs. - Oswin Aichholzer; Thomas Hackl; Michael Hoffmann 001; Clemens Huemer; Attila Pór; Francisco Santos; Bettina Speckmann; Birgit Vogtenhuber (Comput. Geom., 2013)

Blocking Delaunay triangulations. - Oswin Aichholzer; Ruy Fabila Monroy; Thomas Hackl; Marc J. van Kreveld; Alexander Pilz; Pedro Ramos 001; Birgit Vogtenhuber (Comput. Geom., 2013)

Extreme point and halving edge search in abstract order types. - Oswin Aichholzer; Tillmann Miltzow; Alexander Pilz (Comput. Geom., 2013)

Shellable drawings and the cylindrical crossing number of $K_n$. - Bernardo M. Ábrego; Oswin Aichholzer; Silvia Fernández-Merchant; Pedro Ramos 001; Gelasio Salazar (CoRR, 2013)

Monotone Simultaneous Embedding of Directed Paths. - Oswin Aichholzer; Thomas Hackl; Sarah Lutteropp; Tamara Mchedlidze; Alexander Pilz; Birgit Vogtenhuber (CoRR, 2013)

Extremal antipodal polygons and polytopes - Oswin Aichholzer; Luis Evaristo Caraballo; José Miguel Díaz-Báñez; Ruy Fabila Monroy; Carlos Ochoa; P. Nigsch (CoRR, 2013)

The 2-Page Crossing Number of Kn. - Bernardo M. Ábrego; Oswin Aichholzer; Silvia Fernández-Merchant; Pedro Ramos 001; Gelasio Salazar (Discret. Comput. Geom., 2013)

More on the crossing number of Kn: Monotone drawings. - Bernardo M. Ábrego; Oswin Aichholzer; Silvia Fernández-Merchant; Pedro Ramos 001; Gelasio Salazar (Electron. Notes Discret. Math., 2013)

Balanced 6-holes in linearly separable bichromatic point sets. - Oswin Aichholzer; Jorge Urrutia; Birgit Vogtenhuber (Electron. Notes Discret. Math., 2013)

Einführung in die angewandte Geometrie. - Oswin Aichholzer; Bert Jüttler (Birkhäuser, 2014)

Non-Shellable Drawings of Kn with Few Crossings. - Bernardo M. Ábrego; Oswin Aichholzer; Silvia Fernández-Merchant; Pedro Ramos 001; Birgit Vogtenhuber (CCCG, 2014)

Graph Drawings with Relative Edge Length Specifications. - Oswin Aichholzer; Michael Hoffmann 001; Marc J. van Kreveld; Günter Rote (CCCG, 2014)

Order types and cross-sections of line arrangements in R^3. - Oswin Aichholzer; Ruy Fabila Monroy; Ferran Hurtado; Pablo Pérez-Lantero; Andres J. Ruiz-Vargas; Jorge Urrutia; Birgit Vogtenhuber (CCCG, 2014)

Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions. - Stefan Huber 001; Oswin Aichholzer; Thomas Hackl; Birgit Vogtenhuber (CCCG, 2014)

Reconstructing Point Set Order Typesfrom Radial Orderings. - Oswin Aichholzer; Jean Cardinal; Vincent Kusters; Stefan Langerman; Pavel Valtr 001 (ISAAC, 2014)

Geodesic Order Types. - Oswin Aichholzer; Matias Korman; Alexander Pilz; Birgit Vogtenhuber (Algorithmica, 2014)

On k-convex point sets. - Oswin Aichholzer; Franz Aurenhammer; Thomas Hackl; Ferran Hurtado; Alexander Pilz; Pedro Ramos 001; Jorge Urrutia; Pavel Valtr 001; Birgit Vogtenhuber (Comput. Geom., 2014)

Theta-3 is connected. - Oswin Aichholzer; Sang Won Bae 001; Luis Barba; Prosenjit Bose; Matias Korman; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2014)

4-Holes in point sets. - Oswin Aichholzer; Ruy Fabila Monroy; Hernán González-Aguilar; Thomas Hackl; Marco A. Heredia; Clemens Huemer; Jorge Urrutia; Birgit Vogtenhuber (Comput. Geom., 2014)

Lower bounds for the number of small convex k-holes. - Oswin Aichholzer; Ruy Fabila Monroy; Thomas Hackl; Clemens Huemer; Alexander Pilz; Birgit Vogtenhuber (Comput. Geom., 2014)

Reprint of: Extreme point and halving edge search in abstract order types. - Oswin Aichholzer; Tillmann Miltzow; Alexander Pilz (Comput. Geom., 2014)

Shellable Drawings and the Cylindrical Crossing Number of Kn. - Bernardo M. Ábrego; Oswin Aichholzer; Silvia Fernández-Merchant; Pedro Ramos 001; Gelasio Salazar (Discret. Comput. Geom., 2014)

Empty Monochromatic Simplices. - Oswin Aichholzer; Ruy Fabila Monroy; Thomas Hackl; Clemens Huemer; Jorge Urrutia (Discret. Comput. Geom., 2014)

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. - Oswin Aichholzer; Jean Cardinal; Thomas Hackl; Ferran Hurtado; Matias Korman; Alexander Pilz; Rodrigo I. Silveira; Ryuhei Uehara; Pavel Valtr 001; Birgit Vogtenhuber; Emo Welzl (Discret. Math. Theor. Comput. Sci., 2014)

Plane Graphs with Parity Constraints. - Oswin Aichholzer; Thomas Hackl; Michael Hoffmann 001; Alexander Pilz; Günter Rote; Bettina Speckmann; Birgit Vogtenhuber (Graphs Comb., 2014)

Geodesic-Preserving Polygon Simplification. - Oswin Aichholzer; Thomas Hackl; Matias Korman; Alexander Pilz; Birgit Vogtenhuber (Int. J. Comput. Geom. Appl., 2014)

Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four. - Oswin Aichholzer; Thomas Hackl; David Orden; Alexander Pilz; Maria Saumell; Birgit Vogtenhuber (Int. J. Comput. Geom. Appl., 2014)

Covering Folded Shapes. - Oswin Aichholzer; Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Michael Hoffmann 001; Anna Lubiw; Jack Snoeyink; Andrew Winslow (J. Comput. Geom., 2014)

Representing Directed Trees as Straight Skeletons. - Oswin Aichholzer; Therese Biedl; Thomas Hackl; Martin Held; Stefan Huber 001; Peter Palfrader; Birgit Vogtenhuber (GD, 2015)

A Note on the Number of General 4-holes in (Perturbed) Grids. - Oswin Aichholzer; Thomas Hackl; Pavel Valtr 001; Birgit Vogtenhuber (JCDCGG, 2015)

Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position. - Oswin Aichholzer; Andrei Asinowski; Tillmann Miltzow (Electron. J. Comb., 2015)

Reprint of: Theta-3 is connected. - Oswin Aichholzer; Sang Won Bae 001; Luis Barba; Prosenjit Bose; Matias Korman; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2015)

On k-gons and k-holes in point sets. - Oswin Aichholzer; Ruy Fabila Monroy; Hernán González-Aguilar; Thomas Hackl; Marco A. Heredia; Clemens Huemer; Jorge Urrutia; Pavel Valtr 001; Birgit Vogtenhuber (Comput. Geom., 2015)

Balanced Islands in Two Colored Point Sets in the Plane. - Oswin Aichholzer; Nieves Atienza; Ruy Fabila Monroy; Pablo Pérez-Lantero; José Miguel Díaz-Báñez; David Flores-Peñaloza; Birgit Vogtenhuber; Jorge Urrutia (CoRR, 2015)

Flip Distance Between Triangulations of a Simple Polygon is NP-Complete. - Oswin Aichholzer; Wolfgang Mulzer; Alexander Pilz (Discret. Comput. Geom., 2015)

Characterization of Extremal Antipodal Polygons. - Oswin Aichholzer; Luis Evaristo Caraballo; José Miguel Díaz-Báñez; Ruy Fabila Monroy; Carlos Ochoa; P. Nigsch (Graphs Comb., 2015)

Empty Triangles in Good Drawings of the Complete Graph. - Oswin Aichholzer; Thomas Hackl; Alexander Pilz; Pedro Ramos 001; Vera Sacristán; Birgit Vogtenhuber (Graphs Comb., 2015)

3-Colorability of Pseudo-Triangulations. - Oswin Aichholzer; Franz Aurenhammer; Thomas Hackl; Clemens Huemer; Alexander Pilz; Birgit Vogtenhuber (Int. J. Comput. Geom. Appl., 2015)

Triangulations with Circular Arcs. - Oswin Aichholzer; Wolfgang Aigner; Franz Aurenhammer; Katerina Cech Dobiásová; Bert Jüttler; Günter Rote (J. Graph Algorithms Appl., 2015)

Monotone Simultaneous Embeddings of Upward Planar Digraphs. - Oswin Aichholzer; Thomas Hackl; Sarah Lutteropp; Tamara Mchedlidze; Alexander Pilz; Birgit Vogtenhuber (J. Graph Algorithms Appl., 2015)

Embedding Four-directional Paths on Convex Point Sets. - Oswin Aichholzer; Thomas Hackl; Sarah Lutteropp; Tamara Mchedlidze; Birgit Vogtenhuber (J. Graph Algorithms Appl., 2015)

An Improved Lower Bound on the Minimum Number of Triangulations. - Oswin Aichholzer; Victor Alvarez 001; Thomas Hackl; Alexander Pilz; Bettina Speckmann; Birgit Vogtenhuber (SoCG, 2016)

Packing Short Plane Spanning Trees in Complete Geometric Graphs. - Oswin Aichholzer; Thomas Hackl; Matias Korman; Alexander Pilz; Günter Rote; André van Renssen; Marcel Roeloffzen; Birgit Vogtenhuber (ISAAC, 2016)

Geometric Achromatic and Pseudoachromatic Indices. - Oswin Aichholzer; Gabriela Araujo-Pardo; Natalia García-Colín; Thomas Hackl; Dolores Lara; Christian Rubio-Montiel; Jorge Urrutia (Graphs Comb., 2016)

Reconstructing Point Set Order Types from Radial Orderings. - Oswin Aichholzer; Jean Cardinal; Vincent Kusters; Stefan Langerman; Pavel Valtr 001 (Int. J. Comput. Geom. Appl., 2016)

Packing Short Plane Spanning Graphs in Complete Geometric Graphs. - Oswin Aichholzer; Thomas Hackl; Matias Korman; Alexander Pilz; Günter Rote; André van Renssen; Marcel Roeloffzen; Birgit Vogtenhuber (CoRR, 2017)

An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. - Oswin Aichholzer; Vincent Kusters; Wolfgang Mulzer; Alexander Pilz; Manuel Wettstein (Int. J. Comput. Geom. Appl., 2017)

Packing plane spanning trees and paths in complete geometric graphs. - Oswin Aichholzer; Thomas Hackl; Matias Korman; Marc J. van Kreveld; Maarten Löffler; Alexander Pilz; Bettina Speckmann; Emo Welzl (Inf. Process. Lett., 2017)

Holes in 2-convex point sets. - Oswin Aichholzer; Martin Balko; Thomas Hackl; Alexander Pilz; Pedro Ramos 001; Pavel Valtr 001; Birgit Vogtenhuber (Comput. Geom., 2018)

Linear transformation distance for bichromatic matchings. - Oswin Aichholzer; Luis Barba; Thomas Hackl; Alexander Pilz; Birgit Vogtenhuber (Comput. Geom., 2018)

Modem illumination of monotone polygons. - Oswin Aichholzer; Ruy Fabila Monroy; David Flores-Peñaloza; Thomas Hackl; Jorge Urrutia; Birgit Vogtenhuber (Comput. Geom., 2018)

Perfect k-Colored Matchings and ((k+2) ) -Gonal Tilings. - Oswin Aichholzer; Lukas Andritsch; Karin Baur; Birgit Vogtenhuber (Graphs Comb., 2018)

Folding Polyominoes into (Poly)Cubes. - Oswin Aichholzer; Michael Biro; Erik D. Demaine; Martin L. Demaine; David Eppstein; Sándor P. Fekete; Adam Hesterberg; Irina Kostitsyna; Christiane Schmidt 001 (Int. J. Comput. Geom. Appl., 2018)

Computing balanced islands in two colored point sets in the plane. - Oswin Aichholzer; Nieves Atienza; José Miguel Díaz-Báñez; Ruy Fabila Monroy; David Flores-Peñaloza; Pablo Pérez-Lantero; Birgit Vogtenhuber; Jorge Urrutia (Inf. Process. Lett., 2018)

Bishellable drawings of Kn. - Bernardo M. Ábrego; Oswin Aichholzer; Silvia Fernández-Merchant; Dan McQuillan; Bojan Mohar; Petra Mutzel; Pedro Ramos 001; R. Bruce Richter; Birgit Vogtenhuber (SIAM J. Discret. Math., 2018)

On the Edge-Vertex Ratio of Maximal Thrackles. - Oswin Aichholzer; Linda Kleist; Boris Klemz; Felix Schröder; Birgit Vogtenhuber (GD, 2019)

On the 2-Colored Crossing Number. - Oswin Aichholzer; Ruy Fabila Monroy; Adrian Fuchs; Carlos Hidalgo-Toscano; Irene Parada; Birgit Vogtenhuber; Francisco Zaragoza (GD, 2019)

Packing plane spanning graphs with short edges in complete geometric graphs. - Oswin Aichholzer; Thomas Hackl; Matias Korman; Alexander Pilz; André van Renssen; Marcel Roeloffzen; Günter Rote; Birgit Vogtenhuber (Comput. Geom., 2019)

Cross-sections of line configurations in R3 and (d - 2)-flat configurations in Rd. - Oswin Aichholzer; Ruy Fabila Monroy; Ferran Hurtado; Pablo Pérez-Lantero; Andres J. Ruiz-Vargas; Jorge Urrutia; Birgit Vogtenhuber (Comput. Geom., 2019)

Plane Spanning Trees in Edge-Colored Simple Drawings of Kn. - Oswin Aichholzer; Michael Hoffmann 001; Johannes Obenaus; Rosna Paul; Daniel Perz; Nadja Seiferth; Birgit Vogtenhuber; Alexandra Weinberger (GD, 2020)

A superlinear lower bound on the number of 5-holes. - Oswin Aichholzer; Martin Balko; Thomas Hackl; Jan Kyncl; Irene Parada; Manfred Scheucher; Pavel Valtr 001; Birgit Vogtenhuber (J. Comb. Theory A, 2020)

Minimal Representations of Order Types by Geometric Graphs. - Oswin Aichholzer; Martin Balko; Michael Hoffmann 001; Jan Kyncl; Wolfgang Mulzer; Irene Parada; Alexander Pilz; Manfred Scheucher; Pavel Valtr 001; Birgit Vogtenhuber; Emo Welzl (J. Graph Algorithms Appl., 2020)

An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants. - Oswin Aichholzer; Frank Duque; Ruy Fabila Monroy; Oscar E. García-Quintero; Carlos Hidalgo-Toscano (J. Graph Algorithms Appl., 2020)

Another Small but Long Step for Crossing Numbers: cr(13) = 225 and cr(14) = 315. - Oswin Aichholzer (CCCG, 2021)

Flip Distances Between Graph Orientations. - Oswin Aichholzer; Jean Cardinal; Tony Huynh; Kolja Knauer; Torsten Mütze; Raphael Steiner; Birgit Vogtenhuber (Algorithmica, 2021)

Folding polyominoes with holes into a cube. - Oswin Aichholzer; Hugo A. Akitaya; Kenneth C. Cheung; Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Linda Kleist; Irina Kostitsyna; Maarten Löffler; Zuzana Masárová; Klara Mundilova; Christiane Schmidt 001 (Comput. Geom., 2021)

Edge Partitions of Complete Geometric Graphs (Part 2). - Oswin Aichholzer; Johannes Obenaus; Joachim Orthaber; Rosna Paul; Patrick Schnider; Raphael Steiner; Tim Taubner; Birgit Vogtenhuber (CoRR, 2021)

Edge Partitions of Complete Geometric Graphs. - Oswin Aichholzer; Johannes Obenaus; Joachim Orthaber; Rosna Paul; Patrick Schnider; Raphael Steiner; Tim Taubner; Birgit Vogtenhuber (SoCG, 2022)

Hardness of Token Swapping on Trees. - Oswin Aichholzer; Erik D. Demaine; Matias Korman; Anna Lubiw; Jayson Lynch; Zuzana Masárová; Mikhail Rudoy; Virginia Vassilevska Williams; Nicole Wein (ESA, 2022)

Shooting Stars in Simple Drawings of Km, n. - Oswin Aichholzer; Alfredo García 002; Irene Parada; Birgit Vogtenhuber; Alexandra Weinberger (GD, 2022)

Compatible Spanning Trees in Simple Drawings of Kn. - Oswin Aichholzer; Kristin Knorr; Wolfgang Mulzer; Nicolas El Maalouly; Johannes Obenaus; Rosna Paul; Meghana M. Reddy; Birgit Vogtenhuber; Alexandra Weinberger (GD, 2022)

Disjoint Compatibility via Graph Classes. - Oswin Aichholzer; Julia Obmann; Pavel Paták; Daniel Perz; Josef Tkadlec; Birgit Vogtenhuber (WG, 2022)

On crossing-families in planar point sets. - Oswin Aichholzer; Jan Kyncl; Manfred Scheucher; Birgit Vogtenhuber; Pavel Valtr 001 (Comput. Geom., 2022)

Flipping Plane Spanning Paths. - Oswin Aichholzer; Kristin Knorr; Maarten Löffler; Zuzana Masárová; Wolfgang Mulzer; Johannes Obenaus; Rosna Paul; Birgit Vogtenhuber (CoRR, 2022)

Geometric Dominating Sets. - Oswin Aichholzer; David Eppstein; Eva-Maria Hainzl (CoRR, 2022)

Reconfiguration of Non-crossing Spanning Trees. - Oswin Aichholzer; Brad Ballinger; Therese Biedl; Mirela Damian; Erik D. Demaine; Matias Korman; Anna Lubiw; Jayson Lynch; Josef Tkadlec; Yushi Uno (CoRR, 2022)

Blocking Delaunay Triangulations from the Exterior. - Oswin Aichholzer; Thomas Hackl; Maarten Löffler; Alexander Pilz; Irene Parada; Manfred Scheucher; Birgit Vogtenhuber (CoRR, 2022)

Drawing Graphs as Spanners. - Oswin Aichholzer; Manuel Borrazzo; Prosenjit Bose; Jean Cardinal; Fabrizio Frati; Pat Morin; Birgit Vogtenhuber (Discret. Comput. Geom., 2022)

On Compatible Matchings. - Oswin Aichholzer; Alan Arroyo; Zuzana Masárová; Irene Parada; Daniel Perz; Alexander Pilz; Josef Tkadlec; Birgit Vogtenhuber (J. Graph Algorithms Appl., 2022)

Drawings of Complete Multipartite Graphs up to Triangle Flips. - Oswin Aichholzer; Man-Kwun Chiu; Hung P. Hoang 001; Michael Hoffmann 001; Jan Kyncl; Yannic Maus; Birgit Vogtenhuber; Alexandra Weinberger (SoCG, 2023)

Bichromatic Perfect Matchings with Crossings. - Oswin Aichholzer; Stefan Felsner; Rosna Paul; Manfred Scheucher; Birgit Vogtenhuber (GD (1), 2023)

Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs. - Oswin Aichholzer; Birgit Vogtenhuber; Alexandra Weinberger (GD (2), 2023)

Flipping Plane Spanning Paths. - Oswin Aichholzer; Kristin Knorr; Wolfgang Mulzer; Johannes Obenaus; Rosna Paul; Birgit Vogtenhuber (WALCOM, 2023)

Geometric dominating sets - a minimum version of the No-Three-In-Line Problem. - Oswin Aichholzer; David Eppstein; Eva-Maria Hainzl (Comput. Geom., 2023)

Graphs with large total angular resolution. - Oswin Aichholzer; Matias Korman; Yoshio Okamoto; Irene Parada; Daniel Perz; André van Renssen; Birgit Vogtenhuber (Theor. Comput. Sci., 2023)

Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles. - Oswin Aichholzer; Joachim Orthaber; Birgit Vogtenhuber (GD, 2024)

There is a unique crossing-minimal rectilinear drawing of K_18. - Bernardo M. Ábrego; Silvia Fernández-Merchant; Oswin Aichholzer; Jesús Leaños; Gelasio Salazar (Ars Math. Contemp., 2024)

Bicolored Order Types. - Oswin Aichholzer; Anna Brötzner (Comput. Geom. Topol., 2024)

Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs. - Oswin Aichholzer; Joachim Orthaber; Birgit Vogtenhuber (Comput. Geom. Topol., 2024)

Folding polyominoes into cubes. - Oswin Aichholzer; Florian Lehner; Christian Lindorfer (CoRR, 2024)

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. - Oswin Aichholzer; Alfredo García 002; Javier Tejel; Birgit Vogtenhuber; Alexandra Weinberger (Discret. Comput. Geom., 2024)

Perfect Matchings with Crossings. - Oswin Aichholzer; Ruy Fabila Monroy; Philipp Kindermann; Irene Parada; Rosna Paul; Daniel Perz; Patrick Schnider; Birgit Vogtenhuber (Algorithmica, 2024)

Flips in odd matchings. - Oswin Aichholzer; Anna Brötzner; Daniel Perz; Patrick Schnider (Comput. Geom., 2025)

Connected matchings. - Oswin Aichholzer; Sergio Cabello; Viola Mészáros; Patrick Schnider; Jan Soukup (Comput. Geom., 2025)

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets. - Oswin Aichholzer; Joseph Dorfer (CoRR, 2025)

Constrained Flips in Plane Spanning Trees. - Oswin Aichholzer; Joseph Dorfer; Birgit Vogtenhuber (CoRR, 2025)