_id,doi,title
4062,10.1007/BF02574700,Points and triangles in the plane and halving planes in space
4066,10.1007/BF02187785,The complexity of many cells in arrangements of planes and related problems
4068,10.1007/BF02187778,"The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2"
4072,10.1007/BF02187784,The complexity and construction of many faces in arrangements of lines and of segments
4074,10.1007/BF02187783,Combinatorial complexity bounds for arrangements of curves and spheres
4081,10.1007/BF02187733,The upper envelope of piecewise linear functions: Algorithms and applications
4086,10.1007/BF02187734,The upper envelope of piecewise linear functions: Tight bounds on the number of faces 
4088,10.1007/BF02187742,Implicitly representing arrangements of lines or segments
4089,10.1007/BF02187745,On arrangements of Jordan arcs with three intersections per pair
4093,10.1007/BF02187720,The complexity of cutting complexes
4100,10.1007/BF02187875,Linear space data structures for two types of range search
4108,10.1007/BF02187681,Voronoi diagrams and arrangements