Klaus Kriegel

	2009
33		Christian Knauer, Klaus Kriegel, Fabian Stehn: Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions. FAW 2009: 108-119
	2008
32		Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel: Experimental Study of Bounding Box Algorithms. GRAPP 2008: 15-22
31		Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn: Approximate Point-to-Surface Registration with a Single Characteristic Point. VISAPP (1) 2008: 188-195
	2007
30		Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel: On the Number of Cycles in Planar Graphs. COCOON 2007: 97-107
29		Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn: Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. FAW 2007: 26-37
28		Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote: New upper bounds on the quality of the PCA bounding boxes in r2 and r3. Symposium on Computational Geometry 2007: 275-283
27		Darko Dimitrov, Klaus Kriegel: Detection of perfect and approximate reflective symmetry in arbitrary dimension. VISAPP (2) 2007: 128-136
	2006
26		Darko Dimitrov, Christian Knauer, Klaus Kriegel: Registration of 3D - patterns and shapes with characteristic points. VISAPP (1) 2006: 393-400
	2005
25		Darko Dimitrov, Christian Knauer, Klaus Kriegel: Matching surfaces with characteristic points. EWCG 2005: 49-51
	2004
24		Sven Schönherr, Robert Günzler, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Udo Warschewske: Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation. Bildverarbeitung für die Medizin 2004: 229-233
	2003
23		Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk: Covering with Ellipses. Algorithmica 38(1): 145-160 (2003)
	2002
22		Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk: Covering shapes by ellipses. SODA 2002: 453-454
21		Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk: Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels. Journal of Computational Biology 9(2): 299-315 (2002)
	2001
20		Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk: Geometric algorithms for the analysis of 2D-electrophoresis gels. RECOMB 2001: 114-123
19		Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel: The Polygon Exploration Problem. SIAM J. Comput. 31(2): 577-600 (2001)
	2000
18		Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz: Covering Simple Polygonal Regions by Ellipses. EWCG 2000: 89-92
	1999
17		Helmut Alt, Ulrich Fuchs, Klaus Kriegel: On The Number Of Simple Cycles In Planar Graphs. Combinatorics, Probability & Computing 8(5): (1999)
16		Frank Hoffmann, Klaus Kriegel, Carola Wenk: An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots. Discrete Applied Mathematics 93(1): 75-88 (1999)
	1998
15		Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel: Moving an Angle Around a Region. SWAT 1998: 71-82
14		Frank Hoffmann, Klaus Kriegel, Carola Wenk: Matching 2D Patterns of Protein Spots. Symposium on Computational Geometry 1998: 231-239
13		Stefan Felsner, Klaus Kriegel: Triangles in Euclidean Arrangements. WG 1998: 137-148
	1997
12		Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel: A Competitive Strategy for Learning a Polygon. SODA 1997: 166-174
11		Helmut Alt, Ulrich Fuchs, Klaus Kriegel: On the Number of Simple Cycles in Planar Graphs. WG 1997: 15-24
	1996
10		Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer: Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. 6: 21-44 (1996)
9		Frank Hoffmann, Klaus Kriegel: A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems. SIAM J. Discrete Math. 9(2): 210-224 (1996)
	1994
8		Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer: Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG 1994: 302-307
	1993
7		Frank Hoffmann, Klaus Kriegel: A Graph Coloring Result and Its Consequences for Some Guarding Problems. ISAAC 1993: 78-87
	1991
6		Frank Hoffmann, Michael Kaufmann, Klaus Kriegel: The Art Gallery Theorem for Polygons With Holes FOCS 1991: 39-48
	1988
5		Klaus Kriegel, Stephan Waack: Lower Bounds on The Complexity of Real-Time Branching Programs. ITA 22(4): 447-459 (1988)
	1987
4		Klaus Kriegel, Stephan Waack: Exponential Lower Bounds for Real-Time Branching Programs. FCT 1987: 263-267
	1986
3		Klaus Kriegel: The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus. MFCS 1986: 484-492
	1985
2		Klaus Kriegel, Stephan Waack: Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version). FCT 1985: 227-233
	1984
1		Armin Hemmerling, Klaus Kriegel: On Searching of Special Cases of Mazes and Finite Embedded Graphs. MFCS 1984: 291-300

Coauthor Index

1	Helmut Alt	[11] [17]
2	Kevin Buchin	[30]
3	Darko Dimitrov	[25] [26] [27] [28] [29] [31] [32]
4	Alon Efrat	[18] [20] [21] [22] [23]
5	Stefan Felsner	[13]
6	Ulrich Fuchs	[11] [17]
7	Robert Günzler	[24]
8	Ervin Györi	[8] [10]
9	Armin Hemmerling	[1]
10	Frank Hoffmann	[6] [7] [8] [9] [10] [12] [14] [15] [16] [18] [19] [20] [21] [22] [23] [24]
11	Mathias Holst	[32]
12	Christian Icking	[12] [15] [19]
13	Michael Kaufmann	[6]
14	Rolf Klein	[12] [15] [19]
15	Christian Knauer	[22] [23] [24] [25] [26] [28] [29] [30] [31] [32] [33]
16	Günter Rote	[22] [23] [28]
17	Sven Schönherr	[24]
18	Christof Schultz	[18] [20] [21]
19	André Schulz	[30]
20	Raimund Seidel	[30]
21	Thomas C. Shermer	[8] [10]
22	Fabian Stehn	[29] [31] [33]
23	Stephan Waack	[2] [4] [5]
24	Udo Warschewske	[24]
25	Carola Wenk	[14] [16] [20] [21] [22] [23]

Colors in the list of coauthors