| Publication | Date of Publication | Type |
|---|
| Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons | 2021-01-12 | Paper |
| Placing your Coins on a Shelf | 2020-11-25 | Paper |
| Middle curves based on discrete Fréchet distance | 2020-10-23 | Paper |
| Packing 2D disks into a 3D container | 2019-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967203 | 2019-07-03 | Paper |
| Placing your Coins on a Shelf | 2019-02-27 | Paper |
| Approximating Smallest Containers for Packing Three-Dimensional Convex Objects | 2018-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636493 | 2018-04-19 | Paper |
| Minimum Cell Connection in Line Segment Arrangements | 2018-01-31 | Paper |
| Matching convex shapes with respect to the symmetric difference | 2017-12-05 | Paper |
| The complexity of (un)folding | 2017-09-29 | Paper |
| Exact L ∞ nearest neighbor search in high dimensions | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2970472 | 2017-03-30 | Paper |
| A Middle Curve Based on Discrete Fréchet Distance | 2016-05-03 | Paper |
| Thoughts on Barnette's conjecture | 2016-04-18 | Paper |
| Bundling three convex polygons to minimize area or perimeter | 2016-01-18 | Paper |
| Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons | 2015-11-19 | Paper |
| Scandinavian thins on top of cake: new and improved algorithms for stacking and packing | 2015-01-21 | Paper |
| Bundling Three Convex Polygons to Minimize Area or Perimeter | 2013-08-12 | Paper |
| Shape matching by random sampling | 2012-08-08 | Paper |
| Can we compute the similarity between surfaces? | 2010-02-23 | Paper |
| Probabilistic matching of planar regions | 2009-11-16 | Paper |
| The Computational Geometry of Comparing Shapes | 2009-11-12 | Paper |
| Wooden geometric puzzles: Design and hardness proofs | 2009-08-06 | Paper |
| CONSTRUCTING OPTIMAL HIGHWAYS | 2009-04-14 | Paper |
| Shape Matching by Random Sampling | 2009-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601572 | 2009-02-10 | Paper |
| COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS | 2008-09-29 | Paper |
| Wooden Geometric Puzzles: Design and Hardness Proofs | 2007-11-15 | Paper |
| The Voronoi diagram of curved objects | 2005-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692692 | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657574 | 2005-03-14 | Paper |
| Comparison of distance measures for planar curves | 2004-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471348 | 2004-07-28 | Paper |
| Matching planar maps | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945503 | 2002-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547792 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542174 | 2002-08-01 | Paper |
| Computer graphics | 2002-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762787 | 2002-01-09 | Paper |
| A class of point-sets with few \(k\)-sets | 2000-09-04 | Paper |
| On the Number of Simple Cycles in Planar Graphs | 2000-05-08 | Paper |
| Matching convex shapes with respect to the symmetric difference | 1998-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373666 | 1998-05-04 | Paper |
| Universal 3-dimensional visibility representations for graphs | 1998-04-13 | Paper |
| Matching Shapes with a Reference Point | 1998-03-16 | Paper |
| A method for obtaining randomized algorithms with small tail probabilities | 1997-03-03 | Paper |
| Approximate matching of polygonal shapes | 1996-10-20 | Paper |
| COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES | 1996-02-26 | Paper |
| An application of point pattern matching in astronautics | 1994-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038728 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028900 | 1993-03-28 | Paper |
| Approximate motion planning and the complexity of the boundary of the union of simple geometric figures | 1993-01-17 | Paper |
| A lower bound for the nondeterministic space complexity of context-free recognition | 1993-01-16 | Paper |
| Congruence, similarity, and symmetries of geometric objects | 1988-01-01 | Paper |
| Visibility graphs and obstacle-avoiding shortest paths | 1988-01-01 | Paper |
| A Lower Bound on the Complexity of the Union-Split-Find Problem | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3823825 | 1988-01-01 | Paper |
| Comparing the combinational complexities of arithmetic functions | 1988-01-01 | Paper |
| Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3774943 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4727434 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3767281 | 1986-01-01 | Paper |
| Searching Semisorted Tables | 1985-01-01 | Paper |
| Multiplication is the easiest nontrivial arithmetic function | 1985-01-01 | Paper |
| Partial match retrieval in implicit data structures | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3917501 | 1981-01-01 | Paper |
| The complexity of basic complex operations | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3891763 | 1980-01-01 | Paper |
| Lower bounds on space complexity for contextfree recognition | 1979-01-01 | Paper |
| Square rooting is as difficult as multiplication | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206313 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3854627 | 1979-01-01 | Paper |
| Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4144808 | 1976-01-01 | Paper |
