| Publication | Date of Publication | Type |
|---|
| Some new results on geometric transversals | 2024-10-25 | Paper |
| Minimum-width double-slabs and widest empty slabs in high dimensions | 2024-05-31 | Paper |
| Covering families of triangles | 2023-10-04 | Paper |
| Weakly and Strongly Fan-Planar Graphs | 2023-08-17 | Paper |
| The thickness of fan-planar graphs is at most three | 2023-08-16 | Paper |
| Separating and shattering long line segments | 2023-01-25 | Paper |
| Computing the maximum overlap of two convex polygons under translations | 2023-01-25 | Paper |
| Parallel computation of discrete Voronoi diagrams | 2022-08-16 | Paper |
| The Topology of the set of line Transversals | 2022-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5077652 | 2022-05-18 | Paper |
| The inverse Kakeya problem | 2022-02-22 | Paper |
| No weak epsilon nets for lines and convex sets in space | 2022-02-06 | Paper |
| The reverse Kakeya problem | 2021-04-20 | Paper |
| Fitting a graph to one-dimensional data | 2021-04-15 | Paper |
| Smallest universal covers for families of triangles | 2021-01-07 | Paper |
| Computation of spatial skyline points | 2021-01-07 | Paper |
| Placing your Coins on a Shelf | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136224 | 2020-11-25 | Paper |
| The Reverse Kakeya Problem | 2020-08-18 | Paper |
| The Inverse Kakeya Problem | 2019-12-18 | Paper |
| Packing 2D disks into a 3D container | 2019-10-15 | Paper |
| Covering many points with a small-area box | 2019-09-10 | Paper |
| Shortcuts for the circle | 2019-03-20 | Paper |
| Placing your Coins on a Shelf | 2019-02-27 | Paper |
| The one-round Voronoi game | 2018-11-23 | Paper |
| The minimum convex container of two convex polytopes under translations | 2018-11-19 | Paper |
| Weight Balancing on Boundaries and Skeletons | 2018-04-23 | Paper |
| Finding Largest Common Point Sets | 2018-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132843 | 2018-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132899 | 2018-01-30 | Paper |
| Hadwiger and Helly-type theorems for disjoint unit spheres in R 3 | 2017-10-20 | Paper |
| Maximizing the overlap of two planar convex sets under rigid motions | 2017-10-20 | Paper |
| Reachability by paths of bounded curvature in convex polygons | 2017-09-29 | Paper |
| The number of holes in the union of translates of a convex set in three dimensions | 2017-02-24 | Paper |
| On lazy randomized incremental construction | 2016-09-01 | Paper |
| Separating and shattering long line segments | 2016-06-09 | Paper |
| Computing a single cell in the overlay of two simple polygons | 2016-05-26 | Paper |
| Geometric permutations of non-overlapping unit balls revisited | 2016-04-12 | Paper |
| On the Number of Edges of Fan-Crossing Free Graphs | 2016-02-19 | Paper |
| Finding largest rectangles in convex polygons | 2016-01-18 | Paper |
| SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES | 2015-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501374 | 2015-08-03 | Paper |
| A deterministic algorithm for the three-dimensional diameter problem | 2015-05-07 | Paper |
| Piecewise linear paths among convex obstacles | 2015-05-07 | Paper |
| A generalization of the convex Kakeya problem | 2015-01-19 | Paper |
| A fast algorithm for data collection along a fixed track | 2014-10-06 | Paper |
| On the Number of Edges of Fan-Crossing Free Graphs | 2014-01-14 | Paper |
| Lower Bounds for Pinning Lines by Balls (Extended Abstract) | 2013-10-10 | Paper |
| A Fast Algorithm for Data Collection along a Fixed Track | 2013-06-11 | Paper |
| The cost of bounded curvature | 2013-04-29 | Paper |
| Set systems and families of permutations with small traces | 2012-12-03 | Paper |
| Lower bounds to Helly numbers of line transversals to disjoint congruent balls | 2012-11-13 | Paper |
| The Cost of Bounded Curvature | 2012-09-25 | Paper |
| A generalization of the convex Kakeya problem | 2012-06-29 | Paper |
| Reachability by paths of bounded curvature in a convex polygon | 2012-06-08 | Paper |
| Aligning two convex figures to minimize area or perimeter | 2012-04-26 | Paper |
| REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION | 2011-05-11 | Paper |
| Farthest-polygon Voronoi diagrams | 2011-03-25 | Paper |
| Lines pinning lines | 2011-03-10 | Paper |
| A note on the perimeter of fat objects | 2010-10-15 | Paper |
| The complexity of flow on fat terrains and its i/o-efficient computation | 2010-03-16 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Computation of Non-dominated Points Using Compact Voronoi Diagrams | 2010-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619940 | 2009-04-14 | Paper |
| CONSTRUCTING OPTIMAL HIGHWAYS | 2009-04-14 | Paper |
| I/O-Efficient Flow Modeling on Fat Terrains | 2009-02-17 | Paper |
| Aperture-angle and Hausdorff-approximation of convex figures | 2009-02-12 | Paper |
| Aperture-angle and Hausdorff-approximation of convex figures | 2008-12-02 | Paper |
| Farthest-Polygon Voronoi Diagrams | 2008-09-25 | Paper |
| Computing a minimum-dilation spanning tree is NP-hard | 2008-09-19 | Paper |
| Sparse geometric graphs with small dilation | 2008-06-18 | Paper |
| PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING | 2008-05-14 | Paper |
| Helly-type theorems for line transversals to disjoint unit balls | 2008-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5452284 | 2008-03-25 | Paper |
| Throwing Stones Inside Simple Polygons | 2008-01-04 | Paper |
| Finding a guard that sees most and a shop that sells most | 2007-06-21 | Paper |
| The Hadwiger number of Jordan regions is unbounded | 2007-06-21 | Paper |
| Maximizing the overlap of two planar convex sets under rigid motions | 2007-03-15 | Paper |
| Area-preserving approximations of polygonal paths | 2007-02-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Casting with skewed ejection direction | 2006-08-16 | Paper |
| Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets | 2006-04-28 | Paper |
| THE REFLEX-FREE HULL | 2005-12-09 | Paper |
| The Voronoi diagram of curved objects | 2005-11-10 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY | 2005-06-10 | Paper |
| Geometric permutations of disjoint unit spheres | 2005-05-12 | Paper |
| Optimal spanners for axis-aligned rectangles | 2005-02-09 | Paper |
| Hierarchical decompositions and circular ray shooting in simple polygons | 2005-01-25 | Paper |
| Competitive facility location: the Voronoi game | 2004-10-27 | Paper |
| The one-round Voronoi game | 2004-03-11 | Paper |
| Spanning trees crossing few barriers | 2004-02-05 | Paper |
| On simplifying dot maps. | 2004-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425962 | 2003-09-14 | Paper |
| Casting a polyhedron with directional uncertainty | 2003-08-25 | Paper |
| Computing farthest neighbors on a convex polytope. | 2003-08-17 | Paper |
| Building bridges between convex regions | 2003-05-19 | Paper |
| Voronoi diagrams on the sphere | 2003-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553235 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551357 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753947 | 2001-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761861 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4947407 | 2000-04-18 | Paper |
| Computing the maximum overlap of two convex polygons under translations | 1998-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401024 | 1998-08-02 | Paper |
| Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces | 1998-07-27 | Paper |
| Approximation of convex figures by pairs of rectangles | 1998-06-08 | Paper |
| Computing Many Faces in Arrangements of Lines and Segments | 1998-05-10 | Paper |
| Constructing Levels in Arrangements and Higher Order Voronoi Diagrams | 1998-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344150 | 1997-07-14 | Paper |
| Reaching a goal with directional uncertainty | 1997-02-28 | Paper |
| Range searching in low-density environments | 1997-02-27 | Paper |
| Point location in zones of \(k\)-flats in arrangements | 1996-07-14 | Paper |
| A deterministic algorithm for the three-dimensional diameter problem | 1996-07-14 | Paper |
| The overlay of lower envelopes and its applications | 1996-06-27 | Paper |
| Bounds on the size of merging networks | 1996-03-18 | Paper |
| CUTTINGS AND APPLICATIONS | 1996-02-01 | Paper |
| On lazy randomized incremental construction | 1995-11-29 | Paper |
| Piecewise linear paths among convex obstacles | 1995-08-01 | Paper |
| Computing and Verifying Depth Orders | 1994-05-10 | Paper |
| A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS | 1993-10-17 | Paper |
| On ray shooting in convex polytopes | 1993-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023736 | 1993-01-23 | Paper |
| Parallel computation of distance transforms | 1992-06-25 | Paper |
| Euclidean minimum spanning trees and bichromatic closest pairs | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355263 | 1990-01-01 | Paper |
