default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHelmut Alt
Person information
- affiliation: Free University of Berlin, Germany
- affiliation (PhD 1976): Saarland University, Saarbrücken, Germany
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[i10]Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Seiferth:
Packing 2D disks into a 3D container. CoRR abs/2110.12711 (2021)- 2020
- [j45]Hee-Kap Ahn
, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk:
Middle curves based on discrete Fréchet distance. Comput. Geom. 89: 101621 (2020)
2010 – 2019
- 2019
- [c45]Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Scharf:
Packing 2D Disks into a 3D Container. WALCOM 2019: 369-380 - 2018
- [j44]Helmut Alt, Nadja Scharf:
Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. Int. J. Comput. Geom. Appl. 28(2): 111-128 (2018) - [j43]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your coins on a shelf. J. Comput. Geom. 9(1): 312-327 (2018) - 2017
- [j42]Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer:
Minimum Cell Connection in Line Segment Arrangements. Int. J. Comput. Geom. Appl. 27(3): 159-176 (2017) - [j41]Helmut Alt, Mark de Berg, Christian Knauer:
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. J. Comput. Geom. 8(1): 1-10 (2017) - [c44]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. ISAAC 2017: 4:1-4:12 - [i9]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. CoRR abs/1707.01239 (2017) - 2016
- [j40]Helmut Alt, Michael S. Payne, Jens M. Schmidt, David R. Wood:
Thoughts on Barnette's Conjecture. Australas. J Comb. 64: 354-365 (2016) - [j39]Dongwoo Park, Sang Won Bae, Helmut Alt, Hee-Kap Ahn:
Bundling three convex polygons to minimize area or perimeter. Comput. Geom. 51: 1-14 (2016) - [j38]Helmut Alt:
Computational Aspects of Packing Problems. Bull. EATCS 118 (2016) - [c43]Helmut Alt, Nadja Scharf:
Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. ISAAC 2016: 11:1-11:14 - [c42]Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk:
A Middle Curve Based on Discrete Fréchet Distance. LATIN 2016: 14-26 - [i8]Helmut Alt, Nadja Scharf:
Approximating Smallest Containers for Packing Three-dimensional Convex Objects. CoRR abs/1601.04585 (2016) - 2015
- [c41]Helmut Alt, Mark de Berg, Christian Knauer:
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. ESA 2015: 25-34 - 2014
- [j37]Helmut Alt, Esther M. Arkin, Alon Efrat, George Hart, Ferran Hurtado, Irina Kostitsyna, Alexander Kröller, Joseph S. B. Mitchell, Valentin Polishchuk:
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing. Theory Comput. Syst. 54(4): 689-714 (2014) - 2013
- [c40]Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park:
Bundling Three Convex Polygons to Minimize Area or Perimeter. WADS 2013: 13-24 - 2012
- [j36]Helmut Alt, Ludmila Scharf:
Shape matching by random sampling. Theor. Comput. Sci. 442: 2-12 (2012) - [i7]Helmut Alt, Ludmila Scharf:
Computation of the Hausdorff distance between sets of line segments in parallel. CoRR abs/1207.3962 (2012) - 2011
- [p3]Helmut Alt:
Fast Sorting Algorithms. Algorithms Unplugged 2011: 17-25 - [e7]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Algorithms Unplugged. Springer 2011, ISBN 978-3-642-15327-3 [contents] - [i6]Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer:
Minimum cell connection and separation in line segment arrangements. CoRR abs/1104.4618 (2011) - 2010
- [j35]Helmut Alt, Ludmila Scharf, Daria Schymura:
Probabilistic matching of planar regions. Comput. Geom. 43(2): 99-114 (2010) - [j34]Helmut Alt, Maike Buchin:
Can We Compute the Similarity between Surfaces? Discret. Comput. Geom. 43(1): 78-99 (2010)
2000 – 2009
- 2009
- [j33]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20(1): 3-23 (2009) - [j32]Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel:
Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst. 44(2): 160-174 (2009) - [c39]Helmut Alt:
The Computational Geometry of Comparing Shapes. Efficient Algorithms 2009: 235-248 - [c38]Helmut Alt, Ludmila Scharf:
Shape Matching by Random Sampling. WALCOM 2009: 381-393 - [e6]Susanne Albers, Helmut Alt, Stefan Näher:
Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 5760, Springer 2009, ISBN 978-3-642-03455-8 [contents] - [e5]Pankaj Kumar Agarwal, Helmut Alt, Monique Teillaud:
Computational Geometry, 08.03. - 13.03.2009. Dagstuhl Seminar Proceedings 09111, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i5]Pankaj Kumar Agarwal, Helmut Alt, Monique Teillaud:
09111 Abstracts Collection - Computational Geometry. Computational Geometry 2009 - [i4]Helmut Alt, Ludmila Scharf, Daria Schymura:
Probabilistic Matching of Planar Regions. CoRR abs/0902.4337 (2009) - 2008
- [j31]Helmut Alt, Ludmila Scharf:
Computing the Hausdorff Distance between Curved Objects. Int. J. Comput. Geom. Appl. 18(4): 307-320 (2008) - [p2]Helmut Alt:
Schnelle Sortieralgorithmen. Taschenbuch der Algorithmen 2008: 21-30 - [e4]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Taschenbuch der Algorithmen. eXamen.press, Springer 2008, ISBN 978-3-540-76393-2 [contents] - 2007
- [c37]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. CATS 2007: 7-14 - [c36]Helmut Alt, Ludmila Scharf, Sven Scholz:
Probabilistic matching and resemblance evaluation of shapes in trademark images. CIVR 2007: 533-540 - [c35]Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel:
Wooden Geometric Puzzles: Design and Hardness Proofs. FUN 2007: 16-29 - [i3]Helmut Alt, Maike Buchin:
Can we Compute the Similarity Between Surfaces? CoRR abs/cs/0703011 (2007) - [i2]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. CoRR abs/cs/0703037 (2007) - 2006
- [c34]Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey:
Minimum-cost coverage of point sets by disks. SCG 2006: 449-458 - 2005
- [j30]Helmut Alt, Otfried Cheong, Antoine Vigneron:
The Voronoi Diagram of Curved Objects. Discret. Comput. Geom. 34(3): 439-453 (2005) - [j29]Helmut Alt:
Foreword. Theory Comput. Syst. 38(2): 133 (2005) - [i1]Helmut Alt, Maike Buchin:
Semi-computability of the Fréchet distance between surfaces. EuroCG 2005: 45-48 - 2004
- [j28]Helmut Alt, Christian Knauer, Carola Wenk:
Comparison of Distance Measures for Planar Curves. Algorithmica 38(1): 45-58 (2004) - 2003
- [j27]Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk:
Matching planar maps. J. Algorithms 49(2): 262-283 (2003) - [c33]Helmut Alt, Marc Glisse, Xavier Goaoc:
On the worst-case complexity of the silhouette of a polytope. CCCG 2003: 51-55 - [c32]Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides:
The complexity of (un)folding. SCG 2003: 164-170 - [c31]Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote:
Finding a curve in a map. SCG 2003: 384-385 - [c30]Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk:
Matching planar maps. SODA 2003: 589-598 - [e3]Helmut Alt, Michel Habib:
STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings. Lecture Notes in Computer Science 2607, Springer 2003, ISBN 3-540-00623-0 [contents] - 2002
- [e2]Helmut Alt, Afonso Ferreira:
STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings. Lecture Notes in Computer Science 2285, Springer 2002, ISBN 3-540-43283-3 [contents] - 2001
- [c29]Helmut Alt:
The Nearest Neighbor. Computational Discrete Mathematics 2001: 13-24 - [c28]Helmut Alt, Laura Heinrich-Litan:
Exact Linfty Nearest Neighbor Search in High Dimensions. SCG 2001: 157-163 - [c27]Helmut Alt, Christian Knauer, Carola Wenk:
Matching Polygonal Curves with Respect to the Fréchet Distance. STACS 2001: 63-74 - [e1]Helmut Alt:
Computational Discrete Mathematics, Advanced Lectures. Lecture Notes in Computer Science 2122, Springer 2001, ISBN 3-540-42775-9 [contents] - 2000
- [j26]Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl:
A class of point-sets with few k-sets. Comput. Geom. 16(2): 95-101 (2000) - [c26]Helmut Alt, Ferran Hurtado:
Packing Convex Polygons into Rectangular Boxes. JCDCG 2000: 67-80 - [p1]Helmut Alt, Leonidas J. Guibas:
Discrete Geometric Shapes: Matching, Interpolation, and Approximation. Handbook of Computational Geometry 2000: 121-153
1990 – 1999
- 1999
- [j25]Helmut Alt, Ulrich Fuchs, Klaus Kriegel:
On The Number Of Simple Cycles In Planar Graphs. Comb. Probab. Comput. 8(5): 397-405 (1999) - 1998
- [j24]Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber:
Matching Convex Shapes with Respect to the Symmetric Difference. Algorithmica 21(1): 89-103 (1998) - [j23]Helmut Alt, Michael Godau, Sue Whitesides:
Universal 3-dimensional visibility representations for graphs. Comput. Geom. 9(1-2): 111-125 (1998) - [c25]Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy:
Point-Sets with few k-Sets. SCG 1998: 200-205 - 1997
- [j22]Oswin Aichholzer, Helmut Alt, Günter Rote:
Matching Shapes with a Reference Point. Int. J. Comput. Geom. Appl. 7(4): 349-363 (1997) - [c24]Helmut Alt, Emo Welzl, Barbara Wolfers:
Piecewise Linear Approximation of Bézier-Curves. SCG 1997: 433-435 - [c23]Helmut Alt, Ulrich Fuchs, Klaus Kriegel:
On the Number of Simple Cycles in Planar Graphs. WG 1997: 15-24 - 1996
- [j21]Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson:
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica 16(4/5): 543-547 (1996) - [c22]Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber:
Matching Convex Shapes with Respect to the Symmetric Difference. ESA 1996: 320-333 - 1995
- [j20]Helmut Alt, Bernd Behrends, Johannes Blömer:
Approximate Matching of Polygonal Shapes. Ann. Math. Artif. Intell. 13(3-4): 251-265 (1995) - [j19]Helmut Alt, Michael Godau:
Computing the Fréchet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5: 75-91 (1995) - [c21]Helmut Alt, David Hsu, Jack Snoeyink:
Computing the largest inscribed isothetic rectangle. CCCG 1995: 67-72 - [c20]Helmut Alt, Otfried Schwarzkopf:
The Voronoi Diagram of Curved Objects. SCG 1995: 89-97 - [c19]Helmut Alt, Michael Godau, Sue Whitesides:
Universal 3-Dimensional Visibility Representations for Graphs. GD 1995: 8-19 - 1994
- [j18]Gerald Weber, Lars Knipping, Helmut Alt:
An Application of Point Pattern Matching in Astronautics. J. Symb. Comput. 17(4): 321-340 (1994) - [c18]Helmut Alt, Oswin Aichholzer, Günter Rote:
Matching Shapes with a Reference Point. SCG 1994: 85-92 - 1992
- [j17]Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica 8(5&6): 391-406 (1992) - [j16]Helmut Alt, Viliam Geffert, Kurt Mehlhorn:
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. Inf. Process. Lett. 42(1): 25-27 (1992) - [c17]Helmut Alt, Michael Godau:
Measuring the Resemblance of Polygonal Curves. SCG 1992: 102-109 - [c16]Helmut Alt, Johannes Blömer:
Resemblance and Symmetries of Geometric Patterns. Data Structures and Efficient Algorithms 1992: 1-24 - 1991
- [j15]Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul:
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). Inf. Process. Lett. 37(4): 237-240 (1991) - [c15]Helmut Alt, Bernd Behrends, Johannes Blömer:
Approximate Matching of Polygonal Shapes (Extended Abstract). SCG 1991: 186-193 - 1990
- [c14]Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. SCG 1990: 281-289 - [c13]Helmut Alt, Johannes Blömer, Hubert Wagener:
Approximation of Convex Polygons. ICALP 1990: 703-716
1980 – 1989
- 1989
- [c12]Chee-Keng Yap, Helmut Alt:
Motion Planning in the CL-Environment (Extended Abstract). WADS 1989: 373-380 - 1988
- [j14]Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl:
Congruence, Similarity, and Symmetries of Geometric Objects. Discret. Comput. Geom. 3: 237-256 (1988) - [j13]Helmut Alt, Hubert Wagener:
Approximation of Polygons by Rechtangles and Circles. Bull. EATCS 36: 103-112 (1988) - [j12]Helmut Alt:
Comparing the combinational complexities of arithmetic functions. J. ACM 35(2): 447-460 (1988) - [j11]Helmut Alt, Emo Welzl:
Visibility graphs and obstacle-avoiding shortest paths. ZOR Methods Model. Oper. Res. 32(3-4): 145-164 (1988) - [j10]Kurt Mehlhorn, Stefan Näher, Helmut Alt:
A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM J. Comput. 17(6): 1093-1102 (1988) - 1987
- [j9]Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM J. Comput. 16(5): 808-835 (1987) - [c11]Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl:
Congruence, Similarity, and Symmetries of Geometric Objects. SCG 1987: 308-315 - [c10]Kurt Mehlhorn, Stefan Näher, Helmut Alt:
A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP 1987: 479-488 - [c9]Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. Parallel Algorithms and Architectures 1987: 11-15 - 1986
- [c8]Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS 1986: 199-208 - 1985
- [j8]Helmut Alt, Kurt Mehlhorn:
Searching Semisorted Tables. SIAM J. Comput. 14(4): 840-848 (1985) - [j7]Helmut Alt:
Multiplication is the Easiest Nontrivial Arithmetic Function. Theor. Comput. Sci. 36: 333-339 (1985) - 1984
- [j6]Helmut Alt, Kurt Mehlhorn, J. Ian Munro:
Partial Match Retrieval in Implicit Data Structures. Inf. Process. Lett. 19(2): 61-65 (1984) - [c7]Helmut Alt:
Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract). STOC 1984: 466-470 - 1983
- [c6]Helmut Alt:
Multiplication Is the Easiest Nontrivial Arithmetic Function. FOCS 1983: 320-322 - 1981
- [j5]Helmut Alt, Jan van Leeuwen:
The complexity of basic complex operations. Computing 27(3): 205-215 (1981) - [c5]Helmut Alt, Kurt Mehlhorn, J. Ian Munro:
Partial Match Retrieval in Implicit Data Structures. MFCS 1981: 156-161 - 1980
- [c4]Helmut Alt:
Functions Equivalent to Integer Multiplication. ICALP 1980: 30-37
1970 – 1979
- 1979
- [j4]Helmut Alt:
Lower Bounds on Space Complexity for Contextfree Recognition. Acta Informatica 12: 33-61 (1979) - [j3]Helmut Alt:
Square rooting is as difficult as multiplication. Computing 21(3): 221-232 (1979) - [j2]Helmut Alt, Kurt Mehlhorn:
Complexity arguments in algebraic language theory. RAIRO Theor. Informatics Appl. 13(3): 217-225 (1979) - [c3]Helmut Alt, Jan van Leeuwen:
The complexity of complex division (extended abstract). FCT 1979: 13-17 - 1977
- [c2]Helmut Alt:
Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen. Theoretical Computer Science 1977: 123-131 - 1976
- [b1]Helmut Alt:
Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen. Saarland University, Saarbrücken, Germany, 1976, pp. 1-76 - [c1]Helmut Alt, Kurt Mehlhorn:
Lower Bounds for the Space Complexity of Context-Free Recognition. ICALP 1976: 338-354 - 1975
- [j1]Helmut Alt, Kurt Mehlhorn:
A language over a one symbol alphabet requiring only O (log log n) space. SIGACT News 7(4): 31-33 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
