| Publication | Date of Publication | Type |
|---|
| Reconfiguration of polygonal subdivisions via recombination | 2025-01-06 | Paper |
| Reconfiguration of connected graph partitions | 2023-10-05 | Paper |
| Reconfiguration of connected graph partitions via recombination | 2023-03-22 | Paper |
| Combinatorial complexity of signed discs | 2023-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088936 | 2022-07-18 | Paper |
| Reconfiguration of connected graph partitions via recombination | 2022-06-13 | Paper |
| Circumscribing polygons and polygonizations for disjoint line segments | 2022-06-03 | Paper |
| Minimum weight connectivity augmentation for planar straight-line graphs | 2019-09-10 | Paper |
| Planar minimally rigid graphs and pseudo-triangulations | 2017-09-29 | Paper |
| Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs | 2017-05-05 | Paper |
| The Flip Diameter of Rectangulations and Convex Subdivisions | 2017-03-03 | Paper |
| Algorithms for Designing Pop-Up Cards | 2017-01-30 | Paper |
| Diffuse reflection diameter in simple polygons | 2016-06-22 | Paper |
| Bichromatic compatible matchings | 2015-07-27 | Paper |
| Isoperimetric enclosures | 2015-05-22 | Paper |
| Bichromatic compatible matchings | 2015-02-17 | Paper |
| The Flip Diameter of Rectangulations and Convex Subdivisions | 2014-03-31 | Paper |
| Disjoint compatible geometric matchings | 2014-03-24 | Paper |
| Constrained Tri-Connected Planar Straight Line Graphs | 2013-09-25 | Paper |
| Compatible Geometric Matchings | 2013-06-28 | Paper |
| Coverage with \(k\)-transmitters in the presence of obstacles | 2013-03-25 | Paper |
| Disjoint compatible geometric matchings | 2013-03-18 | Paper |
| Simultaneously Flippable Edges in Triangulations | 2013-01-07 | Paper |
| Bounded-degree polyhedronization of point sets | 2012-12-04 | Paper |
| Augmenting the edge connectivity of planar straight line graphs to three | 2011-12-14 | Paper |
| Coverage with k-Transmitters in the Presence of Obstacles | 2011-01-10 | Paper |
| Cuttings for disks and axis-aligned rectangles in three-space | 2010-03-04 | Paper |
| Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs | 2009-12-17 | Paper |
| Compatible geometric matchings | 2009-07-27 | Paper |
| A vertex-face assignment for plane graphs | 2009-06-18 | Paper |
| Topological sweep of the complete graph | 2009-03-04 | Paper |
| Cuttings for Disks and Axis-Aligned Rectangles | 2009-02-17 | Paper |
| Tight bounds for connecting sites across barriers | 2009-02-10 | Paper |
| Deflating the Pentagon | 2009-01-13 | Paper |
| Tight bounds for connecting sites across barriers | 2008-12-02 | Paper |
| Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues | 2008-09-02 | Paper |
| Testing simple polygons. | 2008-04-25 | Paper |
| Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues | 2008-04-04 | Paper |
| Efficient many-to-Many point matching in one dimension | 2007-07-19 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5290310 | 2006-04-28 | Paper |
| Planar minimally rigid graphs and pseudo-triangulations | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707797 | 2003-06-11 | Paper |
| Fast implementation of depth contours using topological sweep | 2002-03-24 | Paper |
| The Floodlight Problem | 1997-07-27 | Paper |
| Combinatorial complexity of signed discs | 1996-11-10 | Paper |
| An efficient algorithm for guard placement in polygons with holes | 1995-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138983 | 1993-10-20 | Paper |
| On compatible triangulations of simple polygons | 1993-08-23 | Paper |
| Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions | 1992-12-14 | Paper |
| Detecting the intersection of convex objects in the plane | 1992-06-28 | Paper |
| Computing Least Median of Squares Regression Lines and Guided Topological Sweep | 1990-01-01 | Paper |
| Computational geometry in a curved world | 1990-01-01 | Paper |
| Decomposition and intersection of simple splinegons | 1988-01-01 | Paper |
| Time- and Space-Efficient Algorithms for Least Median of Squares Regression | 1987-01-01 | Paper |
