| Publication | Date of Publication | Type |
|---|
| Parallel algorithms for all minimum link paths and link center problems | 2022-12-09 | Paper |
| Hardness and approximation for the geodetic set problem in some graph classes | 2020-07-21 | Paper |
| On conflict-free chromatic guarding of simple polygons | 2020-05-13 | Paper |
| Drawing bipartite graphs in two layers with specified crossings | 2019-10-10 | Paper |
| Improved bounds for the conflict-free chromatic art gallery problem | 2018-04-23 | Paper |
| Two-layer drawings of bipartite graphs | 2018-01-18 | Paper |
| Approximability of guarding weak visibility polygons | 2017-06-19 | Paper |
| Mapping a Polygon with Holes Using a Compass | 2016-12-19 | Paper |
| Four-connected triangulations of planar point sets | 2015-06-26 | Paper |
| Some results on point visibility graphs | 2015-04-01 | Paper |
| Vertex Guarding in Weak Visibility Polygons | 2015-02-19 | Paper |
| Online algorithms for searching and exploration in the plane | 2014-10-24 | Paper |
| Mapping a polygon with holes using a compass | 2014-09-18 | Paper |
| Unsolved problems in visibility graphs of points, segments, and polygons | 2014-06-05 | Paper |
| Some results on point visibility graphs | 2014-02-18 | Paper |
| Packing and covering tetrahedra | 2013-11-29 | Paper |
| Approximation algorithms for art gallery problems in polygons | 2010-05-05 | Paper |
| Approximation Algorithms for Art Gallery Problems in Polygons and Terrains | 2010-02-09 | Paper |
| Algorithms for Computing Diffuse Reflection Paths in Polygons | 2009-02-24 | Paper |
| Triangulating with high connectivity. | 2008-04-25 | Paper |
| Visibility Algorithms in the Plane | 2008-02-22 | Paper |
| Computing the maximum clique in the visibility graph of a simple polygon | 2008-01-11 | Paper |
| Berge's theorem for the maximum charge problem | 2006-10-10 | Paper |
| A linear time algorithm to remove winding of a simple polygon | 2006-04-28 | Paper |
| An algorithm for computing a convex and simple path of bounded curvature in a simple polygon | 2002-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2783023 | 2002-07-02 | Paper |
| Characterizing LR-visibility polygons and related problems | 2001-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945520 | 2000-11-13 | Paper |
| Optimal on-line algorithms for walking with minimum number of turns in unknown streets | 1997-10-28 | Paper |
| On recognizing and characterizing visibility graphs of simple polygons | 1997-03-23 | Paper |
| A Note on Computing the Visibility Polygon from a Convex Chain | 1997-02-23 | Paper |
| -Algorithms for Minimum Link Path and Related Problems | 1996-05-28 | Paper |
| An algorithm for recognizing palm polygons | 1995-03-30 | Paper |
| Characterizing and recognizing weak visibility polygons | 1993-11-01 | Paper |
| An optimal parallel algorithm for computing furthest neighbors in a tree | 1993-04-01 | Paper |
| An Output-Sensitive Algorithm for Computing Visibility Graphs | 1992-06-26 | Paper |
| Computing the visibility polygon from a convex set and related problems | 1991-01-01 | Paper |
| An optimal algorithm for computing a minimum nested nonconvex polygon | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796748 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3814827 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817601 | 1988-01-01 | Paper |
| A linear time algorithm for computing the convex hull of an ordered crossing polygon | 1984-01-01 | Paper |
| A linear time algorithm for obtaining the convex hull of a simple polygon | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313274 | 1983-01-01 | Paper |
