| Optimally solving a transportation problem using Voronoi diagrams D Geiß, R Klein, R Penninger, G Rote Computational Geometry 46 (8), 1009-1016, 2013 | 36 | 2013 |
| Tolerant algorithms R Klein, R Penninger, C Sohler, DP Woodruff Algorithms–ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany …, 2011 | 29 | 2011 |
| Point set isolation using unit disks is NP-complete R Penninger, I Vigan arXiv preprint arXiv:1303.2779, 2013 | 8 | 2013 |
| Most Finite Point Sets in the Plane have Dilation R Klein, M Kutz, R Penninger Discrete & Computational Geometry 53 (1), 80-106, 2015 | 6 | 2015 |
| On isolating points using unit disks M Gibson, G Kanade, R Penninger, K Varadarajan, I Vigan Journal of computational geometry 7 (1), 540–557-540–557, 2016 | 5 | 2016 |
| Computing the visibility area between two simple polygons in linear time E Langetepe, R Penninger, J Tulke Proc. 26th European Workshop on Computational Geometry 26, 237-240, 2010 | 2 | 2010 |
| Dilation, Transport, Visibility and Fault-Tolerant Algorithms R Penninger Universitäts-und Landesbibliothek Bonn, 2014 | | 2014 |
