default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Kriegel
Person information
- affiliation: Free University of Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j12]Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek
, Max Willert:
Tight bounds for conflict-free chromatic guarding of orthogonal art galleries. Comput. Geom. 73: 24-34 (2018)- 2015
- [c28]Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert:
Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries. SoCG 2015: 421-435 - 2014
- [i5]Frank Hoffmann, Klaus Kriegel, Max Willert:
Almost Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Galleries. CoRR abs/1412.3984 (2014) - 2012
- [c27]Robert Georges, Frank Hoffmann, Klaus Kriegel:
Online Exploration of Polygons with Holes. WAOA 2012: 56-69 - [i4]Robert Georges, Frank Hoffmann, Klaus Kriegel:
Online Exploration of Polygons with Holes. CoRR abs/1207.0240 (2012) - 2011
- [j11]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): 375-382 (2011) - [c26]Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel:
Efficient Dynamical Computation of Principal Components. GRAPP 2011: 85-93 - [c25]Christian Knauer, Klaus Kriegel, Fabian Stehn:
Non-uniform Geometric Matchings. ICCSA (3) 2011: 44-57
2000 – 2009
- 2009
- [j10]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote:
Bounds on the quality of the PCA bounding boxes. Comput. Geom. 42(8): 772-789 (2009) - [c24]Christian Knauer, Klaus Kriegel, Fabian Stehn:
Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions. FAW 2009: 108-119 - [i3]Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel:
Computing Principal Components Dynamically. CoRR abs/0912.5380 (2009) - 2008
- [c23]Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel:
Experimental Study of Bounding Box Algorithms. GRAPP 2008: 15-22 - [c22]Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel:
Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms. VISIGRAPP (Selected Papers) 2008: 26-40 - [c21]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn:
Approximate Point-to-Surface Registration with a Single Characteristic Point. VISAPP (1) 2008: 188-195 - 2007
- [c20]Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel:
On the Number of Cycles in Planar Graphs. COCOON 2007: 97-107 - [c19]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote:
New upper bounds on the quality of the PCA bounding boxes in r2 and r3. SCG 2007: 275-283 - [c18]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn:
Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. FAW 2007: 26-37 - [c17]Darko Dimitrov, Klaus Kriegel:
Detection of perfect and approximate reflective symmetry in arbitrary dimension. VISAPP (2) 2007: 128-136 - 2006
- [c16]Darko Dimitrov, Christian Knauer, Klaus Kriegel:
Registration of 3D - patterns and shapes with characteristic points. VISAPP (1) 2006: 393-400 - 2005
- [i2]Darko Dimitrov, Christian Knauer, Klaus Kriegel:
Matching surfaces with characteristic points. EuroCG 2005: 49-51 - 2004
- [j9]Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk:
Covering with Ellipses. Algorithmica 38(1): 145-160 (2004) - [c15]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: 229-233 - 2002
- [j8]Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk:
Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels. J. Comput. Biol. 9(2): 299-315 (2002) - [c14]Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk:
Covering shapes by ellipses. SODA 2002: 453-454 - 2001
- [j7]Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel:
The Polygon Exploration Problem. SIAM J. Comput. 31(2): 577-600 (2001) - [c13]Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk:
Geometric algorithms for the analysis of 2D-electrophoresis gels. RECOMB 2001: 114-123 - 2000
- [i1]Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz:
Covering Simple Polygonal Regions by Ellipses. EuroCG 2000: 89-92
1990 – 1999
- 1999
- [j6]Helmut Alt, Ulrich Fuchs, Klaus Kriegel:
On The Number Of Simple Cycles In Planar Graphs. Comb. Probab. Comput. 8(5): 397-405 (1999) - [j5]Frank Hoffmann, Klaus Kriegel, Carola Wenk:
An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots. Discret. Appl. Math. 93(1): 75-88 (1999) - [j4]Stefan Felsner, Klaus Kriegel:
Triangles in Euclidean Arrangements. Discret. Comput. Geom. 22(3): 429-438 (1999) - 1998
- [c12]Frank Hoffmann, Klaus Kriegel, Carola Wenk:
Matching 2D Patterns of Protein Spots. SCG 1998: 231-239 - [c11]Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel:
Moving an Angle Around a Region. SWAT 1998: 71-82 - [c10]Stefan Felsner, Klaus Kriegel:
Triangles in Euclidean Arrangements. WG 1998: 137-148 - 1997
- [c9]Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel:
A Competitive Strategy for Learning a Polygon. SODA 1997: 166-174 - [c8]Helmut Alt, Ulrich Fuchs, Klaus Kriegel:
On the Number of Simple Cycles in Planar Graphs. WG 1997: 15-24 - 1996
- [j3]Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer:
Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. 6: 21-44 (1996) - [j2]Frank Hoffmann, Klaus Kriegel:
A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems. SIAM J. Discret. Math. 9(2): 210-224 (1996) - 1994
- [c7]Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer:
Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG 1994: 302-307 - 1993
- [c6]Frank Hoffmann, Klaus Kriegel:
A Graph Coloring Result and Its Consequences for Some Guarding Problems. ISAAC 1993: 78-87 - 1991
- [c5]Frank Hoffmann, Michael Kaufmann, Klaus Kriegel:
The Art Gallery Theorem for Polygons With Holes. FOCS 1991: 39-48
1980 – 1989
- 1988
- [j1]Klaus Kriegel, Stephan Waack:
Lower Bounds on The Complexity of Real-Time Branching Programs. RAIRO Theor. Informatics Appl. 22(4): 447-459 (1988) - 1987
- [c4]Klaus Kriegel, Stephan Waack:
Exponential Lower Bounds for Real-Time Branching Programs. FCT 1987: 263-267 - 1986
- [c3]Klaus Kriegel:
The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus. MFCS 1986: 484-492 - 1985
- [c2]Klaus Kriegel, Stephan Waack:
Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version). FCT 1985: 227-233 - 1984
- [b1]Klaus Kriegel:
Universelle 1-Kiesel-Automaten für k-komponentige Labyrinthe. Akademie der Wissenschaften der DDR, Berlin, Germany, 1984, pp. 1-91 - [c1]Armin Hemmerling, Klaus Kriegel:
On Searching of Special Cases of Mazes and Finite Embedded Graphs. MFCS 1984: 291-300
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
