| Publication | Date of Publication | Type |
|---|
| Largest unit rectangles inscribed in a convex polygon | 2024-11-15 | Paper |
| Inscribing or circumscribing a histogon to a convex polygon | 2024-09-12 | Paper |
| Uniformly monotone partitioning of polygons | 2024-08-27 | Paper |
| A linear-time algorithm for the center problem in weighted cycle graphs | 2024-06-07 | Paper |
| Minimum-width double-slabs and widest empty slabs in high dimensions | 2024-05-31 | Paper |
| Farthest-point Voronoi diagrams in the presence of rectangular obstacles | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6146247 | 2024-02-05 | Paper |
| Efficient \(k\)-center algorithms for planar points in convex position | 2024-01-16 | Paper |
| Universal convex covering problems under translations and discrete rotations | 2023-11-06 | Paper |
| Farthest-point Voronoi diagrams in the presence of rectangular obstacles | 2023-08-17 | Paper |
| Special issue on algorithms and computation (ISAAC 2021) | 2023-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875644 | 2023-02-03 | Paper |
| Intersecting disks using two congruent disks | 2023-01-09 | Paper |
| Rectangular partitions of a rectilinear polygon | 2023-01-09 | Paper |
| Covering convex polygons by two congruent disks | 2022-11-16 | Paper |
| Shortest rectilinear path queries to rectangles in a rectangular domain | 2022-10-13 | Paper |
| Rearranging a sequence of points onto a line | 2022-06-13 | Paper |
| Minimum-link shortest paths for polygons amidst rectilinear obstacles | 2022-04-08 | Paper |
| Intersecting disks using two congruent disks | 2022-03-22 | Paper |
| Covering convex polygons by two congruent disks | 2022-03-22 | Paper |
| Shortest rectilinear path queries to rectangles in a rectangular domain | 2021-12-15 | Paper |
| Maximizing dominance in the plane and its applications | 2021-11-19 | Paper |
| Efficient planar two-center algorithms | 2021-09-17 | Paper |
| Largest triangles in a polygon | 2021-09-17 | Paper |
| Maximum-area and maximum-perimeter rectangles in polygons | 2021-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136282 | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136281 | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136216 | 2020-11-25 | Paper |
| Middle curves based on discrete Fréchet distance | 2020-10-23 | Paper |
| On Romeo and Juliet Problems: Minimizing Distance-to-Sight. | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116523 | 2020-08-18 | Paper |
| Approximate Range Queries for Clustering | 2020-08-18 | Paper |
| Finding pairwise intersections of rectangles in a query rectangle | 2020-04-29 | Paper |
| The geodesic farthest-point Voronoi diagram in a simple polygon | 2020-04-01 | Paper |
| Voronoi diagrams for a moderate-sized point-set in a simple polygon | 2020-01-31 | Paper |
| Maximizing dominance in the plane and its applications | 2020-01-16 | Paper |
| Computing a geodesic two-center of points in a simple polygon | 2019-10-25 | Paper |
| Assigning weights to minimize the covering radius in the plane | 2019-10-25 | Paper |
| On Romeo and Juliet problems: minimizing distance-to-sight | 2019-10-25 | Paper |
| Faster algorithms for growing prioritized disks and rectangles | 2019-10-18 | Paper |
| Computing the center region and its variants | 2019-09-10 | Paper |
| A new balanced subdivision of a simple polygon for time-space trade-off algorithms | 2019-05-21 | Paper |
| Minimum-width annulus with outliers: circular, square, and rectangular cases | 2019-03-11 | Paper |
| The minimum convex container of two convex polytopes under translations | 2018-11-19 | Paper |
| The geodesic 2-center problem in a simple polygon | 2018-10-31 | Paper |
| Polygon queries for convex hulls of points | 2018-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580129 | 2018-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580128 | 2018-08-13 | Paper |
| Minimum-width square annulus intersecting polygons | 2018-06-15 | Paper |
| Minimum-width annulus with outliers: circular, square, and rectangular cases | 2018-06-15 | Paper |
| A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree | 2018-04-19 | Paper |
| Assigning Weights to Minimize the Covering Radius in the Plane | 2018-04-19 | Paper |
| Geometric matching algorithms for two realistic terrains | 2018-02-09 | Paper |
| The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon | 2018-01-30 | Paper |
| A time-space trade-off for triangulations of points in the plane | 2017-10-23 | Paper |
| Maximizing the overlap of two planar convex sets under rigid motions | 2017-10-20 | Paper |
| Constrained Geodesic Centers of a Simple Polygon | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368689 | 2017-10-10 | Paper |
| Reachability by paths of bounded curvature in convex polygons | 2017-09-29 | Paper |
| Realistic roofs without local minimum edges over a rectilinear polygon | 2017-05-12 | Paper |
| Computing the center region and its variants | 2017-05-05 | Paper |
| Bundling Two Simple Polygons to Minimize Their Convex Hull | 2017-05-05 | Paper |
| Top-\(k\) Manhattan spatial skyline queries | 2017-04-20 | Paper |
| Overlap of Convex Polytopes under Rigid Motion | 2017-01-26 | Paper |
| A linear-time algorithm for the geodesic center of a simple polygon | 2016-12-20 | Paper |
| Computing a geodesic two-center of points in a simple polygon | 2016-05-03 | Paper |
| A Middle Curve Based on Discrete Fréchet Distance | 2016-05-03 | Paper |
| Bundling three convex polygons to minimize area or perimeter | 2016-01-18 | Paper |
| An improved data stream algorithm for clustering | 2016-01-15 | Paper |
| Geometric Matching Algorithms for Two Realistic Terrains | 2016-01-11 | Paper |
| The 2-Center Problem in a Simple Polygon | 2016-01-11 | Paper |
| Group nearest-neighbor queries in the \(L_1\) plane | 2015-10-08 | Paper |
| COMPUTING k CENTERS OVER STREAMING DATA FOR SMALL k | 2015-01-23 | Paper |
| A generalization of the convex Kakeya problem | 2015-01-19 | Paper |
| An Improved Data Stream Algorithm for Clustering | 2014-03-31 | Paper |
| Top-k Manhattan Spatial Skyline Queries | 2014-02-18 | Paper |
| Overlap of convex polytopes under rigid motion | 2014-01-08 | Paper |
| Realistic roofs over a rectilinear polygon | 2013-09-03 | Paper |
| Bundling Three Convex Polygons to Minimize Area or Perimeter | 2013-08-12 | Paper |
| Group Nearest Neighbor Queries in the L 1 Plane | 2013-05-28 | Paper |
| Rectilinear Covering for Imprecise Input Points | 2013-03-21 | Paper |
| Computing k-center over Streaming Data for Small k | 2013-03-21 | Paper |
| Maximum overlap of convex polytopes under translation | 2013-03-12 | Paper |
| Covering and piercing disks with two centers | 2013-01-25 | Paper |
| COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT | 2012-11-23 | 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 |
| Empty pseudo-triangles in point sets | 2012-03-19 | Paper |
| Generating Realistic Roofs over a Rectilinear Polygon | 2011-12-16 | Paper |
| Covering and Piercing Disks with Two Centers | 2011-12-16 | Paper |
| MSSQ: Manhattan Spatial Skyline Queries | 2011-08-25 | Paper |
| COVERING A POINT SET BY TWO DISJOINT RECTANGLES | 2011-08-23 | Paper |
| Covering points by disjoint boxes with outliers | 2011-01-21 | Paper |
| Computing the discrete Fréchet distance with imprecise input | 2010-12-09 | Paper |
| Maximum overlap of convex polytopes under translation | 2010-12-09 | Paper |
| Adaptive algorithms for planar convex hull problems | 2010-09-07 | Paper |
| Covering a simple polygon by monotone directions | 2010-03-11 | Paper |
| Computing minimum-area rectilinear convex hull and \(L\)-shape | 2009-08-14 | Paper |
| Square and Rectangle Covering with Outliers | 2009-07-14 | Paper |
| Casting an object with a core | 2009-06-16 | Paper |
| CONSTRUCTING OPTIMAL HIGHWAYS | 2009-04-14 | Paper |
| Aperture-angle and Hausdorff-approximation of convex figures | 2009-02-12 | Paper |
| On the minimum total length of interval systems expressing all intervals, and range-restricted queries | 2009-02-12 | Paper |
| Covering a Point Set by Two Disjoint Rectangles | 2009-01-29 | Paper |
| Covering a Simple Polygon by Monotone Directions | 2009-01-29 | Paper |
| Aperture-angle and Hausdorff-approximation of convex figures | 2008-12-02 | Paper |
| Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations | 2008-05-27 | Paper |
| Maximum overlap and minimum convex hull of two convex polyhedra under translations | 2008-04-28 | Paper |
| Maximizing the overlap of two planar convex sets under rigid motions | 2007-03-15 | 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 |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Competitive facility location: the Voronoi game | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425962 | 2003-09-14 | Paper |
| Casting a polyhedron with directional uncertainty | 2003-08-25 | Paper |
| Building bridges between convex regions | 2003-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553235 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525052 | 2001-12-12 | Paper |
