2008 |
11 | | Oswin Aichholzer,
Ruy Fabila Monroy,
David Flores-Peñaloza,
Thomas Hackl,
Clemens Huemer,
Jorge Urrutia:
Empty Monochromatic Triangles.
CCCG 2008 |
10 | EE | 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) |
2007 |
9 | | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl,
Bettina Speckmann:
On (Pointed) Minimum Weight Pseudo-Triangulations.
CCCG 2007: 209-212 |
8 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl,
Bert Jüttler,
Margot Oberneder,
Zbynek Sír:
Computational and Structural Advantages of Circular Boundary Representation.
WADS 2007: 374-385 |
7 | EE | Oswin Aichholzer,
Thomas Hackl,
Michael Hoffmann,
Clemens Huemer,
Attila Pór,
Francisco Santos,
Bettina Speckmann,
Birgit Vogtenhuber:
Maximizing Maximal Angles for Plane Straight-Line Graphs.
WADS 2007: 458-469 |
6 | EE | Oswin Aichholzer,
Thomas Hackl,
Michael Hoffmann,
Clemens Huemer,
Attila Pór,
Francisco Santos,
Bettina Speckmann,
Birgit Vogtenhuber:
Maximizing Maximal Angles for Plane Straight-Line Graphs
CoRR abs/0705.3820: (2007) |
5 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl:
Pre-Triangulations and Liftable Complexes.
Discrete & Computational Geometry 38(4): 701-725 (2007) |
4 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl,
Clemens Huemer:
Connecting colored point sets.
Discrete Applied Mathematics 155(3): 271-278 (2007) |
2006 |
3 | EE | Oswin Aichholzer,
Thomas Hackl,
Birgit Vogtenhuber,
Clemens Huemer,
Ferran Hurtado,
Hannes Krasser:
On the number of plane graphs.
SODA 2006: 504-513 |
2 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl:
Pre-triangulations and liftable complexes.
Symposium on Computational Geometry 2006: 282-291 |
2005 |
1 | EE | 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 |