Helmut Alt

	2010
78		Helmut Alt, Maike Buchin: Can We Compute the Similarity between Surfaces? Discrete & Computational Geometry 43(1): 78-99 (2010)
	2009
77		Susanne Albers, Helmut Alt, Stefan Näher: Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday Springer 2009
76		Helmut Alt: The Computational Geometry of Comparing Shapes. Efficient Algorithms 2009: 235-248
75		Helmut Alt, Ludmila Scharf: Shape Matching by Random Sampling. WALCOM 2009: 381-393
74		Helmut Alt, Ludmila Scharf, Daria Schymura: Probabilistic Matching of Planar Regions CoRR abs/0902.4337: (2009)
73		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)
72		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)
	2008
71		Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner: Taschenbuch der Algorithmen Springer 2008
70		Helmut Alt: Schnelle Sortieralgorithmen. Taschenbuch der Algorithmen 2008: 21-30
69		Helmut Alt, Ludmila Scharf: Computing the Hausdorff Distance between Curved Objects. Int. J. Comput. Geometry Appl. 18(4): 307-320 (2008)
	2007
68		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
67		Helmut Alt, Ludmila Scharf, Sven Scholz: Probabilistic matching and resemblance evaluation of shapes in trademark images. CIVR 2007: 533-540
66		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
65		Helmut Alt, Maike Buchin: Can we Compute the Similarity Between Surfaces? CoRR abs/cs/0703011: (2007)
64		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
63		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. Symposium on Computational Geometry 2006: 449-458
	2005
62		Helmut Alt, Maike Buchin: Semi-computability of the Fréchet distance between surfaces. EuroCG 2005: 45-48
61		Helmut Alt, Otfried Cheong, Antoine Vigneron: The Voronoi Diagram of Curved Objects. Discrete & Computational Geometry 34(3): 439-453 (2005)
60		Helmut Alt: Foreword. Theory Comput. Syst. 38(2): 133 (2005)
	2003
59		Helmut Alt, Michel Habib: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings Springer 2003
58		Helmut Alt, Marc Glisse, Xavier Goaoc: On the worst-case complexity of the silhouette of a polytope. CCCG 2003: 51-55
57		Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk: Matching planar maps. SODA 2003: 589-598
56		Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides: The complexity of (un)folding. Symposium on Computational Geometry 2003: 164-170
55		Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote: Finding a curve in a map. Symposium on Computational Geometry 2003: 384-385
54		Helmut Alt, Christian Knauer, Carola Wenk: Comparison of Distance Measures for Planar Curves. Algorithmica 38(1): 45-58 (2003)
53		Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk: Matching planar maps. J. Algorithms 49(2): 262-283 (2003)
	2002
52		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 Springer 2002
	2001
51		Helmut Alt: Computational Discrete Mathematics, Advanced Lectures Springer 2001
50		Helmut Alt: The Nearest Neighbor. Computational Discrete Mathematics 2001: 13-24
49		Helmut Alt, Christian Knauer, Carola Wenk: Matching Polygonal Curves with Respect to the Fréchet Distance. STACS 2001: 63-74
48		Helmut Alt, Laura Heinrich-Litan: Exact Linfty Nearest Neighbor Search in High Dimensions. Symposium on Computational Geometry 2001: 157-163
	2000
47		Helmut Alt, Ferran Hurtado: Packing Convex Polygons into Rectangular Boxes. JCDCG 2000: 67-80
46		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)
	1999
45		Helmut Alt, Ulrich Fuchs, Klaus Kriegel: On The Number Of Simple Cycles In Planar Graphs. Combinatorics, Probability & Computing 8(5): (1999)
	1998
44		Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy: Point-Sets with few k-Sets. Symposium on Computational Geometry 1998: 200-205
43		Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber: Matching Convex Shapes with Respect to the Symmetric Difference. Algorithmica 21(1): 89-103 (1998)
42		Helmut Alt, Michael Godau, Sue Whitesides: Universal 3-dimensional visibility representations for graphs. Comput. Geom. 9(1-2): 111-125 (1998)
	1997
41		Helmut Alt, Emo Welzl, Barbara Wolfers: Piecewise Linear Approximation of Bézier-Curves. Symposium on Computational Geometry 1997: 433-435
40		Helmut Alt, Ulrich Fuchs, Klaus Kriegel: On the Number of Simple Cycles in Planar Graphs. WG 1997: 15-24
39		Oswin Aichholzer, Helmut Alt, Günter Rote: Matching Shapes with a Reference Point. Int. J. Comput. Geometry Appl. 7(4): 349-363 (1997)
	1996
38		Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber: Matching Convex Shapes with Respect to the Symmetric Difference. ESA 1996: 320-333
37		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)
	1995
36		Helmut Alt, Michael Godau, Sue Whitesides: Universal 3-Dimensional Visibility Representations for Graphs. Graph Drawing 1995: 8-19
35		Helmut Alt, Otfried Schwarzkopf: The Voronoi Diagram of Curved Objects. Symposium on Computational Geometry 1995: 89-97
34		Helmut Alt, Bernd Behrends, Johannes Blömer: Approximate Matching of Polygonal Shapes. Ann. Math. Artif. Intell. 13(3-4): 251-265 (1995)
33		Helmut Alt, Michael Godau: Computing the Fréchet distance between two polygonal curves. Int. J. Comput. Geometry Appl. 5: 75-91 (1995)
	1994
32		Helmut Alt, Oswin Aichholzer, Günter Rote: Matching Shapes with a Reference Point. Symposium on Computational Geometry 1994: 85-92
31		Gerald Weber, Lars Knipping, Helmut Alt: An Application of Point Pattern Matching in Astronautics. J. Symb. Comput. 17(4): 321-340 (1994)
	1992
30		Helmut Alt, Johannes Blömer: Resemblance and Symmetries of Geometric Patterns. Data Structures and Efficient Algorithms 1992: 1-24
29		Helmut Alt, Michael Godau: Measuring the Resemblance of Polygonal Curves. Symposium on Computational Geometry 1992: 102-109
28		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)
27		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)
	1991
26		Helmut Alt, Bernd Behrends, Johannes Blömer: Approximate Matching of Polygonal Shapes (Extended Abstract). Symposium on Computational Geometry 1991: 186-193
25		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)
	1990
24		Helmut Alt, Johannes Blömer, Hubert Wagener: Approximation of Convex Polygons. ICALP 1990: 703-716
23		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. Symposium on Computational Geometry 1990: 281-289
	1989
22		Chee-Keng Yap, Helmut Alt: Motion Planning in the CL-Environment (Extended Abstract). WADS 1989: 373-380
	1988
21		Helmut Alt, Hubert Wagener: Approximation of Polygons by Rechtangles and Circles. Bulletin of the EATCS 36: 103-112 (1988)
20		Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Discrete & Computational Geometry 3: 237-256 (1988)
19		Helmut Alt: Comparing the combinational complexities of arithmetic functions. J. ACM 35(2): 447-460 (1988)
18		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
17		Kurt Mehlhorn, Stefan Näher, Helmut Alt: A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP 1987: 479-488
16		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
15		Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Symposium on Computational Geometry 1987: 308-315
14		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)
	1986
13		Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS 1986: 199-208
	1985
12		Helmut Alt, Kurt Mehlhorn: Searching Semisorted Tables. SIAM J. Comput. 14(4): 840-848 (1985)
11		Helmut Alt: Multiplication is the Easiest Nontrivial Arithmetic Function. Theor. Comput. Sci. 36: 333-339 (1985)
	1984
10		Helmut Alt: Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract) STOC 1984: 466-470
9		Helmut Alt, Kurt Mehlhorn, J. Ian Munro: Partial Match Retrieval in Implicit Data Structures. Inf. Process. Lett. 19(2): 61-65 (1984)
	1983
8		Helmut Alt: Multiplication Is the Easiest Nontrivial Arithmetic Function FOCS 1983: 320-322
	1981
7		Helmut Alt, Kurt Mehlhorn, J. Ian Munro: Partial Match Retrieval in Implicit Data Structures. MFCS 1981: 156-161
	1980
6		Helmut Alt: Functions Equivalent to Integer Multiplication. ICALP 1980: 30-37
	1979
5		Helmut Alt, Jan van Leeuwen: The complexity of complex division (extended abstract). FCT 1979: 13-17
4		Helmut Alt: Lower Bounds on Space Complexity for Contextfree Recognition. Acta Inf. 12: 33-61 (1979)
3		Helmut Alt, Kurt Mehlhorn: Complexity arguments in algebraic language theory. ITA 13(3): (1979)
	1977
2		Helmut Alt: Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen. Theoretical Computer Science 1977: 123-131
	1976
1		Helmut Alt, Kurt Mehlhorn: Lower Bounds for the Space Complexity of Context-Free Recognition. ICALP 1976: 338-354

Coauthor Index

1	Hee-Kap Ahn	[64] [68] [73]
2	Oswin Aichholzer	[32] [39]
3	Susanne Albers	[77]
4	Esther M. Arkin	[63]
5	Tetsuo Asano	[64] [68] [73]
6	Sang Won Bae	[64] [68] [73]
7	Bernd Behrends	[26] [34]
8	Johannes Blömer	[24] [26] [30] [34]
9	Norbert Blum	[25]
10	Hans L. Bodlaender	[66] [72]
11	Peter Braß (Peter Brass)	[64] [68] [73]
12	Hervé Brönnimann	[63]
13	Maike Buchin	[62] [65] [78]
14	Otfried Cheong (Otfried Schwarzkopf)	[35] [61] [64] [68] [73]
15	Martin Dietzfelbinger	[71]
16	Alon Efrat	[53] [55] [57]
17	Jeff Erickson	[63]
18	Sándor P. Fekete	[63]
19	Stefan Felsner	[44] [46]
20	Afonso Ferreira	[52]
21	Rudolf Fleischer	[23] [28]
22	Ulrich Fuchs	[38] [40] [43] [45]
23	Viliam Geffert	[27]
24	Marc Glisse	[58]
25	Xavier Goaoc	[58]
26	Michael Godau	[29] [33] [36] [42]
27	Leonidas J. Guibas	[37]
28	Michel Habib	[59]
29	Torben Hagerup	[13] [14] [16]
30	Laura Heinrich-Litan	[48]
31	Ferran Hurtado	[44] [46] [47]
32	Richard M. Karp	[37]
33	Michael Kaufmann	[23] [28]
34	Christian Knauer	[49] [54] [56] [63] [64] [68] [73]
35	Lars Knipping	[31]
36	Marc J. van Kreveld	[66] [72]
37	Klaus Kriegel	[40] [45]
38	Jan van Leeuwen	[5]
39	Jonathan Lenchner	[63]
40	Kurt Mehlhorn	[1] [3] [7] [9] [12] [13] [14] [15] [16] [17] [18] [20] [23] [25] [27] [28] [37]
41	Joseph S. B. Mitchell	[63]
42	J. Ian Munro	[7] [9]
43	Hyeon-Suk Na	[64] [68] [73]
44	Stefan Näher	[17] [18] [23] [28] [77]
45	Marc Noy	[44] [46]
46	Lingeshwaran Palaniappan	[55]
47	Markus Paul	[25]
48	Franco P. Preparata	[13] [14] [16]
49	Rüdiger Reischuk	[71]
50	Günter Rote	[32] [38] [39] [43] [53] [55] [56] [57] [66] [72]
51	Ludmila Scharf	[67] [69] [74] [75]
52	Christian Scheideler	[71]
53	Stefan Schirra	[23] [28]
54	Sven Scholz	[67]
55	Daria Schymura	[74]
56	Chan-Su Shin	[64] [68] [73]
57	Gerard Tel	[66] [72]
58	Christian Uhrig	[23] [28]
59	Antoine Vigneron	[61]
60	Berthold Vöcking	[71]
61	Heribert Vollmer	[71]
62	Hubert Wagener	[15] [20] [21] [24]
63	Dorothea Wagner	[71]
64	Gerald Weber	[31] [38] [43]
65	Emo Welzl	[15] [20] [41] [46]
66	Carola Wenk	[49] [53] [54] [55] [57]
67	Sue Whitesides	[36] [42] [56]
68	Kim Whittlesey	[63]
69	Avi Wigderson	[37]
70	Barbara Wolfers	[41]
71	Alexander Wolff	[64] [68] [73]
72	Chee-Keng Yap (Chee Yap)	[22]

Colors in the list of coauthors