Hannes Krasser

657 total citations
28 papers, 313 citations indexed

About

Hannes Krasser is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Hannes Krasser has authored 28 papers receiving a total of 313 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computer Graphics and Computer-Aided Design, 12 papers in Computational Theory and Mathematics and 9 papers in Computer Vision and Pattern Recognition. Recurrent topics in Hannes Krasser's work include Computational Geometry and Mesh Generation (20 papers), Advanced Graph Theory Research (10 papers) and Digital Image Processing Techniques (8 papers). Hannes Krasser is often cited by papers focused on Computational Geometry and Mesh Generation (20 papers), Advanced Graph Theory Research (10 papers) and Digital Image Processing Techniques (8 papers). Hannes Krasser collaborates with scholars based in Austria, Spain and Germany. Hannes Krasser's co-authors include Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Ferrán Hurtado, Birgit Vogtenhuber, Peter Braß, Thomas Hackl, Robert L. Scot Drysdale, Werner Renhart and Bernhard Brandstätter and has published in prestigious journals such as SIAM Journal on Computing, IEEE Transactions on Magnetics and Theoretical Computer Science.

In The Last Decade

Hannes Krasser

27 papers receiving 291 citations

Peers

Hannes Krasser

CGCD

CTM

CVPR

DMC

SP

F. Hurtado Spain

Michel Pocchiola France

Rom Pinchasi Israel

Gézá Tóth Hungary

S. Sifrony United States

J Matousek Czechia

Xavier Goaoc France

Fabrizio Frati Italy

Leonidas Palios Greece

Menelaos I. Karavelas Greece

F. Hurtado Spain

Hannes Krasser

228 ×0.8

CGCD

140 ×0.8

CTM

73 ×0.7

CVPR

53 ×1.0

DMC

64 ×1.5

SP

Citations per year, relative to Hannes Krasser Hannes Krasser (= 1×) peers F. Hurtado

Countries citing papers authored by Hannes Krasser

Since Specialization

Citations

This map shows the geographic impact of Hannes Krasser'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 Hannes Krasser with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hannes Krasser more than expected).

Fields of papers citing papers by Hannes Krasser

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hannes Krasser. 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 Hannes Krasser. The network helps show where Hannes Krasser may publish in the future.

Co-authorship network of co-authors of Hannes Krasser

This figure shows the co-authorship network connecting the top 25 collaborators of Hannes Krasser. A scholar is included among the top collaborators of Hannes Krasser 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 Hannes Krasser. Hannes Krasser 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

1.

Aichholzer, Oswin, Franz Aurenhammer, Thomas Hackl, et al.. (2007). Matching edges and faces in polygonal partitions. Computational Geometry. 39(2). 134–141. 5 indexed citations

2.

Aichholzer, Oswin, Clemens Huemer, & Hannes Krasser. (2007). Triangulations without pointed spanning trees. Computational Geometry. 40(1). 79–83. 6 indexed citations

3.

Aichholzer, Oswin, Thomas Hackl, Clemens Huemer, et al.. (2007). On the Number of Plane Geometric Graphs. Graphs and Combinatorics. 23(S1). 67–84. 26 indexed citations

4.

Aichholzer, Oswin, Thomas Hackl, Birgit Vogtenhuber, et al.. (2006). On the number of plane graphs. Symposium on Discrete Algorithms. 504–513. 11 indexed citations

5.

Aichholzer, Oswin & Hannes Krasser. (2006). Abstract order type extension and new results on the rectilinear crossing number. Computational Geometry. 36(1). 2–15. 26 indexed citations

6.

Aichholzer, Oswin, Franz Aurenhammer, Thomas Hackl, et al.. (2005). Matching edges and faces in polygonal partitions. MPG.PuRe (Max Planck Society). 126–129. 2 indexed citations

7.

Aichholzer, Oswin, David Avis, Erik D. Demaine, et al.. (2005). Games on triangulations. Theoretical Computer Science. 343(1-2). 42–71. 1 indexed citations

8.

Aichholzer, Oswin, Franz Aurenhammer, & Hannes Krasser. (2005). On the Crossing Number of Complete Graphs. Computing. 76(1-2). 165–176. 17 indexed citations

9.

Aichholzer, Oswin, Franz Aurenhammer, Clemens Huemer, & Hannes Krasser. (2005). Transforming spanning trees and pseudo-triangulations. Information Processing Letters. 97(1). 19–22. 11 indexed citations

10.

Aurenhammer, Franz & Hannes Krasser. (2005). Pseudo-Tetrahedral Complexes. 85–88. 2 indexed citations

11.

Aichholzer, Oswin, Franz Aurenhammer, Hannes Krasser, & Bettina Speckmann. (2004). Convexity minimizes pseudo-triangulations. Computational Geometry. 28(1). 3–10. 11 indexed citations

12.

Aichholzer, Oswin, Clemens Huemer, & Hannes Krasser. (2004). Triangulations without pointed spanning trees - extended abstract. 221–224. 1 indexed citations

13.

Aichholzer, Oswin, Franz Aurenhammer, Ferrán Hurtado, & Hannes Krasser. (2003). Towards compatible triangulations. Theoretical Computer Science. 296(1). 3–13. 4 indexed citations

14.

Aichholzer, Oswin, Franz Aurenhammer, Hannes Krasser, & Peter Braß. (2003). Pseudotriangulations from Surfaces and a Novel Type of Edge Flip. SIAM Journal on Computing. 32(6). 1621–1653. 29 indexed citations

15.

Aichholzer, Oswin, Franz Aurenhammer, & Hannes Krasser. (2002). On the crossing number of complete graphs. 19–24. 10 indexed citations

16.

Aichholzer, Oswin, Franz Aurenhammer, & Hannes Krasser. (2002). Progress on rectilinear crossing numbers. 1 indexed citations

17.

Aichholzer, Oswin, Franz Aurenhammer, & Hannes Krasser. (2002). Enumerating Order Types for Small Point Sets with Applications. Order. 19(3). 265–281. 53 indexed citations

18.

Aichholzer, Oswin & Hannes Krasser. (2001). The point set order type data base: A collection of applications and results.. Canadian Conference on Computational Geometry. 17–20. 27 indexed citations

19.

Aichholzer, Oswin, Franz Aurenhammer, & Hannes Krasser. (2001). Enumerating order types for small sets with applications. 11–18. 8 indexed citations

20.

Aichholzer, Oswin, et al.. (2000). Niching evolution strategy with cluster algorithms. 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