| 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 |
| An optimal algorithm for the minimum-width cubic shell problem | 2024-06-17 | Paper |
| Maximum-width rainbow-bisecting empty annulus | 2024-06-06 | Paper |
| Minimum-width double-slabs and widest empty slabs in high dimensions | 2024-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059960 | 2023-11-02 | Paper |
| Empty squares in arbitrary orientation among points | 2023-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875586 | 2023-02-03 | Paper |
| Rearranging a sequence of points onto a line | 2022-06-13 | Paper |
| Faster counting empty convex polygons in a planar point set | 2021-12-14 | Paper |
| Maximum-width empty square and rectangular annulus | 2021-09-16 | Paper |
| The reverse Kakeya problem | 2021-04-20 | Paper |
| On the minimum-area rectangular and square annulus problem | 2021-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136224 | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136216 | 2020-11-25 | Paper |
| The Reverse Kakeya Problem | 2020-08-18 | Paper |
| Minimum-width double-strip and parallelogram annulus | 2020-08-03 | Paper |
| Computing a minimum-width cubic and hypercubic shell | 2020-02-10 | Paper |
| \(L_1\) geodesic farthest neighbors in a simple polygon and related problems | 2019-11-07 | Paper |
| Computing a geodesic two-center of points in a simple polygon | 2019-10-25 | Paper |
| Closest-pair queries in fat rectangles | 2019-10-25 | Paper |
| Area bounds of rectilinear polygons realized by angle sequences | 2019-10-25 | Paper |
| Tight bounds for beacon-based coverage in simple rectilinear polygons | 2019-10-18 | Paper |
| Faster algorithms for growing prioritized disks and rectangles | 2019-10-18 | Paper |
| Maximum-width empty square and rectangular annulus | 2019-10-15 | Paper |
| \(L_{1}\) shortest path queries in simple polygons | 2019-09-10 | Paper |
| Shortcuts for the circle | 2019-03-20 | Paper |
| Minimum-width annulus with outliers: circular, square, and rectangular cases | 2019-03-11 | Paper |
| Gap-Planar Graphs | 2019-02-20 | Paper |
| Computing the geodesic centers of a polygonal domain | 2018-11-19 | Paper |
| The minimum convex container of two convex polytopes under translations | 2018-11-19 | Paper |
| Computing a minimum-width square or rectangular annulus with outliers | 2018-11-16 | Paper |
| Gap-planar graphs | 2018-09-24 | Paper |
| Minimum-width annulus with outliers: circular, square, and rectangular cases | 2018-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636496 | 2018-04-19 | Paper |
| Covering points with convex sets of minimum size | 2018-03-16 | Paper |
| Computing a minimum-width square annulus in arbitrary orientation | 2018-03-16 | Paper |
| On finding a longest common palindromic subsequence | 2018-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132899 | 2018-01-30 | Paper |
| Computing the L1 Geodesic Diameter and Center of a Polygonal Domain | 2018-01-24 | Paper |
| The geodesic farthest-site Voronoi diagram in a polygonal domain with holes | 2017-10-20 | Paper |
| Efficient Flattening Algorithm for Hierarchical and Dynamic Structure Discrete Event Models | 2017-06-30 | Paper |
| Computing the \(L_1\) geodesic diameter and center of a polygonal domain | 2017-05-11 | Paper |
| Computing a Minimum-Width Square or Rectangular Annulus with Outliers | 2016-09-02 | Paper |
| An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments | 2016-05-17 | Paper |
| Computing a geodesic two-center of points in a simple polygon | 2016-05-03 | Paper |
| Computing a Minimum-Width Square Annulus in Arbitrary Orientation | 2016-05-03 | Paper |
| Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons | 2016-05-03 | Paper |
| Bundling three convex polygons to minimize area or perimeter | 2016-01-18 | Paper |
| Group nearest-neighbor queries in the \(L_1\) plane | 2015-10-08 | Paper |
| Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time | 2015-06-17 | Paper |
| Reprint of: Theta-3 is connected | 2015-04-27 | Paper |
| An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments | 2015-02-27 | Paper |
| A generalization of the convex Kakeya problem | 2015-01-19 | Paper |
| Theta-3 is connected | 2014-08-13 | Paper |
| Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments | 2014-06-27 | Paper |
| Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time | 2014-03-31 | Paper |
| The geodesic diameter of polygonal domains | 2013-09-23 | 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 |
| Area Bounds of Rectilinear Polygons Realized by Angle Sequences | 2013-03-21 | Paper |
| Rectilinear Covering for Imprecise Input Points | 2013-03-21 | Paper |
| THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS | 2012-11-23 | Paper |
| A generalization of the convex Kakeya problem | 2012-06-29 | Paper |
| Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments | 2012-06-08 | Paper |
| Farthest Voronoi Diagrams under Travel Time Metrics | 2012-06-08 | Paper |
| Querying two boundary points for shortest paths in a polygonal domain | 2012-05-18 | Paper |
| On exact solutions to the Euclidean bottleneck Steiner tree problem | 2012-03-19 | Paper |
| Empty pseudo-triangles in point sets | 2012-03-19 | Paper |
| Generating Realistic Roofs over a Rectilinear Polygon | 2011-12-16 | Paper |
| Exact algorithms for the bottleneck Steiner tree problem | 2011-12-14 | Paper |
| COVERING A POINT SET BY TWO DISJOINT RECTANGLES | 2011-08-23 | Paper |
| Covering points by disjoint boxes with outliers | 2011-01-21 | Paper |
| The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications | 2010-12-09 | Paper |
| The Geodesic Diameter of Polygonal Domains | 2010-09-06 | Paper |
| Geometric stable roommates | 2010-06-16 | Paper |
| Exact algorithms for the bottleneck Steiner tree problem (extended abstract) | 2009-12-17 | Paper |
| Querying two boundary points for shortest paths in a polygonal domain (extended abstract) | 2009-12-17 | Paper |
| Computing minimum-area rectilinear convex hull and \(L\)-shape | 2009-08-14 | Paper |
| Square and Rectangle Covering with Outliers | 2009-07-14 | Paper |
| OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM | 2009-06-30 | Paper |
| Casting an object with a core | 2009-06-16 | Paper |
| CONSTRUCTING OPTIMAL HIGHWAYS | 2009-04-14 | Paper |
| All Farthest Neighbors in the Presence of Highways and Obstacles | 2009-02-24 | Paper |
| On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem | 2009-02-24 | Paper |
| Aperture-angle and Hausdorff-approximation of convex figures | 2009-02-12 | Paper |
| Covering a Point Set by Two Disjoint Rectangles | 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 |
| Optimal Construction of the City Voronoi Diagram | 2008-04-24 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE | 2006-05-29 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
