| Publication | Date of Publication | Type |
|---|
| The centroid of points with approximate weights | 2023-05-08 | Paper |
| Parallel construction of quadtrees and quality triangulations | 2023-01-18 | Paper |
| Multivariate regression depth | 2017-09-29 | Paper |
| Optimized color gamuts for tiled displays | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501831 | 2015-08-14 | Paper |
| On-line algorithms for cache sharing | 2015-05-07 | Paper |
| Origami embedding of piecewise-linear two-manifolds | 2011-03-02 | Paper |
| SecLEACH-on the security of clustered sensor networks | 2010-05-19 | Paper |
| Origami Embedding of Piecewise-Linear Two-Manifolds | 2008-04-15 | Paper |
| Research in Computational Molecular Biology | 2005-11-23 | Paper |
| QUADRILATERAL MESHING BY CIRCLE PACKING | 2005-06-10 | Paper |
| PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS | 2005-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471285 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4416718 | 2003-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778539 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778547 | 2002-11-18 | Paper |
| Multivariate regression depth | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945506 | 2002-10-23 | Paper |
| Algorithms for coloring quadtrees | 2002-10-23 | Paper |
| Computing the depth of a flat | 2002-07-22 | Paper |
| Secure notarization of paper text documents | 2002-01-30 | Paper |
| Surface reconstruction by Voronoi filtering | 2000-06-27 | Paper |
| Regression depth and center points. | 2000-01-01 | Paper |
| Pushing disks together -- The continuous-motion case | 1999-10-06 | Paper |
| Optimal Point Placement for Mesh Smoothing | 1999-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228461 | 1999-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401012 | 1998-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886048 | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875182 | 1996-06-16 | Paper |
| TRIANGULATING POLYGONS WITHOUT LARGE ANGLES | 1995-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327374 | 1995-04-05 | Paper |
| Provably good mesh generation | 1994-11-01 | Paper |
| On the number of minimal 1-Steiner trees | 1994-08-10 | Paper |
| Visibility with a moving point of view | 1994-05-05 | Paper |
| On-line algorithms for locating checkpoints | 1994-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138884 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036603 | 1993-05-18 | Paper |
| Approximate closest-point queries in high dimensions | 1993-05-16 | Paper |
| Fast geometric approximation techniques and geometric embedding problems | 1993-04-22 | Paper |
| POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS | 1993-04-01 | Paper |
| Drawing the planar dual | 1993-01-16 | Paper |
| Polynomially solvable special cases of the Steiner problem in planar networks | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359791 | 1991-01-01 | Paper |
| THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION | 1991-01-01 | Paper |
| Hidden surface removal for rectangles | 1990-01-01 | Paper |
| Faster exact algorithms for steiner trees in planar networks | 1990-01-01 | Paper |
| The Steiner problem with edge lengths 1 and 2 | 1989-01-01 | Paper |
| Two probabilistic results on rectilinear Steiner trees | 1988-01-01 | Paper |
| Linear-time computation of optimal subgraphs of decomposable graphs | 1987-01-01 | Paper |
| Bounds on the convex label number of trees | 1987-01-01 | Paper |
