| Publication | Date of Publication | Type |
|---|
| Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design | 2024-06-21 | Paper |
| Further results on generalized intersection searching problems: Counting, reporting, and dynamization | 2023-01-18 | Paper |
| Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining | 2022-12-16 | Paper |
| On intersection searching problems involving curved objects | 2022-12-09 | Paper |
| On some geometric optimization problems in layered manufacturing | 2022-08-19 | Paper |
| Searching for the closest-pair in a query translate | 2022-07-18 | Paper |
| New bounds for range closest-pair problems | 2022-06-03 | Paper |
| Searching for the closest-pair in a query translate | 2021-03-17 | Paper |
| Approximate range closest-pair queries | 2020-10-23 | Paper |
| New Bounds for Range Closest-Pair Problems | 2020-08-18 | Paper |
| The most-likely skyline problem for stochastic points | 2020-03-23 | Paper |
| On the expected diameter, width, and complexity of a stochastic convex hull | 2019-10-25 | Paper |
| On the separability of stochastic geometric objects, with applications | 2018-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643897 | 2018-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132898 | 2018-01-30 | Paper |
| On the expected diameter, width, and complexity of a stochastic convex hull | 2017-09-22 | Paper |
| On the arrangement of stochastic lines in \(\mathbb{R}^2\) | 2017-07-13 | Paper |
| Efficient algorithms for counting and reporting pairwise intersections between convex polygons | 2016-06-16 | Paper |
| A technique for adding range restrictions to generalized searching problems | 2016-06-09 | Paper |
| Range search on tuples of points | 2015-02-13 | Paper |
| Data structures for range-aggregate extent queries | 2014-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4914756 | 2013-04-15 | Paper |
| Efficient Top-k Queries for Orthogonal Ranges | 2011-02-20 | Paper |
| EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA | 2010-02-12 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| A memetic algorithm to schedule planned maintenance for the national grid | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808658 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789805 | 2003-05-01 | Paper |
| A decomposition-based approach to layered manufacturing | 2003-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778573 | 2002-11-18 | Paper |
| Computing An Optimal Hatching Direction In Layered Manufacturing | 2002-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779377 | 2002-04-15 | Paper |
| ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934236 | 2000-01-17 | Paper |
| Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design | 2000-01-04 | Paper |
| On some geometric optimization problems in layered manufacturing | 1999-09-22 | Paper |
| Minimizing support structures and trapped area in two-dimensional layered manufacturing | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3837772 | 1999-03-02 | Paper |
| The Rectangle Enclosure and Point-Dominance Problems Revisited | 1997-10-30 | Paper |
| Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining | 1996-12-17 | Paper |
| Fast algorithms for collision and proximity problems involving moving geometric objects | 1996-12-08 | Paper |
| Algorithms for generalized halfspace range searching and other intersection searching problems | 1996-11-04 | Paper |
| Algorithms for generalized halfspace range searching and other intersection searching problems | 1996-11-04 | Paper |
| Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization | 1996-05-28 | Paper |
| ON MAINTAINING THE WIDTH AND DIAMETER OF A PLANAR POINT-SET ONLINE | 1995-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138880 | 1994-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138933 | 1993-10-20 | Paper |
| GENERALIZED INTERSECTION SEARCHING PROBLEMS | 1993-08-22 | Paper |
| Algorithms for ray-shooting and intersection searching | 1993-01-12 | Paper |
| New Results on Dynamic Planar Point Location | 1992-12-06 | Paper |
| Efficient distributed algorithms for single-source shortest paths and related problems on plane networks | 1992-09-26 | Paper |
| On the dynamic maintenance of maximal points in the plane | 1992-06-28 | Paper |
| Efficient maintenance of the union of intervals on a line, with applications | 1991-01-01 | Paper |
| Space-Efficient Message Routing inc-Decomposable Networks | 1990-01-01 | Paper |
| Efficient dynamic algorithms for some geometric intersection problems | 1990-01-01 | Paper |
| Efficient Message Routing in Planar Networks | 1989-01-01 | Paper |
| Designing networks with compact routing tables | 1988-01-01 | Paper |
| Space-efficient and fault-tolerant message routing in outerplanar networks | 1988-01-01 | Paper |
| A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem | 1983-01-01 | Paper |
