Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Hannes Krasser
2000 – 2009
- 2008
[j12]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)- [j11]Oswin Aichholzer, Clemens Huemer, Hannes Krasser: Triangulations without pointed spanning trees. Comput. Geom. 40(1): 79-83 (2008)
- 2007
- [j10]Oswin Aichholzer, Hannes Krasser: Abstract order type extension and new results on the rectilinear crossing number. Comput. Geom. 36(1): 2-15 (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. Discrete & Computational Geometry 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. Symposium on Computational Geometry 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]
- 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. Symposium on Computational Geometry 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. Symposium on Computational Geometry 2001: 11-18
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-08 21:06 CET by the dblp team