Packing d-dimensional balls into a d + 1-dimensional container.

Helmut Alt Free University of Berlin, Germany Saarland University, Saarbrücken, Germany http://www.mi.fu-berlin.de/inf/groups/ag-ti/members/professoren/Alt_Helmut.html https://scholar.google.com/citations?user=FYVWsAsAAAAJ https://dl.acm.org/profile/81100482235 https://zbmath.org/authors/?q=ai:alt.helmut https://mathscinet.ams.org/mathscinet/MRAuthorID/212942 https://mathgenealogy.org/id.php?id=51000 https://en.wikipedia.org/wiki/Helmut_Alt https://www.wikidata.org/entity/Q102105467 https://id.loc.gov/authorities/names/n2001013903 https://d-nb.info/gnd/142112488

Helmut Alt Sergio Cabello Otfried Cheong Ji-won Park Nadja Seiferth Packing d-dimensional balls into a d + 1-dimensional container. 102219 2026 132 Comput. Geom. https://doi.org/10.1016/j.comgeo.2025.102219 db/journals/comgeo/comgeo132.html#AltCCPS26 streams/journals/comgeo

Helmut Alt Otfried Cheong Ji-won Park Nadja Seiferth Packing 2D disks into a 3D container. 2021 abs/2110.12711 CoRR https://arxiv.org/abs/2110.12711 db/journals/corr/corr2110.html#abs-2110-12711

Hee-Kap Ahn Helmut Alt Maike Buchin Eunjin Oh 0001 Ludmila Scharf Carola Wenk Middle curves based on discrete Fréchet distance. 101621 2020 89 Comput. Geom. https://doi.org/10.1016/j.comgeo.2020.101621 db/journals/comgeo/comgeo89.html#AhnABOSW20

Helmut Alt Otfried Cheong Ji-won Park Nadja Scharf Packing 2D Disks into a 3D Container. 369-380 2019 WALCOM https://doi.org/10.1007/978-3-030-10564-8_29 conf/walcom/2019 db/conf/walcom/walcom2019.html#AltCPS19

Helmut Alt Nadja Scharf Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. 2018 28 Int. J. Comput. Geom. Appl. 2 https://doi.org/10.1142/S0218195918600026 https://www.wikidata.org/entity/Q129562383 db/journals/ijcga/ijcga28.html#AltS18 111-128

Helmut Alt Kevin Buchin Steven Chaplick Otfried Cheong Philipp Kindermann Christian Knauer Fabian Stehn Placing your coins on a shelf. 312-327 2018 9 J. Comput. Geom. 1 https://doi.org/10.20382/jocg.v9i1a10 db/journals/jocg/jocg9.html#AltBCCKKS18

Helmut Alt Sergio Cabello Panos Giannopoulos Christian Knauer Minimum Cell Connection in Line Segment Arrangements. 159-176 2017 27 Int. J. Comput. Geom. Appl. 3 https://doi.org/10.1142/S0218195917500017 db/journals/ijcga/ijcga27.html#AltCGK17

Helmut Alt Mark de Berg Christian Knauer Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. 1-10 2017 8 J. Comput. Geom. 1 https://doi.org/10.20382/jocg.v8i1a1 db/journals/jocg/jocg8.html#AltBK17

Helmut Alt Kevin Buchin Steven Chaplick Otfried Cheong Philipp Kindermann Christian Knauer Fabian Stehn Placing your Coins on a Shelf. 4:1-4:12 2017 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2017.4 conf/isaac/2017 db/conf/isaac/isaac2017.html#AltBCCKKS17

Helmut Alt Kevin Buchin Steven Chaplick Otfried Cheong Philipp Kindermann Christian Knauer Fabian Stehn Placing your Coins on a Shelf. 2017 abs/1707.01239 CoRR http://arxiv.org/abs/1707.01239 db/journals/corr/corr1707.html#AltBCCKKS17

Helmut Alt Michael S. Payne Jens M. Schmidt David R. Wood Thoughts on Barnette's Conjecture. 354-365 2016 64 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/64/ajc_v64_p354.pdf db/journals/ajc/ajc64.html#AltPSW16

Dongwoo Park Sang Won Bae 0001 Helmut Alt Hee-Kap Ahn Bundling three convex polygons to minimize area or perimeter. 1-14 2016 51 Comput. Geom. https://doi.org/10.1016/j.comgeo.2015.10.003 https://www.wikidata.org/entity/Q103822038 db/journals/comgeo/comgeo51.html#ParkBAA16

Helmut Alt Computational Aspects of Packing Problems. 2016 118 Bull. EATCS http://eatcs.org/beatcs/index.php/beatcs/article/view/390 db/journals/eatcs/eatcs118.html#Alt16

Helmut Alt Nadja Scharf Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. 11:1-11:14 2016 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2016.11 conf/isaac/2016 db/conf/isaac/isaac2016.html#AltS16 Hee-Kap Ahn Helmut Alt Maike Buchin Eunjin Oh 0001 Ludmila Scharf Carola Wenk A Middle Curve Based on Discrete Fréchet Distance. 14-26 2016 LATIN https://doi.org/10.1007/978-3-662-49529-2_2 conf/latin/2016 db/conf/latin/latin2016.html#AhnABOSW16

Helmut Alt Nadja Scharf Approximating Smallest Containers for Packing Three-dimensional Convex Objects. 2016 abs/1601.04585 CoRR http://arxiv.org/abs/1601.04585 db/journals/corr/corr1601.html#AltS16

Helmut Alt Mark de Berg Christian Knauer Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. 25-34 2015 ESA https://doi.org/10.1007/978-3-662-48350-3_3 conf/esa/2015 db/conf/esa/esa2015.html#AltBK15

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. 689-714 2014 54 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-013-9493-9 db/journals/mst/mst54.html#AltAEHHKKMP14

Hee-Kap Ahn Helmut Alt Sang Won Bae 0001 Dongwoo Park Bundling Three Convex Polygons to Minimize Area or Perimeter. 13-24 2013 WADS https://doi.org/10.1007/978-3-642-40104-6_2 conf/wads/2013 db/conf/wads/wads2013.html#AhnABP13

Helmut Alt Ludmila Scharf Shape matching by random sampling. 2-12 2012 442 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2010.03.023 db/journals/tcs/tcs442.html#AltS12

Helmut Alt Ludmila Scharf Computation of the Hausdorff distance between sets of line segments in parallel http://arxiv.org/abs/1207.3962 2012 CoRR abs/1207.3962 db/journals/corr/corr1207.html#abs-1207-3962

Helmut Alt Fast Sorting Algorithms. 17-25 2011 Algorithms Unplugged https://doi.org/10.1007/978-3-642-15328-0_3 books/sp/voecking11 db/books/collections/Voecking2011.html#Alt11 Berthold Vöcking Helmut Alt Martin Dietzfelbinger Rüdiger Reischuk Christian Scheideler Heribert Vollmer Dorothea Wagner Algorithms Unplugged Algorithms Unplugged Springer 2011 978-3-642-15327-3 https://doi.org/10.1007/978-3-642-15328-0 db/books/collections/Voecking2011.html

Helmut Alt Sergio Cabello Panos Giannopoulos Christian Knauer Minimum cell connection and separation in line segment arrangements http://arxiv.org/abs/1104.4618 2011 CoRR abs/1104.4618 db/journals/corr/corr1104.html#abs-1104-4618

Helmut Alt Ludmila Scharf Daria Schymura Probabilistic matching of planar regions. 99-114 2010 43 Comput. Geom. 2 https://doi.org/10.1016/j.comgeo.2009.04.006 db/journals/comgeo/comgeo43.html#AltSS10

Helmut Alt Maike Buchin Can We Compute the Similarity between Surfaces? 78-99 2010 43 Discret. Comput. Geom. 1 https://doi.org/10.1007/s00454-009-9152-8 https://www.wikidata.org/entity/Q61632376 db/journals/dcg/dcg43.html#AltB10

Hee-Kap Ahn Helmut Alt Tetsuo Asano Sang Won Bae 0001 Peter Brass Otfried Cheong Christian Knauer Hyeon-Suk Na Chan-Su Shin Alexander Wolff 0001 Constructing Optimal Highways. 3-23 2009 20 Int. J. Found. Comput. Sci. 1 https://doi.org/10.1142/S0129054109006425 db/journals/ijfcs/ijfcs20.html#AhnAABBCKNSW09

Helmut Alt Hans L. Bodlaender Marc J. van Kreveld Günter Rote Gerard Tel Wooden Geometric Puzzles: Design and Hardness Proofs. 160-174 2009 44 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-008-9104-3 https://www.wikidata.org/entity/Q59567703 db/journals/mst/mst44.html#AltBKRT09

Helmut Alt The Computational Geometry of Comparing Shapes. 235-248 2009 Efficient Algorithms https://doi.org/10.1007/978-3-642-03456-5_16 conf/birthday/2009mehlhorn db/conf/birthday/mehlhorn2009.html#Alt09 Helmut Alt Ludmila Scharf Shape Matching by Random Sampling. 381-393 2009 WALCOM https://doi.org/10.1007/978-3-642-00202-1_33 conf/walcom/2009 db/conf/walcom/walcom2009.html#AltS09 Susanne Albers Helmut Alt Stefan Näher Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday 5760 2009 https://doi.org/10.1007/978-3-642-03456-5 https://www.wikidata.org/entity/Q29543753 978-3-642-03455-8 Efficient Algorithms Lecture Notes in Computer Science Springer db/conf/birthday/mehlhorn2009.html Pankaj Kumar Agarwal Helmut Alt Monique Teillaud Computational Geometry, 08.03. - 13.03.2009 Computational Geometry 09111 2009 Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany Dagstuhl Seminar Proceedings db/conf/dagstuhl/P9111.html http://drops.dagstuhl.de/portals/09111/ Pankaj Kumar Agarwal Helmut Alt Monique Teillaud 09111 Abstracts Collection - Computational Geometry. 2009 Computational Geometry http://drops.dagstuhl.de/opus/volltexte/2009/2034/ conf/dagstuhl/2009P9111 db/conf/dagstuhl/P9111.html#AgarwalAT09

Helmut Alt Ludmila Scharf Daria Schymura Probabilistic Matching of Planar Regions http://arxiv.org/abs/0902.4337 2009 CoRR abs/0902.4337 db/journals/corr/corr0902.html#abs-0902-4337

Helmut Alt Ludmila Scharf Computing the Hausdorff Distance between Curved Objects. 307-320 2008 18 Int. J. Comput. Geom. Appl. 4 https://doi.org/10.1142/S0218195908002647 db/journals/ijcga/ijcga18.html#AltS08

Helmut Alt Schnelle Sortieralgorithmen. 21-30 2008 Taschenbuch der Algorithmen https://doi.org/10.1007/978-3-540-76394-9_3 reference/algo/2008t db/reference/algo/taschenbuch2008.html#Alt08 Berthold Vöcking Helmut Alt Martin Dietzfelbinger Rüdiger Reischuk Christian Scheideler Heribert Vollmer Dorothea Wagner Taschenbuch der Algorithmen eXamen.press Springer 2008 978-3-540-76393-2 db/reference/algo/taschenbuch2008.html Hee-Kap Ahn Helmut Alt Tetsuo Asano Sang Won Bae 0001 Peter Brass Otfried Cheong Christian Knauer Hyeon-Suk Na Chan-Su Shin Alexander Wolff 0001 Constructing Optimal Highways. 7-14 2007 CATS http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV65Ahn.html conf/cats/2007 db/conf/cats/cats2007.html#AhnAABBCKNSW07 Helmut Alt Ludmila Scharf Sven Scholz Probabilistic matching and resemblance evaluation of shapes in trademark images. 533-540 2007 conf/civr/2007 CIVR https://doi.org/10.1145/1282280.1282357 db/conf/civr/civr2007.html#AltSS07 Helmut Alt Hans L. Bodlaender Marc J. van Kreveld Günter Rote Gerard Tel Wooden Geometric Puzzles: Design and Hardness Proofs. 16-29 2007 conf/fun/2007 FUN https://doi.org/10.1007/978-3-540-72914-3_4 db/conf/fun/fun2007.html#AltBKRT07

Helmut Alt Maike Buchin Can we Compute the Similarity Between Surfaces? http://arxiv.org/abs/cs/0703011 2007 CoRR abs/cs/0703011 db/journals/corr/corr0703.html#abs-cs-0703011

Hee-Kap Ahn Helmut Alt Tetsuo Asano Sang Won Bae 0001 Peter Brass Otfried Cheong Christian Knauer Hyeon-Suk Na Chan-Su Shin Alexander Wolff 0001 Constructing Optimal Highways http://arxiv.org/abs/cs/0703037 2007 CoRR abs/cs/0703037 db/journals/corr/corr0703.html#abs-cs-0703037

Helmut Alt Esther M. Arkin Hervé Brönnimann Jeff Erickson 0001 Sándor P. Fekete Christian Knauer Jonathan Lenchner Joseph S. B. Mitchell Kim Whittlesey Minimum-cost coverage of point sets by disks. 449-458 2006 conf/compgeom/2006 SCG https://doi.org/10.1145/1137856.1137922 db/conf/compgeom/compgeom2006.html#AltABEFKLMW06

Helmut Alt Otfried Cheong Antoine Vigneron The Voronoi Diagram of Curved Objects. 439-453 2005 34 Discret. Comput. Geom. 3 https://doi.org/10.1007/s00454-005-1192-0 db/journals/dcg/dcg34.html#AltCV05

Helmut Alt Foreword. 133 2005 38 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-004-3802-2 db/journals/mst/mst38.html#Alt05

Helmut Alt Maike Buchin Semi-computability of the Fréchet distance between surfaces. 45-48 2005 EuroCG http://www.win.tue.nl/EWCG2005/Proceedings/12.pdf conf/ewcg/2005 db/conf/ewcg/ewcg2005.html#AltB05

Helmut Alt Christian Knauer Carola Wenk Comparison of Distance Measures for Planar Curves. 45-58 2004 38 Algorithmica 1 https://doi.org/10.1007/s00453-003-1042-5 db/journals/algorithmica/algorithmica38.html#AltKW03

Helmut Alt Alon Efrat Günter Rote Carola Wenk Matching planar maps. 262-283 2003 49 J. Algorithms 2 https://doi.org/10.1016/S0196-6774(03)00085-3 db/journals/jal/jal49.html#AltERW03

Helmut Alt Marc Glisse Xavier Goaoc On the worst-case complexity of the silhouette of a polytope. 51-55 2003 conf/cccg/2003 CCCG db/conf/cccg/cccg2003.html#AltGG03 http://www.cccg.ca/proceedings/2003/12.pdf Helmut Alt Christian Knauer Günter Rote Sue Whitesides The complexity of (un)folding. 164-170 2003 conf/compgeom/2003 SCG https://doi.org/10.1145/777792.777818 db/conf/compgeom/compgeom2003.html#AltKRW03 Carola Wenk Helmut Alt Alon Efrat Lingeshwaran Palaniappan Günter Rote Finding a curve in a map. 384-385 2003 conf/compgeom/2003 SCG https://doi.org/10.1145/777792.777855 db/conf/compgeom/compgeom2003.html#WenkAEPR03 Helmut Alt Alon Efrat Günter Rote Carola Wenk Matching planar maps. 589-598 2003 conf/soda/2003 SODA http://dl.acm.org/citation.cfm?id=644108.644207 db/conf/soda/soda2003.html#AltERW03 Helmut Alt Michel Habib STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings STACS Lecture Notes in Computer Science 2607 Springer 2003 3-540-00623-0 https://doi.org/10.1007/3-540-36494-3 db/conf/stacs/stacs2003.html 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 STACS Lecture Notes in Computer Science 2285 Springer 2002 3-540-43283-3 https://doi.org/10.1007/3-540-45841-7 db/conf/stacs/stacs2002.html Helmut Alt The Nearest Neighbor. 13-24 2001 conf/ac/2001cdm Computational Discrete Mathematics https://doi.org/10.1007/3-540-45506-X_2 db/conf/ac/cdm2001.html#Alt01 Helmut Alt Laura Heinrich-Litan Exact L<sub>infty</sub> Nearest Neighbor Search in High Dimensions. 157-163 2001 conf/compgeom/2001 SCG https://doi.org/10.1145/378583.378655 db/conf/compgeom/compgeom2001.html#AltH01 Helmut Alt Christian Knauer Carola Wenk Matching Polygonal Curves with Respect to the Fréchet Distance. 63-74 2001 conf/stacs/2001 STACS https://doi.org/10.1007/3-540-44693-1_6 db/conf/stacs/stacs2001.html#AltKW01 Helmut Alt Computational Discrete Mathematics, Advanced Lectures Computational Discrete Mathematics Lecture Notes in Computer Science 2122 Springer 2001 3-540-42775-9 https://doi.org/10.1007/3-540-45506-X db/conf/ac/cdm2001.html

Helmut Alt Stefan Felsner Ferran Hurtado Marc Noy Emo Welzl A class of point-sets with few k-sets. 95-101 2000 16 Comput. Geom. 2 db/journals/comgeo/comgeo16.html#AltFHNW00 https://doi.org/10.1016/S0925-7721(00)00006-7 https://www.wikidata.org/entity/Q54309073

Helmut Alt Ferran Hurtado Packing Convex Polygons into Rectangular Boxes. 67-80 2000 conf/jcdcg/2000 JCDCG https://doi.org/10.1007/3-540-47738-1_5 db/conf/jcdcg/jcdcg2000.html#AltH00 Helmut Alt Leonidas J. Guibas Discrete Geometric Shapes: Matching, Interpolation, and Approximation. 121-153 2000 Handbook of Computational Geometry https://doi.org/10.1016/b978-044482537-7/50004-8 books/el/00/SU2000 db/books/collections/SU2000.html#AltG00

Helmut Alt Ulrich Fuchs 0001 Klaus Kriegel On The Number Of Simple Cycles In Planar Graphs. 1999 8 Comb. Probab. Comput. 5 db/journals/cpc/cpc8.html#AltFK99 http://journals.cambridge.org/action/displayAbstract?aid=46739 397-405

Helmut Alt Ulrich Fuchs 0001 Günter Rote Gerald Weber Matching Convex Shapes with Respect to the Symmetric Difference. 89-103 1998 21 Algorithmica 1 db/journals/algorithmica/algorithmica21.html#AltFRW98 https://doi.org/10.1007/PL00009210

Helmut Alt Michael Godau Sue Whitesides Universal 3-dimensional visibility representations for graphs. 111-125 1998 9 Comput. Geom. 1-2 db/journals/comgeo/comgeo9.html#AltGW98 https://doi.org/10.1016/S0925-7721(97)00015-1

Helmut Alt Stefan Felsner Ferran Hurtado Marc Noy Point-Sets with few <i>k</i>-Sets. 200-205 1998 conf/compgeom/1998 SCG https://doi.org/10.1145/276884.276907 db/conf/compgeom/compgeom98.html#AltFHN98

Oswin Aichholzer Helmut Alt Günter Rote Matching Shapes with a Reference Point. 349-363 1997 7 Int. J. Comput. Geom. Appl. 4 db/journals/ijcga/ijcga7.html#AichholzerAR97 https://doi.org/10.1142/S0218195997000211

Helmut Alt Emo Welzl Barbara Wolfers Piecewise Linear Approximation of Bézier-Curves. 433-435 1997 conf/compgeom/1997 SCG https://doi.org/10.1145/262839.263068 db/conf/compgeom/compgeom97.html#AltWW97 Helmut Alt Ulrich Fuchs 0001 Klaus Kriegel On the Number of Simple Cycles in Planar Graphs. 15-24 1997 conf/wg/1997 WG db/conf/wg/wg97.html#AltFK97 https://doi.org/10.1007/BFb0024484

Helmut Alt Leonidas J. Guibas Kurt Mehlhorn Richard M. Karp Avi Wigderson A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. 543-547 1996 16 Algorithmica 4/5 db/journals/algorithmica/algorithmica16.html#AltGMKW96 https://doi.org/10.1007/BF01940879 https://www.wikidata.org/entity/Q103822054

Helmut Alt Ulrich Fuchs 0001 Günter Rote Gerald Weber Matching Convex Shapes with Respect to the Symmetric Difference. 320-333 1996 conf/esa/1996 ESA db/conf/esa/esa96.html#AltFRW96 https://doi.org/10.1007/3-540-61680-2_65

Helmut Alt Bernd Behrends Johannes Blömer Approximate Matching of Polygonal Shapes. 251-265 1995 13 Ann. Math. Artif. Intell. 3-4 db/journals/amai/amai13.html#AltBB95 https://doi.org/10.1007/BF01530830

Helmut Alt Michael Godau Computing the Fréchet distance between two polygonal curves. 75-91 1995 5 Int. J. Comput. Geom. Appl. db/journals/ijcga/ijcga5.html#AltG95 https://doi.org/10.1142/S0218195995000064 https://www.wikidata.org/entity/Q61632357

Helmut Alt David Hsu Jack Snoeyink Computing the largest inscribed isothetic rectangle. 67-72 1995 CCCG http://www.cccg.ca/proceedings/1995/cccg1995_0011.pdf conf/cccg/1995 db/conf/cccg/cccg1995.html#AltHS95 Helmut Alt Otfried Schwarzkopf The Voronoi Diagram of Curved Objects. 89-97 1995 conf/compgeom/1995 SCG https://doi.org/10.1145/220279.220289 db/conf/compgeom/compgeom95.html#AltS95 Helmut Alt Michael Godau Sue Whitesides Universal 3-Dimensional Visibility Representations for Graphs. 8-19 1995 conf/gd/1995 GD db/conf/gd/gd95.html#AltGW95 https://doi.org/10.1007/BFb0021785

Gerald Weber Lars Knipping Helmut Alt An Application of Point Pattern Matching in Astronautics. 321-340 1994 17 J. Symb. Comput. 4 db/journals/jsc/jsc17.html#WeberKH94 https://doi.org/10.1006/jsco.1994.1022

Helmut Alt Oswin Aichholzer Günter Rote Matching Shapes with a Reference Point. 85-92 1994 conf/compgeom/1994 SCG https://doi.org/10.1145/177424.177555 db/conf/compgeom/compgeom94.html#AltAR94

Helmut Alt Rudolf Fleischer Michael Kaufmann 0001 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. 391-406 1992 8 Algorithmica 5&6 db/journals/algorithmica/algorithmica8.html#AltFKMNSU92 https://doi.org/10.1007/BF01758853

Helmut Alt Viliam Geffert Kurt Mehlhorn A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. 25-27 1992 42 Inf. Process. Lett. 1 db/journals/ipl/ipl42.html#AltGM92 https://doi.org/10.1016/0020-0190(92)90127-H

Helmut Alt Michael Godau Measuring the Resemblance of Polygonal Curves. 102-109 1992 conf/compgeom/1992 SCG https://doi.org/10.1145/142675.142699 db/conf/compgeom/compgeom92.html#AltG92 Helmut Alt Johannes Blömer Resemblance and Symmetries of Geometric Patterns. 1-24 1992 conf/dfg/1992 Data Structures and Efficient Algorithms db/conf/dfg/dfg1992.html#AltB92 https://doi.org/10.1007/3-540-55488-2_19

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). 237-240 1991 37 Inf. Process. Lett. 4 db/journals/ipl/ipl37.html#AltBMP91 https://doi.org/10.1016/0020-0190(91)90195-N https://www.wikidata.org/entity/Q56626048

Helmut Alt Bernd Behrends Johannes Blömer Approximate Matching of Polygonal Shapes (Extended Abstract). 186-193 1991 conf/compgeom/1991 SCG https://doi.org/10.1145/109648.109669 db/conf/compgeom/compgeom91.html#AltBB91 Helmut Alt Rudolf Fleischer Michael Kaufmann 0001 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. 281-289 1990 conf/compgeom/1990 SCG https://doi.org/10.1145/98524.98592 db/conf/compgeom/compgeom90.html#AltFKMNSU90 Helmut Alt Johannes Blömer Hubert Wagener Approximation of Convex Polygons. 703-716 1990 conf/icalp/1990 ICALP db/conf/icalp/icalp90.html#AltBW90 https://doi.org/10.1007/BFb0032068 Chee-Keng Yap Helmut Alt Motion Planning in the CL-Environment (Extended Abstract). 373-380 1989 conf/wads/1989 WADS db/conf/wads/wads89.html#YapA89 https://doi.org/10.1007/3-540-51542-9_31

Helmut Alt Kurt Mehlhorn Hubert Wagener Emo Welzl Congruence, Similarity, and Symmetries of Geometric Objects. 237-256 1988 3 Discret. Comput. Geom. db/journals/dcg/dcg3.html#AltMWW88 https://doi.org/10.1007/BF02187910 https://www.wikidata.org/entity/Q54309778

Helmut Alt Hubert Wagener Approximation of Polygons by Rechtangles and Circles. 103-112 1988 36 Bull. EATCS db/journals/eatcs/eatcs36.html#AltW88

Helmut Alt Comparing the combinational complexities of arithmetic functions. 447-460 1988 35 J. ACM 2 https://doi.org/10.1145/42282.214084 https://www.wikidata.org/entity/Q130116438 db/journals/jacm/jacm35.html#Alt88

Helmut Alt Emo Welzl Visibility graphs and obstacle-avoiding shortest paths. 145-164 1988 32 ZOR Methods Model. Oper. Res. 3-4 https://doi.org/10.1007/BF01928918 https://www.wikidata.org/entity/Q54309800 db/journals/mmor/mmor32.html#AltW88

Kurt Mehlhorn Stefan Näher Helmut Alt A Lower Bound on the Complexity of the Union-Split-Find Problem. 1093-1102 1988 17 SIAM J. Comput. 6 db/journals/siamcomp/siamcomp17.html#MehlhornNA88 https://doi.org/10.1137/0217070

Helmut Alt Torben Hagerup Kurt Mehlhorn Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. 808-835 1987 16 SIAM J. Comput. 5 db/journals/siamcomp/siamcomp16.html#AltHMP87 https://doi.org/10.1137/0216053

Helmut Alt Kurt Mehlhorn Hubert Wagener Emo Welzl Congruence, Similarity, and Symmetries of Geometric Objects. 308-315 1987 conf/compgeom/1987 SCG https://doi.org/10.1145/41958.41991 db/conf/compgeom/compgeom87.html#AltMWW87 Kurt Mehlhorn Stefan Näher Helmut Alt A Lower Bound for the Complexity of the Union-Split-Find Problem. 479-488 1987 conf/icalp/1987 ICALP db/conf/icalp/icalp87.html#MehlhornNA87 https://doi.org/10.1007/3-540-18088-5_41 Helmut Alt Torben Hagerup Kurt Mehlhorn Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. 11-15 1987 conf/paa/1987 Parallel Algorithms and Architectures db/conf/paa/paa1987.html#AltHMP87 https://doi.org/10.1007/3-540-18099-0_24 Helmut Alt Torben Hagerup Kurt Mehlhorn Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. 199-208 1986 conf/mfcs/1986 MFCS db/conf/mfcs/mfcs86.html#AltHMP86 https://doi.org/10.1007/BFb0016243

Helmut Alt Kurt Mehlhorn Searching Semisorted Tables. 840-848 1985 14 SIAM J. Comput. 4 db/journals/siamcomp/siamcomp14.html#AltM85 https://doi.org/10.1137/0214059

Helmut Alt Multiplication is the Easiest Nontrivial Arithmetic Function. 333-339 1985 36 Theor. Comput. Sci. db/journals/tcs/tcs36.html#Alt85 https://doi.org/10.1016/0304-3975(85)90051-9

Helmut Alt Kurt Mehlhorn J. Ian Munro Partial Match Retrieval in Implicit Data Structures. 61-65 1984 19 Inf. Process. Lett. 2 db/journals/ipl/ipl19.html#AltMM84 https://doi.org/10.1016/0020-0190(84)90098-X

Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract) Helmut Alt 466-470 conf/stoc/STOC16 1984 STOC db/conf/stoc/stoc84.html#Alt84 https://doi.org/10.1145/800057.808714 Multiplication Is the Easiest Nontrivial Arithmetic Function Helmut Alt 320-322 conf/focs/FOCS24 1983 FOCS db/conf/focs/focs83.html#Alt83 https://doi.org/10.1109/SFCS.1983.36 https://doi.ieeecomputersociety.org/10.1109/SFCS.1983.36

Helmut Alt Jan van Leeuwen The complexity of basic complex operations. 205-215 1981 27 Computing 3 https://doi.org/10.1007/BF02237978 db/journals/computing/computing27.html#AltL81

Helmut Alt Kurt Mehlhorn J. Ian Munro Partial Match Retrieval in Implicit Data Structures. 156-161 1981 conf/mfcs/1981 MFCS db/conf/mfcs/mfcs81.html#AltMM81 https://doi.org/10.1007/3-540-10856-4_81 Helmut Alt Functions Equivalent to Integer Multiplication. 30-37 1980 conf/icalp/1980 ICALP db/conf/icalp/icalp80.html#Alt80 https://doi.org/10.1007/3-540-10003-2_57

Helmut Alt Lower Bounds on Space Complexity for Contextfree Recognition. 33-61 1979 12 Acta Informatica db/journals/acta/acta12.html#Alt79 https://doi.org/10.1007/BF00264016

Helmut Alt Square rooting is as difficult as multiplication. 221-232 1979 21 Computing 3 https://doi.org/10.1007/BF02253055 db/journals/computing/computing21.html#Alt79

Helmut Alt Kurt Mehlhorn Complexity arguments in algebraic language theory. 1979 13 RAIRO Theor. Informatics Appl. 3 db/journals/ita/ita13.html#AltM79 https://doi.org/10.1051/ita/1979130302171 217-225

Helmut Alt Jan van Leeuwen The complexity of complex division (extended abstract). 13-17 1979 conf/fct/1979 FCT db/conf/fct/fct79.html#AltL79 Helmut Alt Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen. 123-131 1977 conf/tcs/1977 Theoretical Computer Science db/conf/tcs/tcs1977.html#Alt77 https://doi.org/10.1007/3-540-08138-0_10 Helmut Alt Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen. 1976 1-76 Saarland University, Saarbrücken, Germany https://d-nb.info/770774059 Helmut Alt Kurt Mehlhorn Lower Bounds for the Space Complexity of Context-Free Recognition. 338-354 1976 conf/icalp/1976 ICALP db/conf/icalp/icalp76.html#AltM76

Helmut Alt Kurt Mehlhorn A language over a one symbol alphabet requiring only O (log log n) space. 31-33 1975 7 SIGACT News 4 https://doi.org/10.1145/990502.990506 db/journals/sigact/sigact7.html#AltM75

Pankaj K. AgarwalPankaj Kumar Agarwal Hee-Kap Ahn Oswin Aichholzer Susanne Albers Esther M. Arkin Tetsuo Asano Sang Won Bae 0001 Bernd Behrends Mark de Berg Johannes Blömer Norbert Blum Hans L. Bodlaender Peter BraßPeter Brass Hervé Brönnimann Kevin Buchin Maike Buchin Sergio Cabello Steven Chaplick Otfried CheongOtfried Schwarzkopf Martin Dietzfelbinger Alon Efrat Jeff Erickson 0001 Sándor P. Fekete Stefan Felsner Afonso Ferreira Rudolf Fleischer Ulrich Fuchs 0001 Viliam Geffert Panos Giannopoulos Marc Glisse Xavier Goaoc Michael Godau Leonidas J. Guibas Michel Habib Torben Hagerup George Hart Laura Heinrich-Litan David Hsu Ferran Hurtado Richard M. Karp Michael Kaufmann 0001 Philipp Kindermann Christian Knauer Lars Knipping Irina Kostitsyna Marc J. van Kreveld Klaus Kriegel Alexander Kröller Jan van Leeuwen Jonathan Lenchner Kurt Mehlhorn Joseph S. B. Mitchell J. Ian Munro Hyeon-Suk Na Stefan Näher Marc Noy Eunjin Oh 0001 Lingeshwaran Palaniappan Dongwoo Park Ji-won Park Markus Paul Michael S. Payne Valentin Polishchuk Franco P. Preparata Rüdiger Reischuk Günter Rote Ludmila Scharf Christian Scheideler Stefan Schirra Jens M. Schmidt Sven Scholz Daria Schymura Nadja SeiferthNadja Scharf Chan-Su Shin Jack Snoeyink Fabian Stehn Monique Teillaud Gerard Tel Christian Uhrig Antoine Vigneron Berthold Vöcking Heribert Vollmer Hubert Wagener Dorothea Wagner Gerald Weber Emo Welzl Carola Wenk Sue Whitesides Kim Whittlesey Avi Wigderson Barbara Wolfers Alexander Wolff 0001 David R. Wood Chee-Keng Yap