@InProceedings{,
author = { Helmut Alt and Ludmila Scharf },
title = { Parallel Computation of the Hausdorff Distance between Shapes },
booktitle = { Proceedings of the 29th European Workshop on Computational Geometry (EuroCG) },
year = { 2013 },
month = { March },
pages = { 47--50 },
note = { Proceedings URL },
}
@Article{,
author = { Helmut Alt and Ludmila Scharf },
title = { Shape Matching by Random Sampling },
journal = { Theoretical Computer Science },
year = { 2012 },
volume = { 442 },
pages = { 2--12 },
note = { [doi] },
}
@Article{,
author = { Helmut Alt and Ludmila Scharf },
title = { Computation of the Hausdorff distance between sets of line segments in parallel },
journal = { CoRR },
year = { 2012 },
volume = { abs/1207.3962 },
note = { [arxiv] },
}
@Article{,
author = { Helmut Alt and Maike Buchin },
title = { Can We Compute the Similarity between Surfaces? },
journal = { Discrete and Computational Geometry },
year = { 2010 },
volume = { 43 },
number = { 1 },
pages = { 78--99 },
}
@InProceedings{,
author = { Helmut Alt and Ludmila Scharf },
title = { Computing the depth of an arrangement of axis-aligned rectangles in parallel },
booktitle = { Proceedings of the 26th European Workshop on Computational Geometry (EuroCG) },
year = { 2010 },
month = { March },
pages = { 33--36 },
address = { Dortmund, Germany },
}
@Article{Alt201099,
author = { Helmut Alt and Ludmila Scharf and Daria Schymura },
title = { Probabilistic Matching of Planar Regions },
journal = { Computational Geometry, Theory and Applications (CGTA) },
year = { 2010 },
volume = { 43 },
number = { 2 },
pages = { 99--114 },
note = { Special Issue on the 24th European Workshop on Computational Geometry (EuroCG'08)
view at ScienceDirect },
}
@Article{aabbcknsw-coh-09,
author = { Hee-Kap Ahn and Helmut Alt and Tetsuo Asano and Sang Won Bae and Peter Bra{\ss} and Otfried Cheong and Christian Knauer and Hyeon-Suk Na and Chan-Su Shin and Alexander Wolff },
title = { Constructing Optimal Highways },
journal = { Internat. J. Found. Comput. Sci. },
year = { 2009 },
volume = { 20 },
number = { 1 },
pages = { 3--23 },
note = { [doi] },
}
@Article{,
author = { Helmut Alt and Hans Bodlaender and Marc van Kreveld and G{\"u}nter Rote and Gerard Tel },
title = { Wooden Geometric Puzzles: Design and Hardness Proofs },
journal = { Theory Comput. Syst. },
year = { 2009 },
volume = { 44 },
pages = { 160--174 },
}
@InBook{,
author = { Helmut Alt },
title = { The Computational Geometry of Comparing Shapes },
booktitle = { Efficient Algorithms },
year = { 2009 },
volume = { LNCS 5760 },
editor = { Susanne Albers, Helmut Alt, Stefan N{\"a}her },
publisher = { Springer Berlin / Heidelberg },
pages = { 235--248 },
note = { Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
SpringerLink },
}
@Proceedings{,
title = { Efficient Algorithms },
year = { 2009 },
volume = { LNCS 5760 },
editor = { Susanne Albers, Helmut Alt, Stefan N{\"a}her },
publisher = { Springer Berlin / Heidelberg },
note = { Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
SpringerLink },
}
@InProceedings{09-smrs,
author = { Helmut Alt and Ludmila Scharf },
title = { Shape matching by random sampling },
booktitle = { 3rd Annual Workshop on Algorithms and Computation (WALCOM 2009) },
year = { 2009 },
volume = { 5431 },
editor = { S. Das and R. Uehara },
publisher = { Springer-Verlag Berlin Heidelberg },
series = { Lecture Note in Computer Science },
pages = { 381--393 },
}
@Article{,
author = { Helmut Alt and Ludmila Scharf and Daria Schymura },
title = { Probabilistic Matching of Planar Regions },
journal = { CoRR },
year = { 2009 },
volume = { abs/0902.4337 },
note = { [Eprint:arXiv:0902.4337] },
}
@Article{wgp-08,
author = { Helmut Alt and Hans Bodlaender and Marc van Kreveld and G{\"u}nter Rote and Gerard Tel },
title = { Wooden Geometric Puzzles: Design and Hardness Proofs },
journal = { Theory of Computing Systems },
year = { 2008 },
}
@TechReport{08-smrs,
author = { Helmut Alt and Ludmila Scharf },
title = { Shape matching by random sampling },
year = { 2008 },
number = { B 08-02 },
institution = { Freie Universit{\"a}t Berlin },
}
@Article{as-chdco-08,
author = { Helmut Alt and Ludmila Scharf },
title = { Computing the {H}ausdorff Distance between Curved Objects },
journal = { Int. J. Comput. Geometry Appl. },
year = { 2008 },
month = { August },
volume = { 18 },
number = { 4 },
pages = { 307--320 },
}
@InProceedings{ass-pmp-08,
author = { Helmut Alt and Ludmila Scharf and Daria Schymura },
title = { Probabilistic Matching of Polygons },
booktitle = { Proceedings of the 24th European Workshop on Computational Geometry (EuroCG) },
year = { 2008 },
month = { March },
pages = { 255--258 },
address = { Nancy, France },
}
@InProceedings{wgp07,
author = { Helmut Alt and Hans L. Bodlaender and Marc J. van Kreveld and G{\"u}nter Rote and Gerard Tel },
title = { Wooden Geometric Puzzles: Design and Hardness Proofs },
booktitle = { Fun with Algorithms 4th International Conference (FUN2007) },
year = { 2007 },
month = { June },
publisher = { Springer Berlin / Heidelberg },
series = { Lecture Notes in Computer Science },
pages = { 16-29 },
address = { Castiglioncello, Italy },
}
@Article{ab-ccsms-07,
author = { Helmut Alt and Maike Buchin },
title = { Can we Compute the Similarity Between Surfaces? },
year = { 2007 },
pages = { pp. 21 },
note = { http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0703011 },
}
@InProceedings{CRPITV65P7-14,
author = { Hee-Kap Ahn and Helmut Alt and Tetsuo Asano and Sang Won Bae and Peter Bra{\ss} and Otfried Cheong and Christian Knauer and Hyeon-Suk Na and Chan-Su Shin and Alexander Wolff },
title = { Constructing Optimal Highways },
booktitle = { Thirteenth Computing: The Australasian Theory Symposium (CATS2007) },
year = { 2007 },
volume = { 65 },
editor = { Joachim Gudmundsson, Barry Jay },
publisher = { ACS },
series = { CRPIT },
pages = { 7-14 },
address = { Ballarat, Australia },
}
@InProceedings{ass-pmre-07,
author = { Helmut Alt and Ludmila Scharf and Sven Scholz },
title = { Probabilistic Matching and Resemblance Evaluation of Shapes in Trademark Images },
booktitle = { Proceedings of the ACM International Conference on Image and Video Retrieval (CIVR) },
year = { 2007 },
month = { July },
pages = { 533--540 },
address = { Amsterdam, The Netherlands },
}
@InProceedings{,
author = { Helmut Alt and E. M. Arkin and H. Br{\"o}nnimann and Jeff Erickson and S. P. Fekete and Christian Knauer and L. Lenchner and J. S. B. Mitchell and Kim Whittlesey },
title = { Minimum-Cost Coverage of Point Sets by Disks },
booktitle = { Proc. 22nd Annual ACM Symposium on Computational Geometry },
year = { 2006 },
pages = { 449-458 },
address = { Sedona (Arizona), USA },
}
@InProceedings{ass-pmspc-06,
author = { Helmut Alt and Ludmila Scharf and Sven Scholz },
title = { Probabilistic matching of sets of Polygonal curves },
booktitle = { Proceedings of the 22nd European Workshop on Computational Geometry (EWCG) },
year = { 2006 },
month = { March },
pages = { 107--110 },
address = { Delphi, Greece },
}
@Article{,
author = { Helmut Alt and Otfried Cheong and Antoine Vigneron },
title = { The {V}oronoi diagram of curved objects },
journal = { Discrete & Computational Geometry },
year = { 2005 },
volume = { 34 },
pages = { 439-453 },
}
@InProceedings{ab-scfds-05,
author = { Helmut Alt and Maike Buchin },
title = { Semi-Computability of the {F}r\'echet Distance between Surfaces },
booktitle = { Proceedings of the 21st European Workshop on Computational Geometry (EWCG) },
year = { 2005 },
pages = { 45 -- 48 },
address = { Eindhoven, Netherlands },
}
@Proceedings{,
title = { Theory of Computing Systems },
year = { 2005 },
volume = { 38 },
number = { 2 },
publisher = { Springer New York },
}
@InProceedings{as-chdco-05,
author = { Helmut Alt and Ludmila Scharf },
title = { Computing the {H}ausdorff Distance between Curved Objects },
booktitle = { Proceedings of the 2nd International Symposium on Voronoi Diagrams in Science and Engineering },
year = { 2005 },
month = { October },
pages = { 196-204 },
address = { Hanyang University, Seoul, Korea },
}
@InProceedings{,
author = { Helmut Alt and Christian Knauer and G{\"u}nter Rote and Sue Whitesides },
title = { On the Complexity of the Linkage Reconfiguration Problem },
booktitle = { Towards a Theory of Geometric Graphs },
year = { 2004 },
editor = { Janos Pach },
publisher = { American Mathematical Society },
pages = { 1--14 },
}
@Article{ad-sist-04,
author = { Helmut Alt and Jerome Durand-Lose, Eds. },
title = { Special Issue with selected contributions from STACS 2002 },
journal = { Theory of Computing Systems },
year = { 2004 },
volume = { 37 },
}
@Article{akw-cdmpc-04,
author = { Helmut Alt and Christian Knauer and Carola Wenk },
title = { Comparison of distance measures for planar curves },
journal = { Algorithmica },
year = { 2004 },
volume = { 38 },
number = { 1 },
pages = { 45-58 },
note = { Special Issue on Shape Algorithmics },
}
@InProceedings{as-chdco-04,
author = { Helmut Alt and Ludmila Scharf },
title = { Computing the {H}ausdorff distance between curved objects },
booktitle = { Proceedings of the 20th European Workshop on Computational Geometry (EWCG), Seville, Spain },
year = { 2004 },
pages = { 233 - 236 },
}
@InProceedings{aerw-mpm-03,,
author = { Helmut Alt and Alon Efrat and G{\"u}nter Rote and Carola Wenk },
title = { Matching planar maps },
booktitle = { Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore },
year = { 2003 },
pages = { 589-598 },
}
@InProceedings{agg-wccsp-03,
author = { Helmut Alt and Marc Glisse and Xavier Goaoc },
title = { On the worst-case complexity of the silhouette of a polytope },
booktitle = { Proceedings of the 15th Canadian Conference on Computational Geometry },
year = { 2003 },
}
@InProceedings{waepr-fcmv-03,
author = { Helmut Alt and Alon Efrat and Lingeshwaran Palaniappan and G{\"u}nter Rote and Carola Wenk },
title = { Finding a curve in a map (Video) },
booktitle = { Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego },
year = { 2003 },
publisher = { Association for Computing Machinery },
pages = { 384-385 },
}
@InProceedings{,
author = { Helmut Alt and Christian Knauer and G{\"u}nter Rote and Sue Whitesides },
title = { The Complexity of (Un)folding },
journal = { Proceedings of the 19th ACM Symposium on Computational Geometry (SOCG) },
booktitle = { 19th ACM Symposium on Computational Geometry },
year = { 2003 },
pages = { 164-170 },
}
@Article{aerw-mpm_03,,
author = { Helmut Alt and Alon Efrat and G{\"u}nter Rote and Carola Wenk },
title = { Matching planar maps },
journal = { J. of Algorithms },
year = { 2003 },
pages = { 262-283 },
}
@Proceedings{alt03:_proceed_twent_annual_sympos_theor,
title = { STACS 2003 },
booktitle = { Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science held at the Freie Universit{\"a}t Berlin, Berlin, February 27--March 1, 2003 },
year = { 2003 },
volume = { 2607 },
editor = { Helmut Alt and Michel Habib },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
address = { Berlin },
}
@InCollection{abgkw-chdgp-03,
author = { Helmut Alt and Peter Bra{\ss} and Michael Godau and Christian Knauer and Carola Wenk },
title = { Computing the {H}ausdorff distance of geometric patterns and shapes },
booktitle = { Discrete and Computational Geometry. The Goodman--Pollack Festschrift },
year = { 2003 },
volume = { 25 },
editor = { B. Aronov and S. Basu and J. Pach and M. Sharir },
publisher = { Springer },
series = { Algorithms and Combinatorics },
pages = { 65--76 },
address = { Berlin },
note = { Special Issue: The Goodman-Pollack-Festschrift (B. Aronov, S. Basu, J. Pach, M. Sharir eds.) },
}
@Proceedings{alt02:_proceed_ninet_annual_sympos_theor,
title = { STACS 2002 },
booktitle = { Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science held in Antibes-Juan les Pins, March 14--16, 2002 },
year = { 2002 },
volume = { 2285 },
editor = { Helmut Alt and Afonso Ferreira },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
address = { Berlin },
}
@InCollection{a-nn-01,
author = { Helmut Alt },
title = { The nearest neighbor },
booktitle = { Computational Discrete Mathematics },
year = { 2001 },
volume = { 2122 },
publisher = { Springer },
series = { Lecture Notes in Computer Science },
pages = { 13--24 },
}
@InProceedings{ah-elnns-01,
author = { Helmut Alt and Laura Heinrich-Litan },
title = { Exact Linfty-Nearest Neighbor Search in High Dimensions },
booktitle = { Proceedings of the 17th ACM Symposium on Computational Geometry },
year = { 2001 },
month = { June },
publisher = { Association for Computing Machinery },
pages = { 157-163 },
}
@InProceedings{ah-pcprb-01,
author = { Helmut Alt and Ferran Hurtado },
title = { Packing Convex Polygons into Rectangular Boxes },
booktitle = { Japanese Conference on Discrete and Computational Geometry 2000 },
year = { 2001 },
volume = { 2098 },
editor = { J. Akiyama and M. Kano and M. Urabe },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
pages = { 67-80 },
}
@Book{a-cdmal-01,
author = { Helmut Alt },
title = { Computational Discrete Mathematics, Advanced Lectures (Ed.) },
year = { 2001 },
volume = { 2122 },
publisher = { Springer },
series = { Lecture Notes in Computer Science },
note = { ISBN: 3-540-42775-9 },
}
@Proceedings{,
title = { Computational Discrete Mathematics: advanced lectures },
year = { 2001 },
publisher = { Springer-Verlag New York, Inc. },
series = { Lecture Notes In Computer Science },
}
@TechReport{abgkw-chdgp-01,
author = { Helmut Alt and Peter Bra{\ss} and Michael Godau and Christian Knauer and Carola Wenk },
title = { Computing the {H}ausdorff distance of geometric patterns and shapes },
year = { 2001 },
number = { B 01-07 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
}
@TechReport{akw-cdmgs-01,
author = { Helmut Alt and Christian Knauer and Carola Wenk },
title = { Comparison of distance measures for geometric shapes },
year = { 2001 },
month = { December },
number = { B 01-09 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
}
@InProceedings{akw-mpcrf-01,
author = { Helmut Alt and Christian Knauer and Carola Wenk },
title = { Matching polygonal curves with respect to the {F}r\'echet distance },
booktitle = { Proceedings 18th International Symposium on Theoretical Aspects of Computer Science },
year = { 2001 },
pages = { 63-74 },
}
@Article{afhnw-cpsfk-00,
author = { Helmut Alt and Stefan Felsner and Ferran Hurtado and Marc Noy and Emo Welzl },
title = { A class of point-sets with few k-sets },
journal = { Comp. Geom. Theory and Appl. },
year = { 2000 },
volume = { 16 },
pages = { 95-101 },
}
@TechReport{afs-sanof-00,
author = { Helmut Alt and Stefan Felsner and Ludmila Scharf },
title = { Storage Area Network Optimization: Final Report },
year = { 2000 },
number = { B 00-18 },
institution = { Freie Universit{\"a}t Berlin },
}
@InCollection{ag-dgsmi-99,
author = { Helmut Alt and Leonidas Guibas },
title = { Discrete Geometric Shapes: Matching, Interpolation, and Approximation },
booktitle = { Handbook of Computational Geometry },
year = { 1999 },
publisher = { Elsevier Science Publishers B.V. North-Holland },
pages = { 121-153 },
address = { Amsterdam },
}
@InProceedings{ak-msrsd-99,
author = { Helmut Alt and Christian Knauer },
title = { Matching shapes with respect to the symmetric difference (Extended Abstract) },
booktitle = { Proceedings of the Fifteenth European Workshop on Computational Geometry, Antibes-Juan-les-Pins, France },
year = { 1999 },
pages = { 195-197 },
}
@Article{phkwwsoaf-naaps-99,
author = { Helmut Alt and Eckart Fleck and Frank Hoffmann and Klaus Kriegel and Helmut Oswald and Klaus-Peter Plei{\ss}ner and Anders Sahlstr{\"o}hm and Susan Wegner and Carola Wenk },
title = { New algorithmic approaches to protein spot detection and pattern matching in two-dimensional electrophoresis gel databases },
journal = { Electrophoresis },
year = { 1999 },
volume = { 20 },
pages = { 755-765 },
}
@InProceedings{afhn-psfks-98,
author = { Helmut Alt and Stefan Felsner and Ferran Hurtado and Marc Noy },
title = { Point-sets with few k-sets },
booktitle = { Proc. ACM Symposium on Computational Geometry },
year = { 1998 },
pages = { 200-205 },
}
@Article{afrw-mcsrs-98,
author = { Helmut Alt and Ulrich Fuchs and G{\"u}nter Rote and Gerald Weber },
title = { Matching convex shapes with respect to the symmetric difference },
journal = { Algorithmica },
year = { 1998 },
volume = { 21 },
pages = { 89-103 },
}
@Article{agw-u3dvr-98,
author = { Helmut Alt and Michael Godau and Sue Whitesides },
title = { Universal 3-Dimensional Visibility Representations for Graphs },
journal = { Computational Geometry: Theory and Applications },
year = { 1998 },
volume = { 9 },
pages = { 111-125 },
}
@TechReport{afhn-psfks-97,
author = { Helmut Alt and Stefan Felsner and Ferran Hurtado and Marc Noy },
title = { Point-sets with few k-sets },
year = { 1997 },
number = { B 97-10 },
institution = { Freie Universit{\"a}t Berlin },
}
@InProceedings{aww-plabc-97,
author = { Helmut Alt and Emo Welzl and Barbara Wolfers },
title = { Piecewise Linear Approximation of Bézier-Curves },
booktitle = { Proc. 13th Annu. ACM Sympos. Comput. Geom. },
year = { 1997 },
pages = { 433-435 },
}
@Article{aar-msrp-97,
author = { Oswin Aichholzer and Helmut Alt and G{\"u}nter Rote },
title = { Matching shapes with a reference point },
journal = { International Journal on Computational Geometry and Applications },
year = { 1997 },
volume = { 7 },
pages = { 349-363 },
}
@InProceedings{afk-nscpg-97,
author = { Helmut Alt and Ulrich Fuchs and Klaus Kriegel },
title = { On the Number of Simple Cycles in Planar Graphs },
booktitle = { Springer Lecture Notes in Computer Science },
year = { 1997 },
volume = { 1335 },
pages = { 15-24 },
organization = { Proceedings, Workshop on Graph-Theoretic Concepts in Computer Science - WG '97 },
address = { Berlin },
}
@InProceedings{afrw-mcsrs-96,
author = { Helmut Alt and Ulrich Fuchs and G{\"u}nter Rote and Gerald Weber },
title = { Matching convex shapes with respect to the symmetric difference },
booktitle = { Algorithms - ESA '96. Proc. Fourth Annual European Symposium on Algorithms, Barcelona },
year = { 1996 },
volume = { 1136 },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
pages = { 320-333 },
}
@TechReport{ag-dgsmi-96,
author = { Helmut Alt and Leonidas Guibas },
title = { Discrete Geometric Shapes: Matching, Interpolation, and Approximation - A Survey },
year = { 1996 },
number = { 96-11 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
note = { to appear in Handbook on Computational Geometry, Eds. J{\"o}rg Sack and Jorge Urrutia },
}
@InProceedings{agw-u3dvr-96,
author = { Helmut Alt and Michael Godau and Sue Whitesides },
title = { Universal 3-Dimensional Visibility Representations for Graphs },
booktitle = { Graph Drawing (Proc. GD '95) },
year = { 1996 },
volume = { 1027 },
publisher = { Springer-Verlag },
series = { Lecture Notes Comput. Sci. },
pages = { 8-19 },
}
@Article{agkmw-mopas-96,
author = { Helmut Alt and Leonidas Guibas and Richard Karp and Kurt Mehlhorn and Avi Widgerson },
title = { A Method for Obtaining Probabilistic Algorithms with Small Tail Probabilities },
journal = { Algorithmica },
year = { 1996 },
volume = { 16 },
pages = { 543-547 },
}
@InProceedings{ahs-cliir-95,
author = { Helmut Alt and David Hsu and Jack Snoeyink },
title = { Computing the Largest Inscribed Isothetic Rectangle },
booktitle = { Proc. 7th Canad. Conf. Comput. Geom. },
year = { 1995 },
pages = { 67-72 },
}
@InProceedings{as-vdco-95,
author = { Helmut Alt and Otfried Cheong (geb. Schwarzkopf) },
title = { The {V}oronoi diagram of curved objects },
booktitle = { Proc. 11th Annu. ACM Sympos. Comput. Geom. },
year = { 1995 },
pages = { 89-97 },
}
@Article{abb-amps-95,
author = { Helmut Alt and Bernd Behrends and Johannes Bl{\"o}mer },
title = { Approximate matching of polygonal shapes },
journal = { Ann. Math. Artif. Intell. },
year = { 1995 },
volume = { 13 },
pages = { 251-266 },
}
@Article{ag-cfdbt-95,
author = { Helmut Alt and Michael Godau },
title = { Computing the {F}r\'echet distance between two polygonal curves },
journal = { Internat. J. Comput. Geom. Appl. },
year = { 1995 },
volume = { 5 },
pages = { 75-91 },
}
@InProceedings{aar-msrp-94,
author = { Oswin Aichholzer and Helmut Alt and G{\"u}nter Rote },
title = { Matching shapes with a reference point },
booktitle = { Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York },
year = { 1994 },
publisher = { Association for Computing Machinery },
pages = { 85-92 },
}
@Article{wka-appma-94,
author = { Helmut Alt and Lars Knipping and Gerald Weber },
title = { An Application of Point Pattern Matching in Astronautics },
journal = { J. Symbolic Comput. },
year = { 1994 },
volume = { 17 },
pages = { 321-340 },
}
@Article{,
author = { Helmut Alt and Viliam Geffert and Kurt Mehlhorn },
title = { Nondeterministic Space Complexity for the Recognition of Context-Free Languages. },
journal = { Inform. Process. Lett. },
year = { 1992 },
volume = { 42 },
pages = { 25-27 },
}
@Article{agm-nscrc-92,
author = { Helmut Alt and Viliam Geffert and Kurt Mehlhorn },
title = { Nondeterministic Space Complexity for the Recognition of Context-Free Languages },
journal = { Inform. Process. Lett. },
year = { 1992 },
volume = { 42 },
pages = { 25-27 },
}
@InProceedings{ag-mrpc-92,
author = { Helmut Alt },
title = { Measuring the resemblance of polygonal curves. },
booktitle = { Proc. 8th Annu. ACM Sympos. Comput. Geom. },
year = { 1992 },
pages = { 102-109 },
}
@InProceedings{ag-mrpc-92,
author = { Helmut Alt and Michael Godau },
title = { Measuring the resemblance of polygonal curves },
booktitle = { Proc. 8th Annu. ACM Sympos. Comput. Geom. },
year = { 1992 },
pages = { 102-109 },
}
@Article{afkmnsu-ampcb-92,
author = { Helmut Alt and Rudolf Fleischer and Michael Kaufmann and Kurt Mehlhorn and Stefan N{\"a}her and Stefan Schirra and Christian Uhrig },
title = { Approximate motion planning and the complexity of the boundary of the union of simple geometric figures },
journal = { Algorithmica },
year = { 1992 },
volume = { 8 },
pages = { 391-406 },
}
@InProceedings{abb-amps-91,
author = { Helmut Alt and Bernd Behrends and Johannes Bl{\"o}mer },
title = { Approximate matching of polygonal shapes },
booktitle = { Proc. 7th Annu. ACM Sympos. Comput. Geom. },
year = { 1991 },
pages = { 186-193 },
}
@InProceedings{ag-mamrc-91,
author = { Helmut Alt and Michael Godau },
title = { Metrics and Algorithms for Measuring the Resemblance of Curves },
booktitle = { Proc. 13th IMACS World Congress on Computation and Applied Mathematics },
year = { 1991 },
pages = { 135-136 },
}
@Article{abmp-cmcmb-91,
author = { Helmut Alt and Norbert Blum and Kurt Mehlhorn and Markus Paul },
title = { Computing a Maximum Cardinality Matching of a Bipartite Graph in Time O(n1.5 sqrt(m/log n)) },
journal = { Inform. Process. Lett. },
year = { 1991 },
volume = { 37 },
pages = { 237-240 },
}
@InProceedings{abgw-acp-90,
author = { Helmut Alt and Johannes Bl{\"o}mer and Michael Godau and Hubert Wagener },
title = { Approximation of convex polygons },
booktitle = { Proc. 17th Internat. Colloq. Automata Lang. Program. },
year = { 1990 },
volume = { 443 },
publisher = { Springer-Verlag },
series = { Lecture Notes Comput. Sci. },
pages = { 703-716 },
}
@InProceedings{afkmnsu-ampcb-90,
author = { Helmut Alt and Rudolf Fleischer and Michael Kaufmann and Kurt Mehlhorn and Stefan N{\"a}her and Stefan Schirra and Christian Uhrig },
title = { Approximate motion planning and the complexity of the boundary of the union of simple geometric figures },
booktitle = { Proc. 6th Annu. ACM Sympos. Comput. Geom. },
year = { 1990 },
pages = { 281-289 },
}
@Article{ay-aampt1-90,
author = { Helmut Alt and Chee K. Yap },
title = { Algorithmic aspect of motion planning: a tutorial, part 1 },
journal = { Algorithms Rev. },
year = { 1990 },
volume = { 1 },
number = { 1 },
pages = { 43-60 },
}
@Article{ay-aampt2-90,
author = { Helmut Alt and Chee K. Yap },
title = { Algorithmic aspect of motion planning: a tutorial, part 2 },
journal = { Algorithms Rev. },
year = { 1990 },
volume = { 1 },
number = { 2 },
pages = { 61-77 },
}
@InProceedings{ay-aart-89,
author = { Helmut Alt and Chee K. Yap },
title = { Algorithmic Aspects of Robotics: a Tutorial },
booktitle = { Proceedings SOFSEM `89 },
year = { 1989 },
pages = { 7-40 },
}
@InProceedings{ay-mpce-89,
author = { Helmut Alt },
title = { Motion Planning in the {CL}-Environment },
booktitle = { Proc. 2nd Workshop Algorithms Data Struct. },
year = { 1989 },
volume = { 382 },
publisher = { Springer-Verlag },
series = { Lecture Notes Comput. Sci. },
pages = { 373-380 },
}
@Article{a-cccaf-88,
author = { Helmut Alt },
title = { Comparing the combinational complexities of arithmetic functions },
journal = { J. ACM },
year = { 1988 },
volume = { 35 },
pages = { 447-460 },
}
@Article{mna-lbcus-88,
author = { Helmut Alt and Kurt Mehlhorn and Stefan N{\"a}her },
title = { A lower bound on the complexity of the union-split-find problem },
journal = { SIAM J. Comput. },
year = { 1988 },
volume = { 17 },
pages = { 1093-1102 },
}
@Article{aw-vgoas-88,
author = { Helmut Alt and Emo Welzl },
title = { Visibility graphs and obstacle-avoiding shortest paths },
journal = { Zeitschrift f{\"u}r Operations Research },
year = { 1988 },
volume = { 32 },
number = { 145-164 },
}
@InProceedings{amww-cssgo-87,
author = { Helmut Alt and Kurt Mehlhorn and Hubert Wagener and Emo Welzl },
title = { Congruence, similarity and symmetries of geometric objects },
booktitle = { Proc. 3rd Annu. ACM Sympos. Comput. Geom. },
year = { 1987 },
pages = { 308-315 },
}
@Article{amhp-simpc-87,
author = { Helmut Alt and Torben Hagerup and Kurt Mehlhorn and Franco Preparata },
title = { Simulation of Idealized Models of Parallel Computers on More Realistic ones },
journal = { SIAM J. Comput. },
year = { 1987 },
volume = { 16 },
pages = { 808-835 },
}
@InProceedings{amhp-simpc-86,
author = { Helmut Alt and Torben Hagerup and Kurt Mehlhorn and Franco Preparata },
title = { Simulation of Idealized Models of Parallel Computers on More Realistic ones },
booktitle = { Proc. MFCS 1986, Springer Lecture Notes in Computer Science 233 },
year = { 1986 },
pages = { 199-208 },
}
