Klaus Kriegel

795 total citations
32 papers, 392 citations indexed

About

Klaus Kriegel is a scholar working on Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition and Artificial Intelligence. According to data from OpenAlex, Klaus Kriegel has authored 32 papers receiving a total of 392 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computer Graphics and Computer-Aided Design, 14 papers in Computer Vision and Pattern Recognition and 7 papers in Artificial Intelligence. Recurrent topics in Klaus Kriegel's work include Computational Geometry and Mesh Generation (18 papers), Robotic Path Planning Algorithms (7 papers) and Algorithms and Data Compression (7 papers). Klaus Kriegel is often cited by papers focused on Computational Geometry and Mesh Generation (18 papers), Robotic Path Planning Algorithms (7 papers) and Algorithms and Data Compression (7 papers). Klaus Kriegel collaborates with scholars based in Germany, United States and Netherlands. Klaus Kriegel's co-authors include Frank Hoffmann, Carola Wenk, Rolf Klein, Frank Hoffmann, Christian Icking, Michael Kaufmann, Christian Knauer, Darko Dimitrov, Alon Efrat and Günter Rote and has published in prestigious journals such as Electrophoresis, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Klaus Kriegel

26 papers receiving 351 citations

Peers

Klaus Kriegel

CVPR

CGCD

CNC

SPECT

Hubert Wagener Germany

Ernst Althaus Germany

Yi Fang United States

Benedek Nagy Hungary

E. Wes Bethel United States

L.C.G.J.M. Habets Netherlands

Giorgio Scorzelli United States

K. Benkrid United Kingdom

Andrew D. J. Cross United Kingdom

Hubert Wagener Germany

Klaus Kriegel

154 ×1.2

CVPR

15 ×0.1

145 ×1.3

CGCD

61 ×0.7

CNC

8 ×0.1

SPECT

Citations per year, relative to Klaus Kriegel Klaus Kriegel (= 1×) peers Hubert Wagener

Countries citing papers authored by Klaus Kriegel

Since Specialization

Citations

This map shows the geographic impact of Klaus Kriegel's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Klaus Kriegel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Klaus Kriegel more than expected).

Fields of papers citing papers by Klaus Kriegel

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Klaus Kriegel. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Klaus Kriegel. The network helps show where Klaus Kriegel may publish in the future.

Co-authorship network of co-authors of Klaus Kriegel

This figure shows the co-authorship network connecting the top 25 collaborators of Klaus Kriegel. A scholar is included among the top collaborators of Klaus Kriegel based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Klaus Kriegel. Klaus Kriegel is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Hoffmann, Frank, et al.. (2018). Tight bounds for conflict-free chromatic guarding of orthogonal art galleries. Computational Geometry. 73. 24–34. 2 indexed citations

Hoffmann, Frank, et al.. (2015). Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries. TU/e Research Portal. 421–435.

Knauer, Christian, et al.. (2010). Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions. Theoretical Computer Science. 412(4-5). 375–382.

Dimitrov, Darko, Christian Knauer, Klaus Kriegel, & Günter Rote. (2009). Bounds on the quality of the PCA bounding boxes. Computational Geometry. 42(8). 772–789. 31 indexed citations

Dimitrov, Darko, et al.. (2008). EXPERIMENTAL STUDY OF BOUNDING BOX ALGORITHMS. 15–22. 3 indexed citations

Dimitrov, Darko, Christian Knauer, & Klaus Kriegel. (2006). REGISTRATION OF 3D - PATTERNS AND SHAPES WITH CHARACTERISTIC POINTS. 393–400. 2 indexed citations

Efrat, Alon, Frank Hoffmann, Christian Knauer, et al.. (2003). Covering with Ellipses. Algorithmica. 38(1). 145–160. 4 indexed citations

Efrat, Alon, Frank Hoffmann, Christian Knauer, et al.. (2002). Covering shapes by ellipses. Symposium on Discrete Algorithms. 453–454. 2 indexed citations

Efrat, Alon, et al.. (2002). Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels. Journal of Computational Biology. 9(2). 299–315. 39 indexed citations

10.

Hoffmann, Frank, Christian Icking, Rolf Klein, & Klaus Kriegel. (2001). The Polygon Exploration Problem. SIAM Journal on Computing. 31(2). 577–600. 45 indexed citations

11.

Kriegel, Klaus, Frank Hoffmann, Carola Wenk, et al.. (2000). An alternative approach to deal with geometric uncertainties in computer analysis of two-dimensional electrophoresis gels. Electrophoresis. 21(13). 2637–2640. 19 indexed citations

12.

Hoffmann, Frank, Klaus Kriegel, & Carola Wenk. (1999). An applied point pattern matching problem: comparing 2D patterns of protein spots. Discrete Applied Mathematics. 93(1). 75–88. 27 indexed citations

13.

Felsner, Stefan & Klaus Kriegel. (1999). Triangles in Euclidean Arrangements. Discrete & Computational Geometry. 22(3). 429–438. 4 indexed citations

14.

Alt, Helmut, U. Fuchs, & Klaus Kriegel. (1999). On the Number of Simple Cycles in Planar Graphs. Combinatorics Probability Computing. 8(5). 397–405. 8 indexed citations

15.

Pleißner, Klaus‐Peter, Frank Hoffmann, Klaus Kriegel, et al.. (1999). New algorithmic approaches to protein spot detection and pattern matching in two-dimensional electrophoresis gel databases. Electrophoresis. 20(4-5). 755–765. 62 indexed citations

16.

Hoffmann, Frank, Christian Icking, Rolf Klein, & Klaus Kriegel. (1997). A competitive strategy for learning a polygon. Symposium on Discrete Algorithms. 166–174. 21 indexed citations

17.

Győri, Ervin, Frank Hoffmann, Klaus Kriegel, & Thomas C. Shermer. (1996). Generalized guarding and partitioning for rectilinear polygons. Computational Geometry. 6(1). 21–44. 12 indexed citations

18.

Hoffmann, Frank & Klaus Kriegel. (1996). A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems. SIAM Journal on Discrete Mathematics. 9(2). 210–224. 17 indexed citations

19.

Hoffmann, Frank & Klaus Kriegel. (1988). Embedding rectilinear graphs in linear time. Information Processing Letters. 29(2). 75–79. 11 indexed citations

20.

Kriegel, Klaus, et al.. (1987). The dimension of graphs with respect to the direct powers of a two-element graph. Bulletin of the Australian Mathematical Society. 36(2). 251–265. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact