Search the dblp DataBase

Publications of Author

1. 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. [Citation Graph (0, 0)][DBLP]
   CCCG, 2005, pp:126-129 [Conf]
   
2. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl
   Pre-triangulations and liftable complexes. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 2006, pp:282-291 [Conf]
   
3. Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, Hannes Krasser
   On the number of plane graphs. [Citation Graph (0, 0)][DBLP]
   SODA, 2006, pp:504-513 [Conf]
   
4. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer
   Connecting colored point sets. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:3, pp:271-278 [Journal]
   
5. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann
   On (Pointed) Minimum Weight Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP]
   CCCG, 2007, pp:209-212 [Conf]
   
6. 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. [Citation Graph (0, 0)][DBLP]
   WADS, 2007, pp:458-469 [Conf]
   
7. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder, Zbynek Sír
   Computational and Structural Advantages of Circular Boundary Representation. [Citation Graph (0, 0)][DBLP]
   WADS, 2007, pp:374-385 [Conf]
   
8. 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 [Citation Graph (0, 0)][DBLP]
   CoRR, 2007, v:0, n:, pp:- [Journal]
   
9. 
   Empty Monochromatic Triangles. [Citation Graph (, )][DBLP]
   
   
10. 
    Compatible pointed pseudo-triangulations. [Citation Graph (, )][DBLP]
    
    
11. 
    Blocking delaunay triangulations. [Citation Graph (, )][DBLP]
    
    
12. 
    Divide-and-conquer for Voronoi diagrams revisited. [Citation Graph (, )][DBLP]
    
    
13. 
    Plane Graphs with Parity Constraints. [Citation Graph (, )][DBLP]
    
    
14. 
    Generating Shifting Workloads to Benchmark Adaptability in Relational Database Systems. [Citation Graph (, )][DBLP]
    
    
15. 
    Medial axis computation for planar free-form shapes. [Citation Graph (, )][DBLP]
    
    
16. 
    Matching edges and faces in polygonal partitions. [Citation Graph (, )][DBLP]
    
    
17. 
    Empty monochromatic triangles. [Citation Graph (, )][DBLP]
    
    
18. 
    On minimum weight pseudo-triangulations. [Citation Graph (, )][DBLP]
    
    
19. 
    Divide-and-conquer for Voronoi diagrams revisited. [Citation Graph (, )][DBLP]
    
    
20. 
    Pre-Triangulations and Liftable Complexes. [Citation Graph (, )][DBLP]