The following pages link to Alexander Pilz (Q390176):
Displaying 50 items.
- Reprint of: Extreme point and halving edge search in abstract order types (Q390177) (← links)
- New results on stabbing segments with a polygon (Q474818) (← links)
- Geodesic order types (Q486983) (← links)
- Production matrices for geometric graphs (Q510608) (← links)
- Blocking Delaunay triangulations (Q691770) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Order on order types (Q1650795) (← links)
- Characteristic polynomials of production matrices for geometric graphs (Q1689984) (← links)
- Linear transformation distance for bichromatic matchings (Q1699281) (← links)
- The dual diameter of triangulations (Q1699295) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
- Arrangements of approaching pseudo-lines (Q2117345) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- Bisecting three classes of lines (Q2230403) (← links)
- On compatible matchings (Q2232249) (← links)
- On \(k\)-convex point sets (Q2248736) (← links)
- Packing plane spanning graphs with short edges in complete geometric graphs (Q2331211) (← links)
- A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← links)
- Empty triangles in good drawings of the complete graph (Q2345507) (← links)
- Extreme point and halving edge search in abstract order types (Q2391543) (← links)
- Flip distance between triangulations of a planar point set is APX-hard (Q2444311) (← links)
- Lower bounds for the number of small convex \(k\)-holes (Q2444312) (← links)
- Packing plane spanning trees and paths in complete geometric graphs (Q2628273) (← links)
- 3-colorability of pseudo-triangulations (Q2792798) (← links)
- Geodesic-Preserving Polygon Simplification (Q2872066) (← links)
- Geodesic Order Types (Q2914326) (← links)
- (Q2989928) (← links)
- An improved lower bound on the minimum number of triangulations (Q3132839) (← links)
- An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings (Q3459888) (← links)
- From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices (Q4580132) (← links)
- Linear transformation distance for bichromatic matchings (Q4635538) (← links)
- Packing short plane spanning trees in complete geometric graphs (Q4636491) (← links)
- New Results on Stabbing Segments with a Polygon (Q4924645) (← links)
- Augmenting Geometric Graphs with Matchings (Q5014140) (← links)
- On Compatible Matchings (Q5049995) (← links)
- Extending the centerpoint theorem to multiple points (Q5091045) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- Convex Quadrangulations of Bichromatic Point Sets (Q5149559) (← links)
- On plane subgraphs of complete topological drawings (Q5156010) (← links)
- (Q5173163) (← links)
- Monotone Simultaneous Embeddings of Upward Planar Digraphs (Q5176858) (← links)
- (Q5226839) (← links)
- FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR (Q5247062) (← links)
- GEODESIC-PRESERVING POLYGON SIMPLIFICATION (Q5261017) (← links)
- Minimization and maximization versions of the quadratic travelling salesman problem (Q5277951) (← links)
- Order on Order Types (Q5368694) (← links)
- An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings (Q5370571) (← links)
- Holes in 2-convex point sets (Q5915543) (← links)
- Holes in 2-convex point sets (Q5915646) (← links)
- Induced Ramsey-type results and binary predicates for point sets (Q5915805) (← links)
