54 results on '"Aichholzer, Oswin"'
Search Results
2. Geometric dominating sets - a minimum version of the No-Three-In-Line Problem
3. On crossing-families in planar point sets
4. Folding polyominoes with holes into a cube
5. A superlinear lower bound on the number of 5-holes
6. Packing plane spanning graphs with short edges in complete geometric graphs
7. Cross-sections of line configurations in R3 and (d− 2)-flat configurations in Rd
8. Holes in 2-convex point sets
9. Computing balanced islands in two colored point sets in the plane
10. Modem illumination of monotone polygons
11. Linear transformation distance for bichromatic matchings
12. Extreme point and halving edge search in abstract order types
13. New results on lower bounds for the number of (≤k)-facets
14. Packing plane spanning trees and paths in complete geometric graphs
15. On k-gons and k-holes in point sets
16. Reprint of: Theta-3 is connected
17. Theta-3 is connected
18. On k-convex point sets
19. 4-Holes in point sets
20. Lower bounds for the number of small convex k -holes
21. Reprint of: Extreme point and halving edge search in abstract order types
22. More on the crossing number of : Monotone drawings
23. Balanced 6-holes in linearly separable bichromatic point sets
24. Blocking Delaunay triangulations
25. Maximizing maximal angles for plane straight-line graphs
26. Pointed drawings of planar graphs
27. On k-convex polygons
28. There is a unique crossing-minimal rectilinear drawing of K18
29. Divide-and-conquer for Voronoi diagrams revisited
30. Empty monochromatic triangles
31. Editorial
32. On minimum weight pseudo-triangulations
33. Compatible geometric matchings
34. Improved upper bounds on the reflexivity of point sets
35. Compatible Geometric Matchings
36. Triangulations without pointed spanning trees
37. On the number of pseudo-triangulations of certain point sets
38. New results on lower bounds for the number of (⩽ k)-facets
39. A quadratic distance bound on sliding between crossing-free spanning trees
40. Connecting colored point sets
41. Abstract order type extension and new results on the rectilinear crossing number
42. Transforming spanning trees and pseudo-triangulations
43. Games on triangulations
44. A lower bound on the number of triangulations of planar point sets
45. Convexity minimizes pseudo-triangulations
46. Long proteins with unique optimal foldings in the H-P model
47. Towards compatible triangulations
48. Sequences of spanning trees and a fixed tree theorem
49. Reconfiguring convex polygons
50. Generalized self-approaching curves
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.