Flip Distance Between Triangulations of a Planar Point Set is NP-Complete - Alexander Pilz (CoRR, 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)

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)

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

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)

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)

Flip distance between triangulations of a planar point set is APX-hard. - Alexander Pilz (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)

New results on stabbing segments with a polygon. - José Miguel Díaz-Báñez; Matias Korman; Pablo Pérez-Lantero; Alexander Pilz; Carlos Seara; Rodrigo I. Silveira (Comput. Geom., 2015)

Flip Distance Between Triangulations of a Simple Polygon is NP-Complete. - Oswin Aichholzer; Wolfgang Mulzer; Alexander Pilz (Discret. Comput. Geom., 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)

Monotone Simultaneous Embeddings of Upward Planar Digraphs. - Oswin Aichholzer; Thomas Hackl; Sarah Lutteropp; Tamara Mchedlidze; Alexander Pilz; 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)

Production matrices for geometric graphs. - Clemens Huemer; Carlos Seara; Rodrigo I. Silveira; Alexander Pilz (Electron. Notes Discret. Math., 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)

Induced Ramsey-type results and binary predicates for point sets. - Martin Balko; Jan Kyncl; Stefan Langerman; Alexander Pilz (Electron. Notes Discret. Math., 2017)

Characteristic polynomials of production matrices for geometric graphs. - Clemens Huemer; Alexander Pilz; Carlos Seara; Rodrigo I. Silveira (Electron. Notes Discret. Math., 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)

Extending the Centerpoint Theorem to Multiple Points. - Alexander Pilz; Patrick Schnider (ISAAC, 2018)

Convex Hulls in Polygonal Domains. - Luis Barba; Michael Hoffmann 001; Matias Korman; Alexander Pilz (SWAT, 2018)

Ham-Sandwich Cuts for Abstract Order Types. - Stefan Felsner; Alexander Pilz (Algorithmica, 2018)

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)

The dual diameter of triangulations. - Matias Korman; Stefan Langerman; Wolfgang Mulzer; Alexander Pilz; Maria Saumell; Birgit Vogtenhuber (Comput. Geom., 2018)

A Note on the Flip Distance Problem for Edge-Labeled Triangulations. - Alexander Pilz (CoRR, 2018)

Order on Order Types. - Alexander Pilz; Emo Welzl (Discret. Comput. Geom., 2018)

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)

A new lower bound on the maximum number of plane graphs using production matrices. - Clemens Huemer; Alexander Pilz; Rodrigo I. Silveira (Comput. Geom., 2019)

Sharing a pizza: bisecting masses with two cuts. - Luis Barba; Alexander Pilz; Patrick Schnider (CoRR, 2019)

Switches in Eulerian graphs. - Ahad N. Zehmakan; Jerri Nummenpalo; Alexander Pilz; Daniel Wolleb-Graf (CoRR, 2019)

Planar 3-SAT with a Clause/Variable Cycle. - Alexander Pilz (Discret. Math. Theor. Comput. Sci., 2019)

Convex Quadrangulations of Bichromatic Point Sets. - Alexander Pilz; Carlos Seara (Int. J. Comput. Geom. Appl., 2019)

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

From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. - Alexander Pilz; Emo Welzl; Manuel Wettstein (Discret. Comput. Geom., 2020)

Transition operations over plane trees. - Torrie L. Nichols; Alexander Pilz; Csaba D. Tóth; Ahad N. Zehmakan (Discret. Math., 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)

On plane subgraphs of complete topological drawings. - Alfredo García Olaverri; Javier Tejel Altarriba; Alexander Pilz (Ars Math. Contemp., 2021)

Bisecting three classes of lines. - Alexander Pilz; Patrick Schnider (Comput. Geom., 2021)

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

Arrangements of Approaching Pseudo-Lines. - Stefan Felsner; Alexander Pilz; Patrick Schnider (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)