Helmut Alt

According to our database1, Helmut Alt
  • authored at least 95 papers between 1976 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons.
JoCG, 2017

Placing your Coins on a Shelf.
CoRR, 2017

2016
Computational Aspects of Packing Problems.
Bulletin of the EATCS, 2016

Approximating Smallest Containers for Packing Three-dimensional Convex Objects.
CoRR, 2016

Bundling three convex polygons to minimize area or perimeter.
Comput. Geom., 2016

Thoughts on Barnette's Conjecture.
Australasian J. Combinatorics, 2016

A Middle Curve Based on Discrete Fréchet Distance.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Approximating Smallest Containers for Packing Three-Dimensional Convex Objects.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing.
Theory Comput. Syst., 2014

2013
Bundling Three Convex Polygons to Minimize Area or Perimeter.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012
Shape matching by random sampling.
Theor. Comput. Sci., 2012

Computation of the Hausdorff distance between sets of line segments in parallel
CoRR, 2012

2011
Minimum cell connection and separation in line segment arrangements
CoRR, 2011

Fast Sorting Algorithms.
Proceedings of the Algorithms Unplugged, 2011

2010
Can We Compute the Similarity between Surfaces?
Discrete & Computational Geometry, 2010

Probabilistic matching of planar regions.
Comput. Geom., 2010

2009
Wooden Geometric Puzzles: Design and Hardness Proofs.
Theory Comput. Syst., 2009

Constructing Optimal Highways.
Int. J. Found. Comput. Sci., 2009

Probabilistic Matching of Planar Regions
CoRR, 2009

Shape Matching by Random Sampling.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

09111 Abstracts Collection - Computational Geometry.
Proceedings of the Computational Geometry, 08.03. - 13.03.2009, 2009

The Computational Geometry of Comparing Shapes.
Proceedings of the Efficient Algorithms, 2009

2008
Schnelle Sortieralgorithmen.
Proceedings of the Taschenbuch der Algorithmen, 2008

Computing the Hausdorff Distance between Curved Objects.
Int. J. Comput. Geometry Appl., 2008

2007
Constructing Optimal Highways
CoRR, 2007

Can we Compute the Similarity Between Surfaces?
CoRR, 2007

Wooden Geometric Puzzles: Design and Hardness Proofs.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

Probabilistic matching and resemblance evaluation of shapes in trademark images.
Proceedings of the 6th ACM International Conference on Image and Video Retrieval, 2007

Constructing Optimal Highways.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2006
Minimum-cost coverage of point sets by disks.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Foreword.
Theory Comput. Syst., 2005

The Voronoi Diagram of Curved Objects.
Discrete & Computational Geometry, 2005

Semi-computability of the Fréchet distance between surfaces.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004
Comparison of Distance Measures for Planar Curves.
Algorithmica, 2004

2003
Matching planar maps.
J. Algorithms, 2003

Matching planar maps.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Finding a curve in a map.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

The complexity of (un)folding.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

On the worst-case complexity of the silhouette of a polytope.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2001
Matching Polygonal Curves with Respect to the Fréchet Distance.
Proceedings of the STACS 2001, 2001

Exact Linfty Nearest Neighbor Search in High Dimensions.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

The Nearest Neighbor.
Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

2000
A class of point-sets with few k-sets.
Comput. Geom., 2000

Packing Convex Polygons into Rectangular Boxes.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999
On The Number Of Simple Cycles In Planar Graphs.
Combinatorics, Probability & Computing, 1999

1998
Universal 3-dimensional visibility representations for graphs.
Comput. Geom., 1998

Matching Convex Shapes with Respect to the Symmetric Difference.
Algorithmica, 1998

Point-Sets with few k-Sets.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
Matching Shapes with a Reference Point.
Int. J. Comput. Geometry Appl., 1997

On the Number of Simple Cycles in Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Piecewise Linear Approximation of Bézier-Curves.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
Algorithmica, 1996

Matching Convex Shapes with Respect to the Symmetric Difference.
Proceedings of the Algorithms, 1996

1995
Computing the Fréchet distance between two polygonal curves.
Int. J. Comput. Geometry Appl., 1995

Approximate Matching of Polygonal Shapes.
Ann. Math. Artif. Intell., 1995

Universal 3-Dimensional Visibility Representations for Graphs.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

The Voronoi Diagram of Curved Objects.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Computing the largest inscribed isothetic rectangle.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
An Application of Point Pattern Matching in Astronautics.
J. Symb. Comput., 1994

Matching Shapes with a Reference Point.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1992
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition.
Inf. Process. Lett., 1992

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
Algorithmica, 1992

Resemblance and Symmetries of Geometric Patterns.
Proceedings of the Data Structures and Efficient Algorithms, 1992

Measuring the Resemblance of Polygonal Curves.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n).
Inf. Process. Lett., 1991

Approximate Matching of Polygonal Shapes (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
Approximation of Convex Polygons.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Motion Planning in the CL-Environment (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 1989

1988
A Lower Bound on the Complexity of the Union-Split-Find Problem.
SIAM J. Comput., 1988

Visibility graphs and obstacle-avoiding shortest paths.
ZOR - Meth. & Mod. of OR, 1988

Comparing the combinational complexities of arithmetic functions.
J. ACM, 1988

Approximation of Polygons by Rechtangles and Circles.
Bulletin of the EATCS, 1988

Congruence, Similarity, and Symmetries of Geometric Objects.
Discrete & Computational Geometry, 1988

1987
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones.
SIAM J. Comput., 1987

Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones.
Proceedings of the Parallel Algorithms and Architectures, 1987

A Lower Bound for the Complexity of the Union-Split-Find Problem.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Congruence, Similarity, and Symmetries of Geometric Objects.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985
Multiplication is the Easiest Nontrivial Arithmetic Function.
Theor. Comput. Sci., 1985

Searching Semisorted Tables.
SIAM J. Comput., 1985

1984
Partial Match Retrieval in Implicit Data Structures.
Inf. Process. Lett., 1984

Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract)
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983
Multiplication Is the Easiest Nontrivial Arithmetic Function
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1981
The complexity of basic complex operations.
Computing, 1981

Partial Match Retrieval in Implicit Data Structures.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980
Functions Equivalent to Integer Multiplication.
Proceedings of the Automata, 1980

1979
Complexity arguments in algebraic language theory.
ITA, 1979

Square rooting is as difficult as multiplication.
Computing, 1979

Lower Bounds on Space Complexity for Contextfree Recognition.
Acta Inf., 1979

The complexity of complex division (extended abstract).
FCT, 1979

1977
Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen.
Proceedings of the Theoretical Computer Science, 1977

1976
Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen.
PhD thesis, 1976

Lower Bounds for the Space Complexity of Context-Free Recognition.
ICALP, 1976


  Loading...