| Publication | Date of Publication | Type |
|---|
| Guarding disjoint orthogonal polygons in the plane | 2023-03-21 | Paper |
| On geometric path query problems | 2022-08-19 | Paper |
| Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment | 2021-09-16 | Paper |
| New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision | 2021-08-11 | Paper |
| Trajectory planning for an articulated probe | 2020-10-23 | Paper |
| Two-dimensional closest pair problem: a closer look | 2020-10-14 | Paper |
| Altitude terrain guarding and guarding uni-monotone polygons | 2019-10-25 | Paper |
| Does a robot path have clearance C? | 2019-10-11 | Paper |
| Dynamic minimum bichromatic separating circle | 2019-06-25 | Paper |
| Guarding a terrain by two watchtowers | 2017-10-20 | Paper |
| Maintaining visibility of a polygon with a moving point of view | 2016-06-09 | Paper |
| Dynamic Minimum Bichromatic Separating Circle | 2016-02-05 | Paper |
| Algorithms for fair partitioning of convex polygons | 2015-12-11 | Paper |
| Algorithms for Fair Partitioning of Convex Polygons | 2015-09-11 | Paper |
| Largest area convex hull of imprecise data based on axis-aligned squares | 2013-12-09 | Paper |
| On some geometric problems of color-spanning sets | 2013-08-02 | Paper |
| Minimum-sum dipolar spanning tree in \(\mathbb R^3\) | 2012-09-21 | Paper |
| Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data | 2011-08-17 | Paper |
| Kinetic Red-Blue Minimum Separating Circle | 2011-08-12 | Paper |
| Line facility location in weighted regions | 2011-06-17 | Paper |
| NP-Completeness of Spreading Colored Points | 2011-01-08 | Paper |
| Guarding a terrain by two watchtowers | 2010-09-16 | Paper |
| Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\) | 2010-09-01 | Paper |
| FRÉCHET DISTANCE PROBLEMS IN WEIGHTED REGIONS | 2010-07-27 | Paper |
| An Experimental Study of Weighted k-Link Shortest Path Algorithms | 2010-06-02 | Paper |
| Visiting a Sequence of Points with a Bevel-Tip Needle | 2010-04-27 | Paper |
| Fréchet Distance Problems in Weighted Regions | 2009-12-17 | Paper |
| Towards an optimal algorithm for recognizing Laman graphs | 2009-10-21 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Line Segment Facility Location in Weighted Subdivisions | 2009-07-02 | Paper |
| Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications | 2009-05-20 | Paper |
| MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS | 2009-05-19 | Paper |
| A PTAS for cutting out polygons with lines | 2009-04-29 | Paper |
| Parallel Optimal Weighted Links | 2009-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601580 | 2009-02-10 | Paper |
| Computing Simple Paths on Points in Simple Polygons | 2009-01-13 | Paper |
| On Some City Guarding Problems | 2008-07-10 | Paper |
| Line Facility Location in Weighted Regions | 2008-07-10 | Paper |
| Farthest-Point Queries with Geometric and Combinatorial Constraints | 2008-03-18 | Paper |
| A PTAS for Cutting Out Polygons with Lines | 2007-09-10 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| CUTTING OUT POLYGONS WITH LINES AND RAYS | 2006-05-29 | Paper |
| Proximity problems on line segments spanned by points | 2006-04-28 | Paper |
| Farthest-point queries with geometric and combinatorial constraints | 2006-04-28 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Polygonal path simplification with angle constraints | 2005-11-01 | Paper |
| Extremal point queries with lines and line segments and related problems | 2005-11-01 | Paper |
| ON GEOMETRIC PATH QUERY PROBLEMS | 2005-06-10 | Paper |
| Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications | 2005-05-17 | Paper |
| Polygonal chain approximation: A query based approach | 2005-02-09 | Paper |
| New results on path approximation | 2004-12-02 | Paper |
| Finding an optimal path without growing the tree | 2004-10-01 | Paper |
| SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739329 | 2004-08-12 | Paper |
| Efficient parallel algorithms for planar \(st\)-graphs | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2783024 | 2002-07-02 | Paper |
| Efficiently approximating polygonal paths in three and higher dimensions | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768318 | 2002-01-30 | Paper |
| Determining an optimal penetration among weighted regions in two and three dimensions | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952691 | 2000-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252037 | 1999-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218406 | 1998-11-11 | Paper |
