Klaus Kriegel

According to our database1, Klaus Kriegel
  • authored at least 45 papers between 1984 and 2015.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2015
Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

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

2012
Online Exploration of Polygons with Holes
CoRR, 2012

Online Exploration of Polygons with Holes.
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.
Theor. Comput. Sci., 2011

Non-uniform Geometric Matchings.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Efficient Dynamical Computation of Principal Components.
Proceedings of the GRAPP 2011, 2011

2009
Computing Principal Components Dynamically
CoRR, 2009

Bounds on the quality of the PCA bounding boxes.
Comput. Geom., 2009

Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008
Approximate Point-to-Surface Registration with a Single Characteristic Point.
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.
Proceedings of the Computer Vision and Computer Graphics. Theory and Applications, 2008

Experimental Study of Bounding Box Algorithms.
Proceedings of the GRAPP 2008, 2008

2007
Detection of perfect and approximate reflective symmetry in arbitrary dimension.
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.
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

New upper bounds on the quality of the PCA bounding boxes in r2 and r3.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

On the Number of Cycles in Planar Graphs.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
Registration of 3D - patterns and shapes with characteristic points.
Proceedings of the VISAPP 2006: Proceedings of the First International Conference on Computer Vision Theory and Applications, 2006

2005
Matching surfaces with characteristic points.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004
Covering with Ellipses.
Algorithmica, 2004

Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation.
Proceedings of the Bildverarbeitung für die Medizin 2004, Algorithmen - Systeme, 2004

2002
Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels.
Journal of Computational Biology, 2002

Covering shapes by ellipses.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
The Polygon Exploration Problem.
SIAM J. Comput., 2001

Geometric algorithms for the analysis of 2D-electrophoresis gels.
Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

2000
Covering Simple Polygonal Regions by Ellipses.
EuroCG, 2000

1999
Triangles in Euclidean Arrangements.
Discrete & Computational Geometry, 1999

An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots.
Discrete Applied Mathematics, 1999

On The Number Of Simple Cycles In Planar Graphs.
Combinatorics, Probability & Computing, 1999

1998
Triangles in Euclidean Arrangements.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Moving an Angle Around a Region.
Proceedings of the Algorithm Theory, 1998

Matching 2D Patterns of Protein Spots.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
On the Number of Simple Cycles in Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

A Competitive Strategy for Learning a Polygon.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems.
SIAM J. Discrete Math., 1996

Generalized Guarding and Partitioning for Rectilinear Polygons.
Comput. Geom., 1996

1994
Generalized Guarding and Partitioning for Rectilinear Polygons.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
A Graph Coloring Result and Its Consequences for Some Guarding Problems.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1991
The Art Gallery Theorem for Polygons With Holes
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

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

1987
Exponential Lower Bounds for Real-Time Branching Programs.
Proceedings of the Fundamentals of Computation Theory, 1987

1986
The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus.
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).
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Universelle 1-Kiesel-Automaten für k-komponentige Labyrinthe.
PhD thesis, 1984

On Searching of Special Cases of Mazes and Finite Embedded Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984


  Loading...