_id,doi,title
4098,10.1016/0097-3165(86)90075-0,The number of extreme pairs of finite point-sets in Euclidean spaces
4099,10.1016/0020-0190(86)90088-8,Halfplanar range search in linear space and O(n0.695) query time
4103,10.1016/0097-3165(86)90078-6,On the maximal number of edges of many faces in an arrangement
4104,10.1137/0215023,Optimal point location in a monotone subdivision
4105,10.1137/0215024,Constructing arrangements of lines and hyperplanes with applications
4106,10.1016/S0747-7171(86)80020-7,Computing a ham-sandwich cut in two dimensions
4107,10.1016/0012-365X(86)90008-7,The complexity of cells in 3-dimensional arrangements
4108,10.1007/BF02187681,Voronoi diagrams and arrangements
4109,10.1093/comjnl/29.1.76,Rectangular point location in d-dimensions with applications
4110,10.1137/0215019,Constructing belts in two-dimensional arrangements with applications
4321,10.1111/j.1558-5646.1986.tb05740.x,"Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland"
4323,10.1016/S0022-5193(86)80033-9,Sibling competition and the advantage of mixed families
4324,10.1017/S0016672300023156,The maintenance of polygenic variation through a balance between mutation and stabilising selection
4111,10.1016/0020-0190(85)90107-3,Finding extreme-points in 3-dimensions and solving the post-office problem in the plane
4112,10.1016/0196-6774(85)90030-6,Batched dynamic solutions to decomposable searching problems
4113,10.1016/0097-3165(85)90017-2,On the number of line separations of a finite set in the plane
4114,10.1007/BF01908077,Investigation of Proportional Link Linkage Clustering Methods
4115,10.1016/0196-6774(85)90039-2,Computing the extreme distances between two convex polygons
4116,10.1016/0304-3975(85)90005-2,Finding Transversals for Sets of Simple Geometric-Figures
4120,10.1016/S0747-7171(85)80028-6,Optimal solutions for a class of point retrieval problems