On Searching of Special Cases of Mazes and Finite Embedded Graphs. - Armin Hemmerling; Klaus Kriegel (MFCS, 1984)

Universelle 1-Kiesel-Automaten für k-komponentige Labyrinthe. - Klaus Kriegel (1984)

Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version). - Klaus Kriegel; Stephan Waack (FCT, 1985)

The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus. - Klaus Kriegel (MFCS, 1986)

Exponential Lower Bounds for Real-Time Branching Programs. - Klaus Kriegel; Stephan Waack (FCT, 1987)

Lower Bounds on The Complexity of Real-Time Branching Programs. - Klaus Kriegel; Stephan Waack (RAIRO Theor. Informatics Appl., 1988)

The Art Gallery Theorem for Polygons With Holes - Frank Hoffmann 002; Michael Kaufmann 001; Klaus Kriegel (FOCS, 1991)

A Graph Coloring Result and Its Consequences for Some Guarding Problems. - Frank Hoffmann 002; Klaus Kriegel (ISAAC, 1993)

Generalized Guarding and Partitioning for Rectilinear Polygons. - Ervin Györi; Frank Hoffmann 002; Klaus Kriegel; Thomas C. Shermer (Comput. Geom., 1996)

A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems. - Frank Hoffmann 002; Klaus Kriegel (SIAM J. Discret. Math., 1996)

A Competitive Strategy for Learning a Polygon. - Frank Hoffmann 002; Christian Icking; Rolf Klein; Klaus Kriegel (SODA, 1997)

Matching 2D Patterns of Protein Spots. - Frank Hoffmann 002; Klaus Kriegel; Carola Wenk (SCG, 1998)

Moving an Angle Around a Region. - Frank Hoffmann 002; Christian Icking; Rolf Klein; Klaus Kriegel (SWAT, 1998)

On The Number Of Simple Cycles In Planar Graphs. - Helmut Alt; Ulrich Fuchs 001; Klaus Kriegel (Comb. Probab. Comput., 1999)

An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots. - Frank Hoffmann 002; Klaus Kriegel; Carola Wenk (Discret. Appl. Math., 1999)

Triangles in Euclidean Arrangements. - Stefan Felsner; Klaus Kriegel (Discret. Comput. Geom., 1999)

Covering Simple Polygonal Regions by Ellipses. - Alon Efrat; Frank Hoffmann 002; Klaus Kriegel; Christof Schultz (EuroCG, 2000)

The Polygon Exploration Problem. - Frank Hoffmann 002; Christian Icking; Rolf Klein; Klaus Kriegel (SIAM J. Comput., 2001)

Covering shapes by ellipses. - Alon Efrat; Frank Hoffmann 002; Christian Knauer; Klaus Kriegel; Günter Rote; Carola Wenk (SODA, 2002)

Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels. - Alon Efrat; Frank Hoffmann 002; Klaus Kriegel; Christof Schultz; Carola Wenk (J. Comput. Biol., 2002)

Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation. - Sven Schönherr; Robert Günzler; Frank Hoffmann 002; Christian Knauer; Klaus Kriegel; Udo Warschewske (Bildverarbeitung für die Medizin, 2004)

Covering with Ellipses. - Alon Efrat; Frank Hoffmann 002; Christian Knauer; Klaus Kriegel; Günter Rote; Carola Wenk (Algorithmica, 2004)

Matching surfaces with characteristic points. - Darko Dimitrov; Christian Knauer; Klaus Kriegel (EuroCG, 2005)

Registration of 3D - patterns and shapes with characteristic points. - Darko Dimitrov; Christian Knauer; Klaus Kriegel (VISAPP (1), 2006)

On the Number of Cycles in Planar Graphs. - Kevin Buchin; Christian Knauer; Klaus Kriegel; André Schulz 001; Raimund Seidel (COCOON, 2007)

New upper bounds on the quality of the PCA bounding boxes in r2 and r3. - Darko Dimitrov; Christian Knauer; Klaus Kriegel; Günter Rote (SCG, 2007)

Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. - Darko Dimitrov; Christian Knauer; Klaus Kriegel; Fabian Stehn (FAW, 2007)

Detection of perfect and approximate reflective symmetry in arbitrary dimension. - Darko Dimitrov; Klaus Kriegel (VISAPP (2), 2007)

Experimental Study of Bounding Box Algorithms. - Darko Dimitrov; Mathias Holst; Christian Knauer; Klaus Kriegel (GRAPP, 2008)

Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms. - Darko Dimitrov; Mathias Holst; Christian Knauer; Klaus Kriegel (VISIGRAPP (Selected Papers), 2008)

Approximate Point-to-Surface Registration with a Single Characteristic Point. - Darko Dimitrov; Christian Knauer; Klaus Kriegel; Fabian Stehn (VISAPP (1), 2008)

Bounds on the quality of the PCA bounding boxes. - Darko Dimitrov; Christian Knauer; Klaus Kriegel; Günter Rote (Comput. Geom., 2009)

Computing Principal Components Dynamically - Darko Dimitrov; Mathias Holst; Christian Knauer; Klaus Kriegel (CoRR, 2009)

Efficient Dynamical Computation of Principal Components. - Darko Dimitrov; Mathias Holst; Christian Knauer; Klaus Kriegel (GRAPP, 2011)

Non-uniform Geometric Matchings. - Christian Knauer; Klaus Kriegel; Fabian Stehn (ICCSA (3), 2011)

Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions. - Christian Knauer; Klaus Kriegel; Fabian Stehn (Theor. Comput. Sci., 2011)

Online Exploration of Polygons with Holes. - Robert Georges; Frank Hoffmann 002; Klaus Kriegel (WAOA, 2012)

Almost Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Galleries. - Frank Hoffmann 002; Klaus Kriegel; Max Willert (CoRR, 2014)

Tight bounds for conflict-free chromatic guarding of orthogonal art galleries. - Frank Hoffmann 002; Klaus Kriegel; Subhash Suri; Kevin Verbeek; Max Willert (Comput. Geom., 2018)