The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Klaus Kriegel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sven Schönherr, Robert Günzler, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Udo Warschewske
    Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation. [Citation Graph (0, 0)][DBLP]
    Bildverarbeitung für die Medizin, 2004, pp:229-233 [Conf]
  2. Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
    Generalized Guarding and Partitioning for Rectilinear Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:302-307 [Conf]
  3. Frank Hoffmann, Klaus Kriegel, Carola Wenk
    Matching 2D Patterns of Protein Spots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:231-239 [Conf]
  4. Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
    New upper bounds on the quality of the PCA bounding boxes in r2 and r3. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:275-283 [Conf]
  5. Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz
    Covering Simple Polygonal Regions by Ellipses. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:89-92 [Conf]
  6. Klaus Kriegel, Stephan Waack
    Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version). [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:227-233 [Conf]
  7. Klaus Kriegel, Stephan Waack
    Exponential Lower Bounds for Real-Time Branching Programs. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:263-267 [Conf]
  8. Frank Hoffmann, Michael Kaufmann, Klaus Kriegel
    The Art Gallery Theorem for Polygons With Holes [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:39-48 [Conf]
  9. Frank Hoffmann, Klaus Kriegel
    A Graph Coloring Result and Its Consequences for Some Guarding Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:78-87 [Conf]
  10. Armin Hemmerling, Klaus Kriegel
    On Searching of Special Cases of Mazes and Finite Embedded Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:291-300 [Conf]
  11. Klaus Kriegel
    The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:484-492 [Conf]
  12. Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk
    Geometric algorithms for the analysis of 2D-electrophoresis gels. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2001, pp:114-123 [Conf]
  13. Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
    Covering shapes by ellipses. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:453-454 [Conf]
  14. Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    A Competitive Strategy for Learning a Polygon. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:166-174 [Conf]
  15. Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    Moving an Angle Around a Region. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:71-82 [Conf]
  16. Helmut Alt, Ulrich Fuchs, Klaus Kriegel
    On the Number of Simple Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:15-24 [Conf]
  17. Stefan Felsner, Klaus Kriegel
    Triangles in Euclidean Arrangements. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:137-148 [Conf]
  18. Darko Dimitrov, Christian Knauer, Klaus Kriegel
    Registration of 3D - patterns and shapes with characteristic points. [Citation Graph (0, 0)][DBLP]
    VISAPP (1), 2006, pp:393-400 [Conf]
  19. Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
    Covering with Ellipses. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:1, pp:145-160 [Journal]
  20. Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
    Generalized Guarding and Partitioning for Rectilinear Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:21-44 [Journal]
  21. Helmut Alt, Ulrich Fuchs, Klaus Kriegel
    On The Number Of Simple Cycles In Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1999, v:8, n:5, pp:- [Journal]
  22. Frank Hoffmann, Klaus Kriegel, Carola Wenk
    An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:1, pp:75-88 [Journal]
  23. Klaus Kriegel, Stephan Waack
    Lower Bounds on The Complexity of Real-Time Branching Programs. [Citation Graph (0, 0)][DBLP]
    ITA, 1988, v:22, n:4, pp:447-459 [Journal]
  24. Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk
    Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2002, v:9, n:2, pp:299-315 [Journal]
  25. Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    The Polygon Exploration Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:577-600 [Journal]
  26. Frank Hoffmann, Klaus Kriegel
    A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:210-224 [Journal]
  27. Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
    On the Number of Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:97-107 [Conf]
  28. Darko Dimitrov, Klaus Kriegel
    Detection of perfect and approximate reflective symmetry in arbitrary dimension. [Citation Graph (0, 0)][DBLP]
    VISAPP (2), 2007, pp:128-136 [Conf]
  29. Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
    Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. [Citation Graph (0, 0)][DBLP]
    FAW, 2007, pp:26-37 [Conf]

  30. Matching surfaces with characteristic points. [Citation Graph (, )][DBLP]


  31. Approximate Point-to-Surface Registration with a Single Characteristic Point. [Citation Graph (, )][DBLP]


  32. Experimental Study of Bounding Box Algorithms. [Citation Graph (, )][DBLP]


  33. Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions. [Citation Graph (, )][DBLP]


  34. Bounds on the quality of the PCA bounding boxes. [Citation Graph (, )][DBLP]


  35. Computing Principal Components Dynamically [Citation Graph (, )][DBLP]


Search in 0.276secs, Finished in 0.279secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002