Klaus Kriegel

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