| 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
(available as arXiv preprint) | 2020-11-25 | Paper |
Middle curves based on discrete Fréchet distance
Computational Geometry | 2020-10-23 | Paper |
Packing 2D disks into a 3D container
(available as arXiv preprint) | 2019-10-15 | Paper |
| Computational aspects of packing problems | 2019-07-03 | Paper |
Placing your coins on a shelf
(available as arXiv preprint) | 2019-02-27 | Paper |
Approximating Smallest Containers for Packing Three-Dimensional Convex Objects
International Journal of Computational Geometry & Applications | 2018-08-02 | Paper |
| scientific article; zbMATH DE number 6861944 (Why is no real title available?) | 2018-04-19 | Paper |
Minimum Cell Connection in Line Segment Arrangements
International Journal of Computational Geometry & Applications | 2018-01-31 | Paper |
Matching convex shapes with respect to the symmetric difference
Algorithms — ESA '96 | 2017-12-05 | Paper |
The complexity of (un)folding
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Exact \(L_{\infty}\) nearest neighbor search in high dimensions
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
| scientific article; zbMATH DE number 6698326 (Why is no real title available?) | 2017-03-30 | Paper |
A middle curve based on discrete Fréchet distance
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Thoughts on Barnette's conjecture
The Australasian Journal of Combinatorics | 2016-04-18 | Paper |
Thoughts on Barnette's conjecture
The Australasian Journal of Combinatorics | 2016-04-18 | Paper |
Bundling three convex polygons to minimize area or perimeter
Computational Geometry | 2016-01-18 | Paper |
Approximating minimum-area rectangular and convex containers for packing convex polygons
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
Theory of Computing Systems | 2015-01-21 | Paper |
Bundling three convex polygons to minimize area or perimeter
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Shape matching by random sampling
Theoretical Computer Science | 2012-08-08 | Paper |
Can we compute the similarity between surfaces?
Discrete & Computational Geometry | 2010-02-23 | Paper |
Probabilistic matching of planar regions
Computational Geometry | 2009-11-16 | Paper |
The Computational Geometry of Comparing Shapes
Lecture Notes in Computer Science | 2009-11-12 | Paper |
Wooden geometric puzzles: Design and hardness proofs
Theory of Computing Systems | 2009-08-06 | Paper |
CONSTRUCTING OPTIMAL HIGHWAYS
International Journal of Foundations of Computer Science | 2009-04-14 | Paper |
Shape Matching by Random Sampling
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
| Minimum-cost coverage of point sets by disks | 2009-02-10 | Paper |
COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS
International Journal of Computational Geometry & Applications | 2008-09-29 | Paper |
Wooden Geometric Puzzles: Design and Hardness Proofs
Lecture Notes in Computer Science | 2007-11-15 | Paper |
The Voronoi diagram of curved objects
Discrete & Computational Geometry | 2005-11-10 | Paper |
| scientific article; zbMATH DE number 2209711 (Why is no real title available?) | 2005-09-28 | Paper |
| scientific article; zbMATH DE number 2145225 (Why is no real title available?) | 2005-03-14 | Paper |
Comparison of distance measures for planar curves
Algorithmica | 2004-12-02 | Paper |
| scientific article; zbMATH DE number 2079389 (Why is no real title available?) | 2004-07-28 | Paper |
Matching planar maps
Journal of Algorithms | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1424291 (Why is no real title available?) | 2002-10-24 | Paper |
| scientific article; zbMATH DE number 1786500 (Why is no real title available?) | 2002-08-21 | Paper |
| scientific article; zbMATH DE number 1775048 (Why is no real title available?) | 2002-08-01 | Paper |
| Computer graphics | 2002-04-21 | Paper |
| scientific article; zbMATH DE number 1689042 (Why is no real title available?) | 2002-01-09 | Paper |
A class of point-sets with few \(k\)-sets
Computational Geometry | 2000-09-04 | Paper |
On the Number of Simple Cycles in Planar Graphs
Combinatorics, Probability and Computing | 2000-05-08 | Paper |
Matching convex shapes with respect to the symmetric difference
Algorithmica | 1998-05-24 | Paper |
| scientific article; zbMATH DE number 1107718 (Why is no real title available?) | 1998-05-04 | Paper |
Universal 3-dimensional visibility representations for graphs
Computational Geometry | 1998-04-13 | Paper |
Matching Shapes with a Reference Point
International Journal of Computational Geometry & Applications | 1998-03-16 | Paper |
A method for obtaining randomized algorithms with small tail probabilities
Algorithmica | 1997-03-03 | Paper |
Approximate matching of polygonal shapes
Annals of Mathematics and Artificial Intelligence | 1996-10-20 | Paper |
COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
International Journal of Computational Geometry & Applications | 1996-02-26 | Paper |
An application of point pattern matching in astronautics
Journal of Symbolic Computation | 1994-10-10 | Paper |
| scientific article; zbMATH DE number 177850 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 140482 (Why is no real title available?) | 1993-03-28 | Paper |
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
Algorithmica | 1993-01-17 | Paper |
A lower bound for the nondeterministic space complexity of context-free recognition
Information Processing Letters | 1993-01-16 | Paper |
Congruence, similarity, and symmetries of geometric objects
Discrete & Computational Geometry | 1988-01-01 | Paper |
Visibility graphs and obstacle-avoiding shortest paths
Zeitschrift für Operations Research | 1988-01-01 | Paper |
A Lower Bound on the Complexity of the Union-Split-Find Problem
SIAM Journal on Computing | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4098747 (Why is no real title available?) | 1988-01-01 | Paper |
Comparing the combinational complexities of arithmetic functions
Journal of the ACM | 1988-01-01 | Paper |
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
SIAM Journal on Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4035134 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4001488 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4025358 (Why is no real title available?) | 1986-01-01 | Paper |
Searching Semisorted Tables
SIAM Journal on Computing | 1985-01-01 | Paper |
Multiplication is the easiest nontrivial arithmetic function
Theoretical Computer Science | 1985-01-01 | Paper |
Partial match retrieval in implicit data structures
Information Processing Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3729460 (Why is no real title available?) | 1981-01-01 | Paper |
The complexity of basic complex operations
Computing | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3698378 (Why is no real title available?) | 1980-01-01 | Paper |
Lower bounds on space complexity for contextfree recognition
Acta Informatica | 1979-01-01 | Paper |
Square rooting is as difficult as multiplication
Computing | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3648118 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3655354 (Why is no real title available?) | 1979-01-01 | Paper |
Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen
Lecture Notes in Computer Science | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3575000 (Why is no real title available?) | 1976-01-01 | Paper |
