Skip to content

Klaus Kriegel

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

16

Venues

11

Active years

1984–2012

Best venue rank

A*

Where they publish

Papers

16 indexed papers, newest first.

YearVenueTitleAuthors
2012WAOAOnline Exploration of Polygons with Holes.Robert Georges, Frank Hoffmann, Klaus Kriegel
2011ICCSANon-uniform Geometric Matchings.Christian Knauer, Klaus Kriegel, Fabian Stehn
2009FAWMinimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions.Christian Knauer, Klaus Kriegel, Fabian Stehn
2007COCOONOn the Number of Cycles in Planar Graphs.Kevin Buchin, Christian Knauer, Klaus Kriegel, Andr Schulz, Raimund Seidel
2007FAWApproximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation.Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
2002SODACovering shapes by ellipses.Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Gnter Rote, Carola Wenk
2001RECOMBGeometric algorithms for the analysis of 2D-electrophoresis gels.Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk
1998WGTriangles in Euclidean Arrangements.Stefan Felsner, Klaus Kriegel
1997SODAA Competitive Strategy for Learning a Polygon.Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
1997WGOn the Number of Simple Cycles in Planar Graphs.Helmut Alt, Ulrich Fuchs, Klaus Kriegel
1993ISAACA Graph Coloring Result and Its Consequences for Some Guarding Problems.Frank Hoffmann, Klaus Kriegel
1991FOCSThe Art Gallery Theorem for Polygons With HolesFrank Hoffmann, Michael Kaufmann, Klaus Kriegel
1987FCTExponential Lower Bounds for Real-Time Branching Programs.Klaus Kriegel, Stephan Waack
1986MFCSThe Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus.Klaus Kriegel
1985FCTLower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version).Klaus Kriegel, Stephan Waack
1984MFCSOn Searching of Special Cases of Mazes and Finite Embedded Graphs.Armin Hemmerling, Klaus Kriegel