| Publication | Date of Publication | Type |
|---|
| Dynamic connectivity in disk graphs | 2024-01-09 | Paper |
| Flipping plane spanning paths | 2023-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065413 | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059979 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6060008 | 2023-11-02 | Paper |
| Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead | 2023-10-31 | Paper |
| Maximum matchings in geometric intersection graphs | 2023-10-12 | Paper |
| Compatible spanning trees in simple drawings of \(K_n\) | 2023-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874304 | 2023-02-07 | Paper |
| No-dimensional Tverberg theorems and algorithms | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091017 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091042 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092418 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088955 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075809 | 2022-05-11 | Paper |
| On the Stretch Factor of Polygonal Chains | 2021-07-23 | Paper |
| Stabbing pairwise intersecting disks by five points | 2021-06-14 | Paper |
| Time-space trade-offs for computing Euclidean minimum spanning trees | 2021-01-12 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:3387270 A Simple Randomized $O(n \log n)$--Time Closest-Pair Algorithm in
Doubling Metrics] | 2021-01-12 | Paper |
| Minimum cuts in geometric intersection graphs | 2021-01-07 | Paper |
| Combinatorics of beacon-based routing in three dimensions | 2021-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136216 | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136225 | 2020-11-25 | Paper |
| Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications | 2020-10-23 | Paper |
| Routing in histograms | 2020-07-22 | Paper |
| Routing in polygonal domains | 2020-04-22 | Paper |
| A constructive proof of a concentration bound for real-valued random variables | 2020-04-03 | Paper |
| Reachability oracles for directed transmission graphs | 2020-04-01 | Paper |
| Time-space trade-offs for computing Euclidean minimum spanning trees | 2020-02-12 | Paper |
| Recognizing generalized transmission graphs of line segments and circular sectors | 2020-02-12 | Paper |
| Combinatorics of beacon-based routing in three dimensions | 2020-02-12 | Paper |
| Faster algorithms for growing prioritized disks and rectangles | 2019-10-18 | Paper |
| A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon | 2019-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967245 | 2019-07-03 | Paper |
| Four Soviets Walk the Dog—with an Application to Alt's Conjecture | 2019-06-20 | Paper |
| Improved Time-Space Trade-offs for Computing Voronoi Diagrams | 2019-02-27 | Paper |
| Time-space trade-offs for triangulations and Voronoi diagrams | 2018-10-31 | Paper |
| Computational aspects of the colorful Carathéodory theorem | 2018-10-30 | Paper |
| Spanners for Directed Transmission Graphs | 2018-08-21 | Paper |
| The Rainbow at the End of the Line — A PPAD Formulation of the Colorful Carathéodory Theorem with Applications | 2018-07-16 | Paper |
| Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications | 2018-07-16 | Paper |
| Improved Time-Space Trade-offs for Computing Voronoi Diagrams | 2018-04-19 | Paper |
| Routing in unit disk graphs | 2018-04-11 | Paper |
| The dual diameter of triangulations | 2018-02-19 | Paper |
| An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings | 2017-10-20 | Paper |
| Computing hereditary convex structures | 2017-10-20 | Paper |
| Four Soviets walk the dog: improved bounds for computing the Fréchet distance | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368675 | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368683 | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368725 | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365153 | 2017-09-29 | Paper |
| Delta-fast tries: local searches in bounded universes with linear space | 2017-09-22 | Paper |
| Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon | 2017-05-05 | Paper |
| Approximability of the discrete Fréchet distance | 2017-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2968076 | 2017-03-09 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:2968106 Unions of Onions: Preprocessing Imprecise Points for Fast Onion
Decomposition] | 2017-03-09 | Paper |
| Computing the Fréchet distance with a retractable leash | 2016-09-14 | Paper |
| Routing in unit disk graphs | 2016-05-03 | Paper |
| An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings | 2016-01-11 | Paper |
| Flip distance between triangulations of a simple polygon is NP-complete | 2015-12-02 | Paper |
| Time-Space Trade-offs for Triangulations and Voronoi Diagrams | 2015-10-30 | Paper |
| ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS | 2015-07-01 | Paper |
| Data structures on event graphs | 2015-06-25 | Paper |
| Self-improving algorithms for coordinate-wise maxima | 2014-08-07 | Paper |
| Approximating Tverberg points in linear time for any fixed dimension | 2014-08-07 | Paper |
| Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls | 2014-07-30 | Paper |
| Delaunay Triangulations in O(sort(n)) Time and More | 2014-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417730 | 2014-05-22 | Paper |
| Convex hull of imprecise points in o(n log n) time after preprocessing | 2014-03-24 | Paper |
| Reprint of: Memory-constrained algorithms for simple polygons | 2014-01-22 | Paper |
| Algorithms for Tolerated Tverberg Partitions | 2014-01-14 | Paper |
| Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons | 2013-11-28 | Paper |
| Approximating Tverberg points in linear time for any fixed dimension | 2013-09-23 | Paper |
| Flip distance between triangulations of a simple polygon is NP-complete | 2013-09-17 | Paper |
| Computing the Fréchet Distance with a Retractable Leash | 2013-09-17 | Paper |
| Vertex Deletion for 3D Delaunay Triangulations | 2013-09-17 | Paper |
| Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition | 2013-08-12 | Paper |
| Memory-constrained algorithms for simple polygons | 2013-07-31 | Paper |
| Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing | 2013-03-07 | Paper |
| Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent | 2012-11-29 | Paper |
| Data structures on event graphs | 2012-09-25 | Paper |
| Preprocessing imprecise points for Delaunay triangulation: simplified and extended | 2011-11-07 | Paper |
| Self-Improving Algorithms | 2011-07-29 | Paper |
| Delaunay triangulations in O (sort( n )) time and more | 2011-07-14 | Paper |
| Computing hereditary convex structures | 2011-06-03 | Paper |
| A note on predecessor searching in the pointer machine model | 2010-08-20 | Paper |
| Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon | 2010-02-09 | Paper |
| Delaunay Triangulation of Imprecise Points Simplified and Extended | 2009-10-20 | Paper |
| Markov incremental constructions | 2009-08-27 | Paper |
| Markov incremental constructions | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601515 | 2009-02-10 | Paper |
| Minimum-weight triangulation is NP-hard | 2008-12-21 | Paper |
