A novel type of skeleton for polygons O Aichholzer, F Aurenhammer, D Alberts, B Gärtner J. UCS The Journal of Universal Computer Science: Annual Print and CD-ROM …, 1996 | 490 | 1996 |

Straight skeletons for general polygonal figures in the plane O Aichholzer, F Aurenhammer Computing and Combinatorics: Second Annual International Conference, COCOON …, 1996 | 276 | 1996 |

Enumerating order types for small sets with applications O Aichholzer, F Aurenhammer, H Krasser Proceedings of the seventeenth annual symposium on Computational geometry, 11-18, 2001 | 189 | 2001 |

Matching shapes with a reference point H Alt, O Aichholzer, G Rote Proceedings of the tenth annual symposium on Computational geometry, 85-92, 1994 | 124 | 1994 |

Medial axis computation for planar free–form shapes O Aichholzer, W Aigner, F Aurenhammer, T Hackl, B Jüttler, M Rabl Computer-Aided Design 41 (5), 339-349, 2009 | 118 | 2009 |

The point set order type data base: A collection of applications and results. O Aichholzer, H Krasser CCCG 1, 17-20, 2001 | 98 | 2001 |

Abstract order type extension and new results on the rectilinear crossing number O Aichholzer, H Krasser Proceedings of the twenty-first annual symposium on Computational geometry …, 2005 | 88 | 2005 |

Quickest paths, straight skeletons, and the city Voronoi diagram O Aichholzer, F Aurenhammer, B Palop Proceedings of the eighteenth annual symposium on Computational geometry …, 2002 | 88 | 2002 |

Triangulations intersect nicely O Aichholzer, G Rote Proceedings of the eleventh annual symposium on Computational geometry, 220-229, 1995 | 75 | 1995 |

Compatible geometric matchings O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ... Computational Geometry 42 (6-7), 617-626, 2009 | 67 | 2009 |

On the number of plane geometric graphs O Aichholzer, T Hackl, C Huemer, F Hurtado, H Krasser, B Vogtenhuber Graphs and Combinatorics 23 (Suppl 1), 67-84, 2007 | 66 | 2007 |

A lower bound on the number of triangulations of planar point sets O Aichholzer, F Hurtado, M Noy Computational Geometry 29 (2), 135-145, 2004 | 65 | 2004 |

Flip distance between triangulations of a simple polygon is NP-complete O Aichholzer, W Mulzer, A Pilz Discrete & computational geometry 54, 368-389, 2015 | 61 | 2015 |

Pseudotriangulations from surfaces and a novel type of edge flip O Aichholzer, F Aurenhammer, H Krasser, P Brass SIAM Journal on Computing 32 (6), 1621-1653, 2003 | 60 | 2003 |

New lower bounds for the number of (≤ k)-edges and the rectilinear crossing number of Kn O Aichholzer, J Garcia, D Orden, P Ramos Discrete & Computational Geometry 38 (1), 1-14, 2007 | 59 | 2007 |

The path of a triangulation O Aichholzer Proceedings of the fifteenth annual symposium on Computational geometry, 14-23, 1999 | 59 | 1999 |

The 2-Page Crossing Number of BM Ábrego, O Aichholzer, S Fernández-Merchant, P Ramos, G Salazar Discrete & Computational Geometry 49, 747-777, 2013 | 55 | 2013 |

All good drawings of small complete graphs BM Ábrego, O Aichholzer, S Fernández-Merchant, T Hackl, J Pammer, ... Proc. 31st European Workshop on Computational Geometry (EuroCG), 57-60, 2015 | 51 | 2015 |

On the crossing number of complete graphs O Aichholzer, F Aurenhammer, H Krasser Proceedings of the eighteenth annual symposium on Computational geometry, 19-24, 2002 | 50 | 2002 |

Shellable Drawings and the Cylindrical Crossing Number of BM Ábrego, O Aichholzer, S Fernández-Merchant, P Ramos, G Salazar Discrete & Computational Geometry 52, 743-753, 2014 | 48 | 2014 |