default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHannes Krasser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c11]Heimo Gursch
, Stefan Körner, Hannes Krasser, Roman Kern:
Parameter Forecasting for Vehicle Paint Quality Optimisation. MuC (Workshopband) 2016
2000 – 2009
- 2008
- [j13]Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber:
Matching edges and faces in polygonal partitions. Comput. Geom. 39(2): 134-141 (2008) - [j12]Oswin Aichholzer, Clemens Huemer, Hannes Krasser:
Triangulations without pointed spanning trees. Comput. Geom. 40(1): 79-83 (2008) - 2007
- [j11]Oswin Aichholzer, Hannes Krasser:
Abstract order type extension and new results on the rectilinear crossing number. Comput. Geom. 36(1): 2-15 (2007) - [j10]Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Birgit Vogtenhuber:
On the Number of Plane Geometric Graphs. Graphs Comb. 23(Supplement-1): 67-84 (2007) - 2006
- [j9]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
On the Crossing Number of Complete Graphs. Computing 76(1-2): 165-176 (2006) - [j8]Franz Aurenhammer, Hannes Krasser:
Pseudo-Simplicial Complexes from Maximal Locally Convex Functions. Discret. Comput. Geom. 35(2): 201-221 (2006) - [j7]Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser:
Transforming spanning trees and pseudo-triangulations. Inf. Process. Lett. 97(1): 19-22 (2006) - [j6]Franz Aurenhammer, Robert L. Scot Drysdale, Hannes Krasser:
Farthest line segment Voronoi diagrams. Inf. Process. Lett. 100(6): 220-225 (2006) - [c10]Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, Hannes Krasser:
On the number of plane graphs. SODA 2006: 504-513 - 2005
- [j5]Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia:
Games on triangulations. Theor. Comput. Sci. 343(1-2): 42-71 (2005) - [c9]Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber:
Matching Edges and Faces in Polygonal Partitions. CCCG 2005: 126-129 - [c8]Oswin Aichholzer, Hannes Krasser:
Abstract order type extension and new results on the rectilinear crossing number. SCG 2005: 91-98 - [i3]Oswin Aichholzer, Hannes Krasser:
Abstract order type extension and new results on the rectilinear crossing number. EuroCG 2005: 61-64 - [i2]Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser:
Transforming spanning trees and pseudo-triangulations. EuroCG 2005: 81-84 - [i1]Franz Aurenhammer, Hannes Krasser:
Pseudo-tetrahedral complexes. EuroCG 2005: 85-88 - 2004
- [j4]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann:
Convexity minimizes pseudo-triangulations. Comput. Geom. 28(1): 3-10 (2004) - 2003
- [j3]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Peter Braß:
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip. SIAM J. Comput. 32(6): 1621-1653 (2003) - [j2]Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado, Hannes Krasser:
Towards compatible triangulations. Theor. Comput. Sci. 296(1): 3-13 (2003) - [c7]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips. WADS 2003: 12-24 - 2002
- [j1]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
Enumerating Order Types for Small Point Sets with Applications. Order 19(3): 265-281 (2002) - [c6]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann:
Convexity minimizes pseudo-triangulations. CCCG 2002: 158-161 - [c5]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
On the crossing number of complete graphs. SCG 2002: 19-24 - [c4]Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia:
Playing with Triangulations. JCDCG 2002: 22-37 - 2001
- [c3]Oswin Aichholzer, Hannes Krasser:
The point set order type data base: A collection of applications and results. CCCG 2001: 17-20 - [c2]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado:
Towards Compatible Triangulations. COCOON 2001: 101-110 - [c1]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
Enumerating order types for small sets with applications. SCG 2001: 11-18
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-10-07 22:06 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:
