Klaus Kriegel

According to our database, Klaus Kriegel authored at least 39 papers between 1984 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Tight bounds for conflict-free chromatic guarding of orthogonal art galleries.

Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert

Comput. Geom., 2018

2014

Almost Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Galleries.

Frank Hoffmann, Klaus Kriegel, Max Willert

CoRR, 2014

2012

Online Exploration of Polygons with Holes.

Robert Georges, Frank Hoffmann, Klaus Kriegel

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

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

Non-uniform Geometric Matchings.

Christian Knauer, Klaus Kriegel, Fabian Stehn

Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Efficient Dynamical Computation of Principal Components.

Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel

Proceedings of the GRAPP 2011, 2011

2009

Computing Principal Components Dynamically

Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel

CoRR, 2009

Bounds on the quality of the PCA bounding boxes.

Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote

Comput. Geom., 2009

2008

Approximate Point-to-Surface Registration with a Single Characteristic Point.

Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn

Proceedings of the VISAPP 2008: Proceedings of the Third International Conference on Computer Vision Theory and Applications, Funchal, Madeira, Portugal, January 22-25, 2008, 2008

Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms.

Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel

Proceedings of the Computer Vision and Computer Graphics. Theory and Applications, 2008

Experimental Study of Bounding Box Algorithms.

Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel

Proceedings of the GRAPP 2008, 2008

2007

Detection of perfect and approximate reflective symmetry in arbitrary dimension.

Darko Dimitrov, Klaus Kriegel

Proceedings of the VISAPP 2007: Proceedings of the Second International Conference on Computer Vision Theory and Applications, Barcelona, Spain, March 8-11, 2007, 2007

Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation.

Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn

Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

New upper bounds on the quality of the PCA bounding boxes in r² and r³.

Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

On the Number of Cycles in Planar Graphs.

Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Registration of 3D - patterns and shapes with characteristic points.

Darko Dimitrov, Christian Knauer, Klaus Kriegel

Proceedings of the VISAPP 2006: Proceedings of the First International Conference on Computer Vision Theory and Applications, 2006

2005

Matching surfaces with characteristic points.

Darko Dimitrov, Christian Knauer, Klaus Kriegel

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004

Covering with Ellipses.

Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk

Algorithmica, 2004

Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation.

Sven Schönherr, Robert Günzler, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Udo Warschewske

Proceedings of the Bildverarbeitung für die Medizin 2004, Algorithmen - Systeme, 2004

2002

Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels.

Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk

J. Comput. Biol., 2002

Covering shapes by ellipses.

Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

The Polygon Exploration Problem.

Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel

SIAM J. Comput., 2001

2000

Covering Simple Polygonal Regions by Ellipses.

Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz

EuroCG, 2000

1999

Triangles in Euclidean Arrangements.

Stefan Felsner, Klaus Kriegel

Discret. Comput. Geom., 1999

An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots.

Frank Hoffmann, Klaus Kriegel, Carola Wenk

Discret. Appl. Math., 1999

On The Number Of Simple Cycles In Planar Graphs.

Helmut Alt, Ulrich Fuchs, Klaus Kriegel

Comb. Probab. Comput., 1999

1998

Moving an Angle Around a Region.

Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel

Proceedings of the Algorithm Theory, 1998

Matching 2D Patterns of Protein Spots.

Frank Hoffmann, Klaus Kriegel, Carola Wenk

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

A Competitive Strategy for Learning a Polygon.

Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems.

Frank Hoffmann, Klaus Kriegel

SIAM J. Discret. Math., 1996

Generalized Guarding and Partitioning for Rectilinear Polygons.

Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer

Comput. Geom., 1996

1993

A Graph Coloring Result and Its Consequences for Some Guarding Problems.

Frank Hoffmann, Klaus Kriegel

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1991

The Art Gallery Theorem for Polygons With Holes

Frank Hoffmann, Michael Kaufmann, Klaus Kriegel

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1988

Lower Bounds on The Complexity of Real-Time Branching Programs.

Klaus Kriegel, Stephan Waack

RAIRO Theor. Informatics Appl., 1988

1987

Exponential Lower Bounds for Real-Time Branching Programs.

Klaus Kriegel, Stephan Waack

Proceedings of the Fundamentals of Computation Theory, 1987

1986

The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus.

Klaus Kriegel

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985

Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version).

Klaus Kriegel, Stephan Waack

Proceedings of the Fundamentals of Computation Theory, 1985

1984

Universelle 1-Kiesel-Automaten für k-komponentige Labyrinthe.

Klaus Kriegel

PhD thesis, 1984

On Searching of Special Cases of Mazes and Finite Embedded Graphs.

Armin Hemmerling, Klaus Kriegel

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984