The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Oswin Aichholzer: [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, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
    Reconfiguring Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  4. Oswin Aichholzer, Ferran Hurtado, Marc Noy
    On the number of triangulations every planar point set must have. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:13-16 [Conf]
  5. Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
    Degree Bounds for Constrained Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:155-158 [Conf]
  6. 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]
  7. Oswin Aichholzer, David Orden, Francisco Santos, Bettina Speckmann
    On the Number of Pseudo-Triangulations of Certain Point Sets. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:141-144 [Conf]
  8. Oswin Aichholzer, Franz Aurenhammer
    Straight Skeletons for General Polygonal Figures in the Plane. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:117-126 [Conf]
  9. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado
    Towards Compatible Triangulations. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:101-110 [Conf]
  10. Oswin Aichholzer
    The Path of a Triangulation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:14-23 [Conf]
  11. Oswin Aichholzer, Franz Aurenhammer, Peter Braay
    Spatial embedding of pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:144-153 [Conf]
  12. Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou
    Voronoi Diagrams for Direction-Sensitive Distances. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:418-420 [Conf]
  13. 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]
  14. 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]
  15. 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]
  16. Oswin Aichholzer, Franz Aurenhammer, Belén Palop
    Quickest paths, straight skeletons, and the city Voronoi diagram. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:151-159 [Conf]
  17. Oswin Aichholzer, Franz Aurenhammer, Michael Taschwer, Günter Rote
    Triangulations Intersect Nicely. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:220-229 [Conf]
  18. 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]
  19. Helmut Alt, Oswin Aichholzer, Günter Rote
    Matching Shapes with a Reference Point. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:85-92 [Conf]
  20. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado
    Edge Operations on Non-Crossing Spanning Trees. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:121-125 [Conf]
  21. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
    Generalized Self-Approaching Curves. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:317-326 [Conf]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu
    The Zigzag Path of a Pseudo-Triangulation. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:377-388 [Conf]
  27. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado
    Sequences of spanning trees and a fixed tree theorem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:1-2, pp:3-20 [Journal]
  28. 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]
  29. Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristan, Michael A. Soss
    Long proteins with unique optimal foldings in the H-P model. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:139-159 [Journal]
  30. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
    Reconfiguring convex polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:20, n:1-2, pp:85-95 [Journal]
  31. Oswin Aichholzer, Ferran Hurtado, Marc Noy
    A lower bound on the number of triangulations of planar point sets. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:2, pp:135-145 [Journal]
  32. 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]
  33. 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]
  34. Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint
    Flipturning polygons [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  35. Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristan, Michael A. Soss
    Long Proteins with Unique Optimal Foldings in the H-P Model [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  36. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
    Generalized self-approaching curves. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:3-24 [Journal]
  37. 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]
  38. Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu
    Triangulations Intersect Nicely. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:4, pp:339-359 [Journal]
  39. Oswin Aichholzer, Franz Aurenhammer, Belén Palop
    Quickest Paths, Straight Skeletons, and the City Voronoi Diagram. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:17-35 [Journal]
  40. Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou
    Skew Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:3, pp:235-0 [Journal]
  41. Oswin Aichholzer, Helmut Alt, Günter Rote
    Matching Shapes with a Reference Point. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:4, pp:349-363 [Journal]
  42. Oswin Aichholzer, Lyuba Alboul, Ferran Hurtado
    On Flips in Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:2, pp:303-311 [Journal]
  43. Oswin Aichholzer, Franz Aurenhammer, Reinhard Hainz
    New Results on MWT Subgraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:5, pp:215-219 [Journal]
  44. 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]
  45. Oswin Aichholzer, Franz Aurenhammer, Günter Rote, Yin-Feng Xu
    Constant-Level Greedy Triangulations Approximate the MWT Well. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:361-369 [Journal]
  46. Oswin Aichholzer, Franz Aurenhammer, David Alberts, Bernd Gärtner
    A Novel Type of Skeleton for Polygons. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1995, v:1, n:12, pp:752-761 [Journal]
  47. 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]
  48. 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]
  49. Oswin Aichholzer, Franz Aurenhammer
    Classifying Hyperplanes in Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:225-232 [Journal]
  50. 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]
  51. 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]
  52. Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh
    Improved Upper Bounds on the Reflexivity of Point Sets. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:29-32 [Conf]
  53. 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]
  54. Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber
    Pointed Drawings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:237-240 [Conf]
  55. 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]
  56. 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]
  57. Oswin Aichholzer, Klaus Reinhardt
    A quadratic distance bound on sliding between crossing-free spanning trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:3, pp:155-161 [Journal]
  58. 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]
  59. Oswin Aichholzer, Jesus Garcia, David Orden, Pedro Ramos
    New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:38, n:1, pp:1-14 [Journal]

  60. Empty Monochromatic Triangles. [Citation Graph (, )][DBLP]


  61. Compatible pointed pseudo-triangulations. [Citation Graph (, )][DBLP]


  62. Blocking delaunay triangulations. [Citation Graph (, )][DBLP]


  63. Divide-and-conquer for Voronoi diagrams revisited. [Citation Graph (, )][DBLP]


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


  65. On pseudo-convex decompositions, partitions, and coverings. [Citation Graph (, )][DBLP]


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


  67. Plane Graphs with Parity Constraints. [Citation Graph (, )][DBLP]


  68. Medial axis computation for planar free-form shapes. [Citation Graph (, )][DBLP]


  69. Recovering Structure from r-Sampled Objects. [Citation Graph (, )][DBLP]


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


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


  72. Improved upper bounds on the reflexivity of point sets. [Citation Graph (, )][DBLP]


  73. Empty monochromatic triangles. [Citation Graph (, )][DBLP]


  74. Editorial. [Citation Graph (, )][DBLP]


  75. Compatible geometric matchings. [Citation Graph (, )][DBLP]


  76. On minimum weight pseudo-triangulations. [Citation Graph (, )][DBLP]


  77. Divide-and-conquer for Voronoi diagrams revisited. [Citation Graph (, )][DBLP]


  78. On k-Convex Polygons [Citation Graph (, )][DBLP]


  79. Pre-Triangulations and Liftable Complexes. [Citation Graph (, )][DBLP]


  80. New results on lower bounds for the number of (<=k)-facets. [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.024secs
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