| Publication | Date of Publication | Type |
|---|
| Algorithms for computing maximum cliques in hyperbolic random graphs | 2025-01-06 | Paper |
| Parameterized algorithm for the disjoint path problem on planar graphs: exponential in \(k^2\) and linear in \(n\) | 2024-05-14 | Paper |
| Faster algorithms for cycle hitting problems on disk graphs | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147553 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147554 | 2024-01-15 | Paper |
| Shortest-Path Queries in Geometric Networks | 2023-11-14 | Paper |
| Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces | 2023-06-26 | Paper |
| Reachability problems for transmission graphs | 2022-10-06 | Paper |
| Minimizing Distance-to-Sight in Polygonal Domains | 2022-07-21 | Paper |
| Point Location in Incremental Planar Subdivisions. | 2022-07-21 | Paper |
| Reachability problems for transmission graphs | 2022-03-25 | Paper |
| The maximum-level vertex in an arrangement of lines | 2022-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136216 | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136281 | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136282 | 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 |
| Approximate Range Queries for Clustering | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116523 | 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 |
| 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 |
| Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons | 2019-10-15 | 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 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 |
| 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 |
| Constrained Geodesic Centers of a Simple Polygon | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368689 | 2017-10-10 | Paper |
| Computing the center region and its variants | 2017-05-05 | 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 |
| The 2-Center Problem in a Simple Polygon | 2016-01-11 | Paper |
