Alexander Pilz

Orcid: 0000-0002-6059-1821

According to our database¹, Alexander Pilz authored at least 51 papers between 2009 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

Analysing a Multi-Criteria Analysis to Prioritise Munition Piles in the German Baltic Sea for Remediation.

[BibT_eX]

[DOI]

Alexander Pilz

Torsten Frey

Edzer J. Pebesma

Proceedings of the 28th AGILE Conference on Geographic Information Science, 2025

2022

Arrangements of Approaching Pseudo-Lines.

[BibT_eX]

[DOI]

Stefan Felsner

Alexander Pilz

Patrick Schnider

Discret. Comput. Geom., 2022

Blocking Delaunay Triangulations from the Exterior.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Bisecting three classes of lines.

[BibT_eX]

[DOI]

Alexander Pilz

Patrick Schnider

Comput. Geom., 2021

On plane subgraphs of complete topological drawings.

[BibT_eX]

[DOI]

Alfredo García Olaverri

Javier Tejel Altarriba

Alexander Pilz

Ars Math. Contemp., 2021

On Compatible Matchings.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2021

2020

Augmenting Geometric Graphs with Matchings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

Convex Quadrangulations of Bichromatic Point Sets.

[BibT_eX]

[DOI]

Alexander Pilz

Carlos Seara

Int. J. Comput. Geom. Appl., 2019

Switches in Eulerian graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Sharing a pizza: bisecting masses with two cuts.

[BibT_eX]

[DOI]

Luis Barba

Alexander Pilz

Patrick Schnider

CoRR, 2019

A new lower bound on the maximum number of plane graphs using production matrices.

[BibT_eX]

[DOI]

Clemens Huemer

Alexander Pilz

Rodrigo I. Silveira

Comput. Geom., 2019

Packing plane spanning graphs with short edges in complete geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Minimal Representations of Order Types by Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

A Note on the Flip Distance Problem for Edge-Labeled Triangulations.

[BibT_eX]

[DOI]

Alexander Pilz

CoRR, 2018

The dual diameter of triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Planar 3-SAT with a Clause/Variable Cycle.

[BibT_eX]

[DOI]

Alexander Pilz

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Convex Hulls in Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Transition Operations over Plane Trees.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Extending the Centerpoint Theorem to Multiple Points.

[BibT_eX]

[DOI]

Alexander Pilz

Patrick Schnider

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Characteristic polynomials of production matrices for geometric graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Induced Ramsey-type results and binary predicates for point sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Packing Short Plane Spanning Graphs in Complete Geometric Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Holes in 2-Convex Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices.

[BibT_eX]

[DOI]

Alexander Pilz

Emo Welzl

Manuel Wettstein

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Production matrices for geometric graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Packing Short Plane Spanning Trees in Complete Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

An Improved Lower Bound on the Minimum Number of Triangulations.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Monotone Simultaneous Embeddings of Upward Planar Digraphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

3-Colorability of Pseudo-Triangulations.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2015

Empty Triangles in Good Drawings of the Complete Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2015

An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Order on Order Types.

[BibT_eX]

[DOI]

Alexander Pilz

Emo Welzl

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Flip distance between triangulations of a planar point set is APX-hard.

[BibT_eX]

[DOI]

Alexander Pilz

Comput. Geom., 2014

Reprint of: Extreme point and halving edge search in abstract order types.

[BibT_eX]

[DOI]

Oswin Aichholzer

Tillmann Miltzow

Alexander Pilz

Comput. Geom., 2014

On k-convex point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Ham-Sandwich Cuts for Abstract Order Types.

[BibT_eX]

[DOI]

Stefan Felsner

Alexander Pilz

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Linear transformation distance for bichromatic matchings.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Monotone Simultaneous Embedding of Directed Paths.

[BibT_eX]

[DOI]

CoRR, 2013

Extreme point and halving edge search in abstract order types.

[BibT_eX]

[DOI]

Oswin Aichholzer

Tillmann Miltzow

Alexander Pilz

Comput. Geom., 2013

Geodesic-Preserving Polygon Simplification.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Flip Distance between Triangulations of a Simple Polygon is NP-Complete.

[BibT_eX]

[DOI]

Oswin Aichholzer

Wolfgang Mulzer

Alexander Pilz

Proceedings of the Algorithms - ESA 2013, 2013

New Results on Stabbing Segments with a Polygon.

[BibT_eX]

[DOI]

José Miguel Díaz-Báñez

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Flip Distance Between Triangulations of a Planar Point Set is NP-Complete

[BibT_eX]

[DOI]

Alexander Pilz

CoRR, 2012

Geodesic Order Types.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Lower Bounds for the Number of Small Convex k-Holes.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2010

Blocking delaunay triangulations.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Plane Graphs with Parity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Alexander Pilz

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...