Alexander Pilz

Orcid: 0000-0002-6059-1821

According to our database1, Alexander Pilz authored at least 51 papers between 2012 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
On Compatible Matchings.
J. Graph Algorithms Appl., 2022

Arrangements of Approaching Pseudo-Lines.
Discret. Comput. Geom., 2022

Blocking Delaunay Triangulations from the Exterior.
CoRR, 2022

On Plane Subgraphs of Complete Topological Drawings.
CoRR, 2022

2021
Bisecting three classes of lines.
Comput. Geom., 2021

On plane subgraphs of complete topological drawings.
Ars Math. Contemp., 2021

2020
Minimal Representations of Order Types by Geometric Graphs.
J. Graph Algorithms Appl., 2020

Transition operations over plane trees.
Discret. Math., 2020

From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices.
Discret. Comput. Geom., 2020

Augmenting Geometric Graphs with Matchings.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019
Convex Quadrangulations of Bichromatic Point Sets.
Int. J. Comput. Geom. Appl., 2019

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

Switches in Eulerian graphs.
CoRR, 2019

Sharing a pizza: bisecting masses with two cuts.
CoRR, 2019

A new lower bound on the maximum number of plane graphs using production matrices.
Comput. Geom., 2019

Packing plane spanning graphs with short edges in complete geometric graphs.
Comput. Geom., 2019

2018
Order on Order Types.
Discret. Comput. Geom., 2018

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

The dual diameter of triangulations.
Comput. Geom., 2018

Linear transformation distance for bichromatic matchings.
Comput. Geom., 2018

Holes in 2-convex point sets.
Comput. Geom., 2018

Ham-Sandwich Cuts for Abstract Order Types.
Algorithmica, 2018

Convex Hulls in Polygonal Domains.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Extending the Centerpoint Theorem to Multiple Points.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Packing plane spanning trees and paths in complete geometric graphs.
Inf. Process. Lett., 2017

An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings.
Int. J. Comput. Geom. Appl., 2017

Characteristic polynomials of production matrices for geometric graphs.
Electron. Notes Discret. Math., 2017

Induced Ramsey-type results and binary predicates for point sets.
Electron. Notes Discret. Math., 2017

Packing Short Plane Spanning Graphs in Complete Geometric Graphs.
CoRR, 2017

2016
Production matrices for geometric graphs.
Electron. Notes Discret. Math., 2016

Packing Short Plane Spanning Trees in Complete Geometric Graphs.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

An Improved Lower Bound on the Minimum Number of Triangulations.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Monotone Simultaneous Embeddings of Upward Planar Digraphs.
J. Graph Algorithms Appl., 2015

3-Colorability of Pseudo-Triangulations.
Int. J. Comput. Geom. Appl., 2015

Empty Triangles in Good Drawings of the Complete Graph.
Graphs Comb., 2015

Flip Distance Between Triangulations of a Simple Polygon is NP-Complete.
Discret. Comput. Geom., 2015

New results on stabbing segments with a polygon.
Comput. Geom., 2015

2014
Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four.
Int. J. Comput. Geom. Appl., 2014

Geodesic-Preserving Polygon Simplification.
Int. J. Comput. Geom. Appl., 2014

Plane Graphs with Parity Constraints.
Graphs Comb., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Discret. Math. Theor. Comput. Sci., 2014

Flip distance between triangulations of a planar point set is APX-hard.
Comput. Geom., 2014

Reprint of: Extreme point and halving edge search in abstract order types.
Comput. Geom., 2014

Lower bounds for the number of small convex k-holes.
Comput. Geom., 2014

On k-convex point sets.
Comput. Geom., 2014

Geodesic Order Types.
Algorithmica, 2014

2013
Monotone Simultaneous Embedding of Directed Paths.
CoRR, 2013

Extreme point and halving edge search in abstract order types.
Comput. Geom., 2013

Blocking Delaunay triangulations.
Comput. Geom., 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

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


  Loading...