The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hannes Krasser: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

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, Hannes Krasser, Bettina Speckmann
    Convexity minimizes pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:158-161 [Conf]
  3. Oswin Aichholzer, Hannes Krasser
    The point set order type data base: A collection of applications and results. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:17-20 [Conf]
  4. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado
    Towards Compatible Triangulations. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:101-110 [Conf]
  5. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    Enumerating order types for small sets with applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:11-18 [Conf]
  6. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    On the crossing number of complete graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:19-24 [Conf]
  7. Oswin Aichholzer, Hannes Krasser
    Abstract order type extension and new results on the rectilinear crossing number. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:91-98 [Conf]
  8. Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
    Playing with Triangulations. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:22-37 [Conf]
  9. 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]
  10. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:12-24 [Conf]
  11. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann
    Convexity minimizes pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:1, pp:3-10 [Journal]
  12. Oswin Aichholzer, Hannes Krasser
    Abstract order type extension and new results on the rectilinear crossing number. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:1, pp:2-15 [Journal]
  13. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    On the Crossing Number of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Computing, 2006, v:76, n:1-2, pp:165-176 [Journal]
  14. Franz Aurenhammer, Hannes Krasser
    Pseudo-Simplicial Complexes from Maximal Locally Convex Functions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:2, pp:201-221 [Journal]
  15. 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]
  16. Franz Aurenhammer, Robert L. S. Drysdale, Hannes Krasser
    Farthest line segment Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:6, pp:220-225 [Journal]
  17. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    Enumerating Order Types for Small Point Sets with Applications. [Citation Graph (0, 0)][DBLP]
    Order, 2002, v:19, n:3, pp:265-281 [Journal]
  18. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Peter Braß
    Pseudotriangulations from Surfaces and a Novel Type of Edge Flip. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1621-1653 [Journal]
  19. Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
    Games on triangulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:42-71 [Journal]
  20. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado, Hannes Krasser
    Towards compatible triangulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:3-13 [Journal]

  21. Transforming spanning trees and pseudo-triangulations. [Citation Graph (, )][DBLP]


  22. Abstract order type extension and new results on the rectilinear crossing number. [Citation Graph (, )][DBLP]


  23. Pseudo-tetrahedral complexes. [Citation Graph (, )][DBLP]


  24. Matching edges and faces in polygonal partitions. [Citation Graph (, )][DBLP]


  25. Triangulations without pointed spanning trees. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.302secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002