_id,doi,title
4068, 10.1007/BF02187778,"The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2"
4069,10.1007/BF02122779,An acyclicity theorem for cell complexes in d dimension
4070,10.1080/00207169008803871,Ranking intervals under visibility constraints
4071,10.1145/98524.98535,An O(n^2log n) time algorithm for the MinMax angle triangulation
4072, 10.1007/BF02187784,The complexity and construction of many faces in arrangements of lines and of segments
4073,10.1109/FSCS.1990.89543,Counting and cutting cycles of lines and rods in space
4074,10.1007/BF02187783,Combinatorial complexity bounds for arrangements of curves and spheres
4075,10.1007/BF01840404,Searching for empty convex polygons
4076,10.1145/98524.98567, Euclidean minimum spanning trees and bichromatic closest pairs
4077,10.1145/98524.98548,Points and triangles in the plane and halving planes in space
4078,10.1145/98524.98551,Slimming down by adding; selecting heavily covered points