2009 |
67 | EE | Eyal Ackerman,
Oswin Aichholzer,
Balázs Keszegh:
Improved upper bounds on the reflexivity of point sets.
Comput. Geom. 42(3): 241-249 (2009) |
2008 |
66 | | Oswin Aichholzer,
Ruy Fabila Monroy,
David Flores-Peñaloza,
Thomas Hackl,
Clemens Huemer,
Jorge Urrutia:
Empty Monochromatic Triangles.
CCCG 2008 |
65 | 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) |
64 | EE | Oswin Aichholzer,
Clemens Huemer,
Hannes Krasser:
Triangulations without pointed spanning trees.
Comput. Geom. 40(1): 79-83 (2008) |
63 | EE | Oswin Aichholzer,
Sergey Bereg,
Adrian Dumitrescu,
Alfredo García,
Clemens Huemer,
Ferran Hurtado,
Mikio Kano,
Alberto Márquez,
David Rappaport,
Shakhar Smorodinsky,
Diane L. Souvaine,
Jorge Urrutia,
David R. Wood:
Compatible Geometric Matchings.
Electronic Notes in Discrete Mathematics 31: 201-206 (2008) |
62 | EE | Oswin Aichholzer,
David Orden,
Francisco Santos,
Bettina Speckmann:
On the number of pseudo-triangulations of certain point sets.
J. Comb. Theory, Ser. A 115(2): 254-278 (2008) |
2007 |
61 | | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl,
Bettina Speckmann:
On (Pointed) Minimum Weight Pseudo-Triangulations.
CCCG 2007: 209-212 |
60 | | Oswin Aichholzer,
Günter Rote,
André Schulz,
Birgit Vogtenhuber:
Pointed Drawings of Planar Graphs.
CCCG 2007: 237-240 |
59 | | Eyal Ackerman,
Oswin Aichholzer,
Balázs Keszegh:
Improved Upper Bounds on the Reflexivity of Point Sets.
CCCG 2007: 29-32 |
58 | 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 |
57 | 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 |
56 | 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) |
55 | EE | Oswin Aichholzer,
Hannes Krasser:
Abstract order type extension and new results on the rectilinear crossing number.
Comput. Geom. 36(1): 2-15 (2007) |
54 | EE | Oswin Aichholzer,
Klaus Reinhardt:
A quadratic distance bound on sliding between crossing-free spanning trees.
Comput. Geom. 37(3): 155-161 (2007) |
53 | EE | Oswin Aichholzer,
Jesus Garcia,
David Orden,
Pedro Ramos:
New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn.
Discrete & Computational Geometry 38(1): 1-14 (2007) |
52 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl:
Pre-Triangulations and Liftable Complexes.
Discrete & Computational Geometry 38(4): 701-725 (2007) |
51 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl,
Clemens Huemer:
Connecting colored point sets.
Discrete Applied Mathematics 155(3): 271-278 (2007) |
50 | EE | Oswin Aichholzer,
Jesús García,
David Orden,
Pedro Ramos:
New results on lower bounds for the number of (k)-facets: (extended abstract).
Electronic Notes in Discrete Mathematics 29: 189-193 (2007) |
2006 |
49 | EE | Oswin Aichholzer,
Clemens Huemer,
S. Kappes,
Bettina Speckmann,
Csaba D. Tóth:
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles.
MFCS 2006: 86-97 |
48 | EE | Oswin Aichholzer,
Thomas Hackl,
Birgit Vogtenhuber,
Clemens Huemer,
Ferran Hurtado,
Hannes Krasser:
On the number of plane graphs.
SODA 2006: 504-513 |
47 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl:
Pre-triangulations and liftable complexes.
Symposium on Computational Geometry 2006: 282-291 |
46 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser:
On the Crossing Number of Complete Graphs.
Computing 76(1-2): 165-176 (2006) |
45 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Clemens Huemer,
Hannes Krasser:
Transforming spanning trees and pseudo-triangulations.
Inf. Process. Lett. 97(1): 19-22 (2006) |
2005 |
44 | 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 |
43 | EE | Oswin Aichholzer,
Hannes Krasser:
Abstract order type extension and new results on the rectilinear crossing number.
Symposium on Computational Geometry 2005: 91-98 |
42 | EE | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Ferran Hurtado,
Evangelos Kranakis,
Hannes Krasser,
Suneeta Ramaswami,
Saurabh Sethia,
Jorge Urrutia:
Games on triangulations.
Theor. Comput. Sci. 343(1-2): 42-71 (2005) |
2004 |
41 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser,
Bettina Speckmann:
Convexity minimizes pseudo-triangulations.
Comput. Geom. 28(1): 3-10 (2004) |
40 | EE | Oswin Aichholzer,
Ferran Hurtado,
Marc Noy:
A lower bound on the number of triangulations of planar point sets.
Comput. Geom. 29(2): 135-145 (2004) |
39 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Belén Palop:
Quickest Paths, Straight Skeletons, and the City Voronoi Diagram.
Discrete & Computational Geometry 31(1): 17-35 (2004) |
2003 |
38 | | Oswin Aichholzer,
David Orden,
Francisco Santos,
Bettina Speckmann:
On the Number of Pseudo-Triangulations of Certain Point Sets.
CCCG 2003: 141-144 |
37 | | Oswin Aichholzer,
Michael Hoffmann,
Bettina Speckmann,
Csaba D. Tóth:
Degree Bounds for Constrained Pseudo-Triangulations.
CCCG 2003: 155-158 |
36 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Peter Braay:
Spatial embedding of pseudo-triangulations.
Symposium on Computational Geometry 2003: 144-153 |
35 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser:
Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips.
WADS 2003: 12-24 |
34 | EE | Oswin Aichholzer,
Günter Rote,
Bettina Speckmann,
Ileana Streinu:
The Zigzag Path of a Pseudo-Triangulation.
WADS 2003: 377-388 |
33 | | 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.
Comput. Geom. 25(1-2): 139-159 (2003) |
32 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser,
Peter Braß:
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip.
SIAM J. Comput. 32(6): 1621-1653 (2003) |
31 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Ferran Hurtado,
Hannes Krasser:
Towards compatible triangulations.
Theor. Comput. Sci. 296(1): 3-13 (2003) |
2002 |
30 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser,
Bettina Speckmann:
Convexity minimizes pseudo-triangulations.
CCCG 2002: 158-161 |
29 | EE | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Ferran Hurtado,
Evangelos Kranakis,
Hannes Krasser,
Suneeta Ramaswami,
Saurabh Sethia,
Jorge Urrutia:
Playing with Triangulations.
JCDCG 2002: 22-37 |
28 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Belén Palop:
Quickest paths, straight skeletons, and the city Voronoi diagram.
Symposium on Computational Geometry 2002: 151-159 |
27 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser:
On the crossing number of complete graphs.
Symposium on Computational Geometry 2002: 19-24 |
26 | EE | 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
CoRR cs.CG/0201018: (2002) |
25 | | Oswin Aichholzer,
Franz Aurenhammer,
Ferran Hurtado:
Sequences of spanning trees and a fixed tree theorem.
Comput. Geom. 21(1-2): 3-20 (2002) |
24 | EE | Oswin Aichholzer,
Lyuba Alboul,
Ferran Hurtado:
On Flips in Polyhedral Surfaces.
Int. J. Found. Comput. Sci. 13(2): 303-311 (2002) |
23 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser:
Enumerating Order Types for Small Point Sets with Applications.
Order 19(3): 265-281 (2002) |
2001 |
22 | EE | Oswin Aichholzer,
Ferran Hurtado,
Marc Noy:
On the number of triangulations every planar point set must have.
CCCG 2001: 13-16 |
21 | EE | Oswin Aichholzer,
Hannes Krasser:
The point set order type data base: A collection of applications and results.
CCCG 2001: 17-20 |
20 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser,
Ferran Hurtado:
Towards Compatible Triangulations.
COCOON 2001: 101-110 |
19 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser:
Enumerating order types for small sets with applications.
Symposium on Computational Geometry 2001: 11-18 |
18 | | Oswin Aichholzer,
Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
Mark H. Overmars,
Michael A. Soss,
Godfried T. Toussaint:
Reconfiguring convex polygons.
Comput. Geom. 20(1-2): 85-95 (2001) |
17 | | Oswin Aichholzer,
Franz Aurenhammer,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Günter Rote:
Generalized self-approaching curves.
Discrete Applied Mathematics 109(1-2): 3-24 (2001) |
2000 |
16 | EE | Oswin Aichholzer,
Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
Mark H. Overmars,
Michael A. Soss,
Godfried T. Toussaint:
Reconfiguring Convex Polygons.
CCCG 2000 |
15 | | Oswin Aichholzer,
Franz Aurenhammer,
Ferran Hurtado:
Edge Operations on Non-Crossing Spanning Trees.
EWCG 2000: 121-125 |
14 | EE | 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
CoRR cs.CG/0008010: (2000) |
1999 |
13 | EE | Oswin Aichholzer:
The Path of a Triangulation.
Symposium on Computational Geometry 1999: 14-23 |
12 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Reinhard Hainz:
New Results on MWT Subgraphs.
Inf. Process. Lett. 69(5): 215-219 (1999) |
11 | | Oswin Aichholzer,
Franz Aurenhammer,
Danny Z. Chen,
D. T. Lee,
Evanthia Papadopoulou:
Skew Voronoi Diagrams.
Int. J. Comput. Geometry Appl. 9(3): 235- (1999) |
1998 |
10 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Günter Rote:
Generalized Self-Approaching Curves.
ISAAC 1998: 317-326 |
9 | | Oswin Aichholzer,
Franz Aurenhammer,
Günter Rote,
Yin-Feng Xu:
Constant-Level Greedy Triangulations Approximate the MWT Well.
J. Comb. Optim. 2(4): 361-369 (1998) |
1997 |
8 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Danny Z. Chen,
D. T. Lee,
Asish Mukhopadhyay,
Evanthia Papadopoulou:
Voronoi Diagrams for Direction-Sensitive Distances.
Symposium on Computational Geometry 1997: 418-420 |
7 | | Oswin Aichholzer,
Helmut Alt,
Günter Rote:
Matching Shapes with a Reference Point.
Int. J. Comput. Geometry Appl. 7(4): 349-363 (1997) |
1996 |
6 | | Oswin Aichholzer,
Franz Aurenhammer:
Straight Skeletons for General Polygonal Figures in the Plane.
COCOON 1996: 117-126 |
5 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Siu-Wing Cheng,
Naoki Katoh,
Günter Rote,
Michael Taschwer,
Yin-Feng Xu:
Triangulations Intersect Nicely.
Discrete & Computational Geometry 16(4): 339-359 (1996) |
4 | EE | Oswin Aichholzer,
Franz Aurenhammer:
Classifying Hyperplanes in Hypercubes.
SIAM J. Discrete Math. 9(2): 225-232 (1996) |
1995 |
3 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Michael Taschwer,
Günter Rote:
Triangulations Intersect Nicely.
Symposium on Computational Geometry 1995: 220-229 |
2 | EE | Oswin Aichholzer,
Franz Aurenhammer,
David Alberts,
Bernd Gärtner:
A Novel Type of Skeleton for Polygons.
J. UCS 1(12): 752-761 (1995) |
1994 |
1 | EE | Helmut Alt,
Oswin Aichholzer,
Günter Rote:
Matching Shapes with a Reference Point.
Symposium on Computational Geometry 1994: 85-92 |