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, Clemens Huemer, S. Kappes, Bettina Speckmann, Csaba D. Tóth
   Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles. [Citation Graph (0, 0)][DBLP]
   MFCS, 2006, pp:86-97 [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, Clemens Huemer, Hannes Krasser
   Transforming spanning trees and pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:97, n:1, pp:19-22 [Journal]
   
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, 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]
   
8. 
   Empty Monochromatic Triangles. [Citation Graph (, )][DBLP]
   
   
9. 
   Transforming spanning trees and pseudo-triangulations. [Citation Graph (, )][DBLP]
   
   
10. 
    On pseudo-convex decompositions, partitions, and coverings. [Citation Graph (, )][DBLP]
    
    
11. 
    4-Labelings and Grid Embeddings of Plane Quadrangulations. [Citation Graph (, )][DBLP]
    
    
12. 
    Matching edges and faces in polygonal partitions. [Citation Graph (, )][DBLP]
    
    
13. 
    Triangulations without pointed spanning trees. [Citation Graph (, )][DBLP]
    
    
14. 
    On triconnected and cubic plane graphs on given point sets. [Citation Graph (, )][DBLP]
    
    
15. 
    Empty monochromatic triangles. [Citation Graph (, )][DBLP]
    
    
16. 
    Compatible geometric matchings. [Citation Graph (, )][DBLP]
    
    
17. 
    Gray codes for non-crossing partitions and dissections of a convex polygon. [Citation Graph (, )][DBLP]