Helmut Alt - RankMe

112 papers A* 9A 6B 11C 1Misc 1Journal 54Unranked 22

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Packing d-dimensional balls into a d + 1-dimensional container. Comput. Geom. Helmut Alt, Sergio Cabello, Otfried Cheong, Ji-won Park, Nadja Seiferth
2021	J	`jnl`	Packing 2D disks into a 3D container. CoRR Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Seiferth
2020	J	`jnl`	Middle curves based on discrete Fréchet distance. Comput. Geom. Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
2019	B	`conf`	Packing 2D Disks into a 3D Container. WALCOM Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Scharf
2018	J	`jnl`	Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. Int. J. Comput. Geom. Appl. Helmut Alt, Nadja Scharf
2018	J	`jnl`	Placing your coins on a shelf. J. Comput. Geom. Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn
2017	J	`jnl`	Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. J. Comput. Geom. Helmut Alt, Mark de Berg, Christian Knauer
2017	J	`jnl`	Minimum Cell Connection in Line Segment Arrangements. Int. J. Comput. Geom. Appl. Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer
2017	B	`conf`	Placing your Coins on a Shelf. ISAAC Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn
2017	J	`jnl`	Placing your Coins on a Shelf. CoRR Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn
2016	B	`conf`	A Middle Curve Based on Discrete Fréchet Distance. LATIN Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
2016	B	`conf`	Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. ISAAC Helmut Alt, Nadja Scharf
2016	J	`jnl`	Approximating Smallest Containers for Packing Three-dimensional Convex Objects. CoRR Helmut Alt, Nadja Scharf
2016	J	`jnl`	Bundling three convex polygons to minimize area or perimeter. Comput. Geom. Dongwoo Park, Sang Won Bae, Helmut Alt, Hee-Kap Ahn
2016	J	`jnl`	Computational Aspects of Packing Problems. Bull. EATCS Helmut Alt
2016	J	`jnl`	Thoughts on Barnette's Conjecture. Australas. J Comb. Helmut Alt, Michael S. Payne, Jens M. Schmidt, David R. Wood
2015	A	`conf`	Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. ESA Helmut Alt, Mark de Berg, Christian Knauer
2014	J	`jnl`	Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing. Theory Comput. Syst. Helmut Alt, Esther M. Arkin, Alon Efrat, George Hart, Ferran Hurtado, Irina Kostitsyna, Alexander Kröller, Joseph S. B. Mitchell, Valentin Polishchuk
2013	B	`conf`	Bundling Three Convex Polygons to Minimize Area or Perimeter. WADS Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park
2012	J	`jnl`	Computation of the Hausdorff distance between sets of line segments in parallel CoRR Helmut Alt, Ludmila Scharf
2012	J	`jnl`	Shape matching by random sampling. Theor. Comput. Sci. Helmut Alt, Ludmila Scharf
2011	—	`book`	Algorithms Unplugged Algorithms Unplugged Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner
2011	—	`ch.`	Fast Sorting Algorithms. Algorithms Unplugged Helmut Alt
2011	J	`jnl`	Minimum cell connection and separation in line segment arrangements CoRR Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer
2010	J	`jnl`	Can We Compute the Similarity between Surfaces? Discret. Comput. Geom. Helmut Alt, Maike Buchin
2010	J	`jnl`	Probabilistic matching of planar regions. Comput. Geom. Helmut Alt, Ludmila Scharf, Daria Schymura
2009	A*	`conf`	09111 Abstracts Collection - Computational Geometry. Computational Geometry Pankaj Kumar Agarwal, Helmut Alt, Monique Teillaud
2009	A*	`ed.`	Computational Geometry, 08.03. - 13.03.2009 Computational Geometry Pankaj Kumar Agarwal, Helmut Alt, Monique Teillaud
2009	J	`jnl`	Constructing Optimal Highways. Int. J. Found. Comput. Sci. Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
2009	—	`ed.`	Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday Efficient Algorithms Susanne Albers, Helmut Alt, Stefan Näher
2009	J	`jnl`	Probabilistic Matching of Planar Regions CoRR Helmut Alt, Ludmila Scharf, Daria Schymura
2009	B	`conf`	Shape Matching by Random Sampling. WALCOM Helmut Alt, Ludmila Scharf
2009	—	`conf`	The Computational Geometry of Comparing Shapes. Efficient Algorithms Helmut Alt
2009	J	`jnl`	Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst. Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
2008	J	`jnl`	Computing the Hausdorff Distance between Curved Objects. Int. J. Comput. Geom. Appl. Helmut Alt, Ludmila Scharf
2008	—	`ch.`	Schnelle Sortieralgorithmen. Taschenbuch der Algorithmen Helmut Alt
2008	—	`book`	Taschenbuch der Algorithmen Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner
2007	J	`jnl`	Can we Compute the Similarity Between Surfaces? CoRR Helmut Alt, Maike Buchin
2007	J	`jnl`	Constructing Optimal Highways CoRR Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
2007	—	`conf`	Constructing Optimal Highways. CATS Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
2007	—	`conf`	Probabilistic matching and resemblance evaluation of shapes in trademark images. CIVR Helmut Alt, Ludmila Scharf, Sven Scholz
2007	Misc	`conf`	Wooden Geometric Puzzles: Design and Hardness Proofs. FUN Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
2006	—	`conf`	Minimum-cost coverage of point sets by disks. SCG Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
2005	J	`jnl`	Foreword. Theory Comput. Syst. Helmut Alt
2005	C	`conf`	Semi-computability of the Fréchet distance between surfaces. EuroCG Helmut Alt, Maike Buchin
2005	J	`jnl`	The Voronoi Diagram of Curved Objects. Discret. Comput. Geom. Helmut Alt, Otfried Cheong, Antoine Vigneron
2004	J	`jnl`	Comparison of Distance Measures for Planar Curves. Algorithmica Helmut Alt, Christian Knauer, Carola Wenk
2003	—	`conf`	Finding a curve in a map. SCG Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote
2003	A*	`conf`	Matching planar maps. SODA Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
2003	J	`jnl`	Matching planar maps. J. Algorithms Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
2003	—	`conf`	On the worst-case complexity of the silhouette of a polytope. CCCG Helmut Alt, Marc Glisse, Xavier Goaoc
2003	A	`ed.`	STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings STACS Helmut Alt, Michel Habib
2003	—	`conf`	The complexity of (un)folding. SCG Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
2002	A	`ed.`	STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings STACS Helmut Alt, Afonso Ferreira
2001	—	`ed.`	Computational Discrete Mathematics, Advanced Lectures Computational Discrete Mathematics Helmut Alt
2001	—	`conf`	Exact L SCG Helmut Alt, Laura Heinrich-Litan
2001	A	`conf`	Matching Polygonal Curves with Respect to the Fréchet Distance. STACS Helmut Alt, Christian Knauer, Carola Wenk
2001	—	`conf`	The Nearest Neighbor. Computational Discrete Mathematics Helmut Alt
2000	J	`jnl`	A class of point-sets with few k-sets. Comput. Geom. Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl
2000	—	`ch.`	Discrete Geometric Shapes: Matching, Interpolation, and Approximation. Handbook of Computational Geometry Helmut Alt, Leonidas J. Guibas
2000	—	`conf`	Packing Convex Polygons into Rectangular Boxes. JCDCG Helmut Alt, Ferran Hurtado
1999	J	`jnl`	On The Number Of Simple Cycles In Planar Graphs. Comb. Probab. Comput. Helmut Alt, Ulrich Fuchs, Klaus Kriegel
1998	J	`jnl`	Matching Convex Shapes with Respect to the Symmetric Difference. Algorithmica Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
1998	—	`conf`	Point-Sets with few SCG Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy
1998	J	`jnl`	Universal 3-dimensional visibility representations for graphs. Comput. Geom. Helmut Alt, Michael Godau, Sue Whitesides
1997	J	`jnl`	Matching Shapes with a Reference Point. Int. J. Comput. Geom. Appl. Oswin Aichholzer, Helmut Alt, Günter Rote
1997	B	`conf`	On the Number of Simple Cycles in Planar Graphs. WG Helmut Alt, Ulrich Fuchs, Klaus Kriegel
1997	—	`conf`	Piecewise Linear Approximation of Bézier-Curves. SCG Helmut Alt, Emo Welzl, Barbara Wolfers
1996	J	`jnl`	A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson
1996	A	`conf`	Matching Convex Shapes with Respect to the Symmetric Difference. ESA Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
1995	J	`jnl`	Approximate Matching of Polygonal Shapes. Ann. Math. Artif. Intell. Helmut Alt, Bernd Behrends, Johannes Blömer
1995	J	`jnl`	Computing the Fréchet distance between two polygonal curves. Int. J. Comput. Geom. Appl. Helmut Alt, Michael Godau
1995	—	`conf`	Computing the largest inscribed isothetic rectangle. CCCG Helmut Alt, David Hsu, Jack Snoeyink
1995	—	`conf`	The Voronoi Diagram of Curved Objects. SCG Helmut Alt, Otfried Schwarzkopf
1995	A	`conf`	Universal 3-Dimensional Visibility Representations for Graphs. GD Helmut Alt, Michael Godau, Sue Whitesides
1994	J	`jnl`	An Application of Point Pattern Matching in Astronautics. J. Symb. Comput. Gerald Weber, Lars Knipping, Helmut Alt
1994	—	`conf`	Matching Shapes with a Reference Point. SCG Helmut Alt, Oswin Aichholzer, Günter Rote
1992	J	`jnl`	A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. Inf. Process. Lett. Helmut Alt, Viliam Geffert, Kurt Mehlhorn
1992	J	`jnl`	Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1992	—	`conf`	Measuring the Resemblance of Polygonal Curves. SCG Helmut Alt, Michael Godau
1992	—	`conf`	Resemblance and Symmetries of Geometric Patterns. Data Structures and Efficient Algorithms Helmut Alt, Johannes Blömer
1991	—	`conf`	Approximate Matching of Polygonal Shapes (Extended Abstract). SCG Helmut Alt, Bernd Behrends, Johannes Blömer
1991	J	`jnl`	Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). Inf. Process. Lett. Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul
1990	—	`conf`	Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. SCG Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1990	A*	`conf`	Approximation of Convex Polygons. ICALP Helmut Alt, Johannes Blömer, Hubert Wagener
1989	B	`conf`	Motion Planning in the CL-Environment (Extended Abstract). WADS Chee-Keng Yap, Helmut Alt
1988	J	`jnl`	A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM J. Comput. Kurt Mehlhorn, Stefan Näher, Helmut Alt
1988	J	`jnl`	Approximation of Polygons by Rechtangles and Circles. Bull. EATCS Helmut Alt, Hubert Wagener
1988	J	`jnl`	Comparing the combinational complexities of arithmetic functions. J. ACM Helmut Alt
1988	J	`jnl`	Congruence, Similarity, and Symmetries of Geometric Objects. Discret. Comput. Geom. Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
1988	J	`jnl`	Visibility graphs and obstacle-avoiding shortest paths. ZOR Methods Model. Oper. Res. Helmut Alt, Emo Welzl
1987	A*	`conf`	A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP Kurt Mehlhorn, Stefan Näher, Helmut Alt
1987	—	`conf`	Congruence, Similarity, and Symmetries of Geometric Objects. SCG Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
1987	J	`jnl`	Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM J. Comput. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
1987	—	`conf`	Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. Parallel Algorithms and Architectures Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
1986	B	`conf`	Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
1985	J	`jnl`	Multiplication is the Easiest Nontrivial Arithmetic Function. Theor. Comput. Sci. Helmut Alt
1985	J	`jnl`	Searching Semisorted Tables. SIAM J. Comput. Helmut Alt, Kurt Mehlhorn
1984	A*	`conf`	Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract) STOC Helmut Alt
1984	J	`jnl`	Partial Match Retrieval in Implicit Data Structures. Inf. Process. Lett. Helmut Alt, Kurt Mehlhorn, J. Ian Munro
1983	A*	`conf`	Multiplication Is the Easiest Nontrivial Arithmetic Function FOCS Helmut Alt
1981	B	`conf`	Partial Match Retrieval in Implicit Data Structures. MFCS Helmut Alt, Kurt Mehlhorn, J. Ian Munro
1981	J	`jnl`	The complexity of basic complex operations. Computing Helmut Alt, Jan van Leeuwen
1980	A*	`conf`	Functions Equivalent to Integer Multiplication. ICALP Helmut Alt
1979	J	`jnl`	Complexity arguments in algebraic language theory. RAIRO Theor. Informatics Appl. Helmut Alt, Kurt Mehlhorn
1979	J	`jnl`	Lower Bounds on Space Complexity for Contextfree Recognition. Acta Informatica Helmut Alt
1979	J	`jnl`	Square rooting is as difficult as multiplication. Computing Helmut Alt
1979	B	`conf`	The complexity of complex division (extended abstract). FCT Helmut Alt, Jan van Leeuwen
1977	—	`conf`	Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen. Theoretical Computer Science Helmut Alt
1976	—	`—`	Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen. Helmut Alt
1976	A*	`conf`	Lower Bounds for the Space Complexity of Context-Free Recognition. ICALP Helmut Alt, Kurt Mehlhorn
1975	J	`jnl`	A language over a one symbol alphabet requiring only O (log log n) space. SIGACT News Helmut Alt, Kurt Mehlhorn