Klaus Kriegel

Publication Activity (10 Years)

Years Active: 1984-2018
Publications (10 Years): 2

Top Venues

CoRR

SoCG

Comput. Geom.

WAOA

Akademie der Wissenschaften der DDR, Berlin, Germany (PHD)

Education History

Akademie der Wissenschaften der DDR, Berlin, Germany

PHD

Publications

Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert
Tight bounds for conflict-free chromatic guarding of orthogonal art galleries. Comput. Geom. 73 (2018)
Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert
Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries. SoCG (2015)
Frank Hoffmann, Klaus Kriegel, Max Willert
Almost Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Galleries. CoRR (2014)
Robert Georges, Frank Hoffmann, Klaus Kriegel
Online Exploration of Polygons with Holes CoRR (2012)
Robert Georges, Frank Hoffmann, Klaus Kriegel
Online Exploration of Polygons with Holes. WAOA (2012)
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
Efficient Dynamical Computation of Principal Components. GRAPP (2011)
Christian Knauer, Klaus Kriegel, Fabian Stehn
Non-uniform Geometric Matchings. ICCSA (3) (2011)
Christian Knauer, Klaus Kriegel, Fabian Stehn
Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions. Theor. Comput. Sci. 412 (4-5) (2011)
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
Computing Principal Components Dynamically CoRR (2009)
Christian Knauer, Klaus Kriegel, Fabian Stehn
Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions. FAW (2009)
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
Bounds on the quality of the PCA bounding boxes. Comput. Geom. 42 (8) (2009)
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms. VISIGRAPP (Selected Papers) (2008)
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
Experimental Study of Bounding Box Algorithms. GRAPP (2008)
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
Approximate Point-to-Surface Registration with a Single Characteristic Point. VISAPP (1) (2008)
Darko Dimitrov, Klaus Kriegel
Detection of perfect and approximate reflective symmetry in arbitrary dimension. VISAPP (2) (2007)
Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
On the Number of Cycles in Planar Graphs. COCOON (2007)
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
. SCG (2007)
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. FAW (2007)
Darko Dimitrov, Christian Knauer, Klaus Kriegel
Registration of 3D - patterns and shapes with characteristic points. VISAPP (1) (2006)
Darko Dimitrov, Christian Knauer, Klaus Kriegel
Matching surfaces with characteristic points. EuroCG (2005)
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)
Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
Covering with Ellipses. Algorithmica 38 (1) (2004)
Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk
Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels. J. Comput. Biol. 9 (2) (2002)
Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
Covering shapes by ellipses. SODA (2002)
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
The Polygon Exploration Problem. SIAM J. Comput. 31 (2) (2001)
Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk
Geometric algorithms for the analysis of 2D-electrophoresis gels. RECOMB (2001)
Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz
Covering Simple Polygonal Regions by Ellipses. EuroCG (2000)
Stefan Felsner, Klaus Kriegel
Triangles in Euclidean Arrangements. Discret. Comput. Geom. 22 (3) (1999)
Frank Hoffmann, Klaus Kriegel, Carola Wenk
An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots. Discret. Appl. Math. 93 (1) (1999)
Helmut Alt, Ulrich Fuchs, Klaus Kriegel
On The Number Of Simple Cycles In Planar Graphs. Comb. Probab. Comput. 8 (5) (1999)
Stefan Felsner, Klaus Kriegel
Triangles in Euclidean Arrangements. WG (1998)
Frank Hoffmann, Klaus Kriegel, Carola Wenk
Matching 2D Patterns of Protein Spots. SCG (1998)
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
Moving an Angle Around a Region. SWAT (1998)
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
A Competitive Strategy for Learning a Polygon. SODA (1997)
Helmut Alt, Ulrich Fuchs, Klaus Kriegel
On the Number of Simple Cycles in Planar Graphs. WG (1997)
Frank Hoffmann, Klaus Kriegel
A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems. SIAM J. Discret. Math. 9 (2) (1996)
Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. 6 (1996)
Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG (1994)
Frank Hoffmann, Klaus Kriegel
A Graph Coloring Result and Its Consequences for Some Guarding Problems. ISAAC (1993)
Frank Hoffmann, Michael Kaufmann, Klaus Kriegel
The Art Gallery Theorem for Polygons With Holes FOCS (1991)
Klaus Kriegel, Stephan Waack
Lower Bounds on The Complexity of Real-Time Branching Programs. RAIRO Theor. Informatics Appl. 22 (4) (1988)
Klaus Kriegel, Stephan Waack
Exponential Lower Bounds for Real-Time Branching Programs. FCT (1987)
Klaus Kriegel
The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus. MFCS (1986)
Klaus Kriegel, Stephan Waack
Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version). FCT (1985)
Armin Hemmerling, Klaus Kriegel
On Searching of Special Cases of Mazes and Finite Embedded Graphs. MFCS (1984)

Klaus Kriegel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Klaus Kriegel