The following pages link to Oswin Aichholzer (Q170468):
Displaying 50 items.
- (Q223976) (redirect page) (← links)
- Geometric achromatic and pseudoachromatic indices (Q292239) (← links)
- New results on MWT subgraphs (Q294658) (← links)
- (Q390174) (redirect page) (← links)
- Reprint of: Extreme point and halving edge search in abstract order types (Q390177) (← links)
- Theta-3 is connected (Q396473) (← links)
- (Q427047) (redirect page) (← links)
- On \(k\)-convex polygons (Q427049) (← links)
- Pointed drawings of planar graphs (Q452448) (← links)
- (Q486982) (redirect page) (← links)
- Geodesic order types (Q486983) (← links)
- (Q587299) (redirect page) (← links)
- (Q590619) (redirect page) (← links)
- Convexity minimizes pseudo-triangulations (Q598549) (← links)
- Blocking Delaunay triangulations (Q691770) (← links)
- On the crossing number of complete graphs (Q817025) (← links)
- Folding polyominoes with holes into a cube (Q827332) (← links)
- Empty monochromatic triangles (Q833720) (← links)
- Connecting colored point sets (Q868381) (← links)
- Abstract order type extension and new results on the rectilinear crossing number (Q870421) (← links)
- A quadratic distance bound on sliding between crossing-free spanning trees (Q883234) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- On \(k\)-gons and \(k\)-holes in point sets (Q899713) (← links)
- Compatible geometric matchings (Q924079) (← links)
- On minimum weight pseudo-triangulations (Q924080) (← links)
- Divide-and-conquer for Voronoi diagrams revisited (Q991182) (← links)
- Improved upper bounds on the reflexivity of point sets (Q1000926) (← links)
- New results on lower bounds for the number of \((\leq k)\)-facets (Q1039428) (← links)
- Transforming spanning trees and pseudo-triangulations (Q1044747) (← links)
- Constant-level greedy triangulations approximate the MWT well (Q1288473) (← links)
- Towards compatible triangulations. (Q1401254) (← links)
- Quickest paths, straight skeletons, and the city Voronoi diagram (Q1424315) (← links)
- Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\) (Q1622346) (← links)
- Linear transformation distance for bichromatic matchings (Q1699281) (← links)
- Modem illumination of monotone polygons (Q1699284) (← links)
- Computing balanced islands in two colored point sets in the plane (Q1708264) (← links)
- Perfect \(k\)-colored matchings and \((k+2)\)-gonal tilings (Q1756102) (← links)
- Triangulations intersect nicely (Q1816461) (← links)
- Enumerating order types for small point sets with applications (Q1863073) (← links)
- Flipturning Polygons (Q1864190) (← links)
- Long proteins with unique optimal foldings in the H-P model (Q1873159) (← links)
- A lower bound on the number of triangulations of planar point sets (Q1882855) (← links)
- Shape spaces via medial axis transforms for segmentation of complex geometry in 3D voxel data (Q1953859) (← links)
- Geometric dominating sets -- a minimum version of the no-three-in-line problem (Q2088885) (← links)
- On crossing-families in planar point sets (Q2144455) (← links)
- Perfect matchings with crossings (Q2169938) (← links)
- On the 2-colored crossing number (Q2206834) (← links)
- On the edge-vertex ratio of maximal thrackles (Q2206880) (← links)
- On compatible matchings (Q2232249) (← links)
- On \(k\)-convex point sets (Q2248736) (← links)
