| 2019 | WALCOM | Packing 2D Disks into a 3D Container. | Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Scharf |
| 2017 | ISAAC | Placing your Coins on a Shelf. | Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn |
| 2016 | ISAAC | Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. | Helmut Alt, Nadja Scharf |
| 2016 | LATIN | A Middle Curve Based on Discrete Frchet Distance. | Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk |
| 2015 | ESA | Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. | Helmut Alt, Mark de Berg, Christian Knauer |
| 2013 | WADS | Bundling Three Convex Polygons to Minimize Area or Perimeter. | Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park |
| 2009 | WALCOM | Shape Matching by Random Sampling. | Helmut Alt, Ludmila Scharf |
| 2007 | FUN | Wooden Geometric Puzzles: Design and Hardness Proofs. | Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Gnter Rote, Gerard Tel |
| 2003 | SODA | Matching planar maps. | Helmut Alt, Alon Efrat, Gnter Rote, Carola Wenk |
| 2001 | STACS | Matching Polygonal Curves with Respect to the Frchet Distance. | Helmut Alt, Christian Knauer, Carola Wenk |
| 1997 | WG | On the Number of Simple Cycles in Planar Graphs. | Helmut Alt, Ulrich Fuchs, Klaus Kriegel |
| 1996 | ESA | Matching Convex Shapes with Respect to the Symmetric Difference. | Helmut Alt, Ulrich Fuchs, Gnter Rote, Gerald Weber |
| 1995 | GD | Universal 3-Dimensional Visibility Representations for Graphs. | Helmut Alt, Michael Godau, Sue Whitesides |
| 1990 | ICALP | Approximation of Convex Polygons. | Helmut Alt, Johannes Blmer, Hubert Wagener |
| 1989 | WADS | Motion Planning in the CL-Environment (Extended Abstract). | Chee-Keng Yap, Helmut Alt |
| 1987 | ICALP | A Lower Bound for the Complexity of the Union-Split-Find Problem. | Kurt Mehlhorn, Stefan Nher, Helmut Alt |
| 1986 | MFCS | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. | Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata |
| 1984 | STOC | Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract) | Helmut Alt |
| 1983 | FOCS | Multiplication Is the Easiest Nontrivial Arithmetic Function | Helmut Alt |
| 1981 | MFCS | Partial Match Retrieval in Implicit Data Structures. | Helmut Alt, Kurt Mehlhorn, J. Ian Munro |
| 1980 | ICALP | Functions Equivalent to Integer Multiplication. | Helmut Alt |
| 1979 | FCT | The complexity of complex division (extended abstract). | Helmut Alt, Jan van Leeuwen |
| 1976 | ICALP | Lower Bounds for the Space Complexity of Context-Free Recognition. | Helmut Alt, Kurt Mehlhorn |