_id,doi,title
3565,10.1007/978-1-4613-8997-2_25,Probing convex polytopes
3649,10.1016/0040-5809(90)90002-D,Dynamics of polygenic characters under selection
3650,10.1093/genetics/124.4.921,Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones
3651,10.1093/genetics/124.3.773 ,Pleiotropic models of quantitative variation
4060,10.1016/S0747-7171(08)80068-5,Tetrahedrizing point sets in three dimensions
4063,10.1145/77635.77639,Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms
4064,10.1080/01621459.1990.10475313,Computing least median of squares regression lines and guided topological sweep
4065,10.1016/0012-365X(90)90147-A,Covering convex sets with non-overlapping polygons
4066,10.1007/BF02187785,The complexity of many cells in arrangements of planes and related problems
4067,10.1007/3-540-52921-7_91,A hyperplane Incidence problem with applications to counting distances
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