[{"title":"Finding extreme-points in 3-dimensions and solving the post-office problem in the plane","year":"1985","doi":"10.1016/0020-0190(85)90107-3","abstract":[{"text":"This paper describes an optimal solution for the following geometric search problem defined for a set P of n points in three dimensions: Given a plane h with all points of P on one side and a line ℓ in h, determine a point of P that is hit first when h is rotated around ℓ. The solution takes O(n) space and O(log n) time for a query. By use of geometric transforms, the post-office problem for a finite set of points in two dimensions and certain two-dimensional point location problems are reduced to the former problem and thus also optimally solved.","lang":"eng"}],"author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Maurer, Hermann","last_name":"Maurer","first_name":"Hermann"}],"publication_status":"published","citation":{"ama":"Edelsbrunner H, Maurer H. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. <i>Information Processing Letters</i>. 1985;21(1):39-47. doi:<a href=\"https://doi.org/10.1016/0020-0190(85)90107-3\">10.1016/0020-0190(85)90107-3</a>","mla":"Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.” <i>Information Processing Letters</i>, vol. 21, no. 1, Elsevier, 1985, pp. 39–47, doi:<a href=\"https://doi.org/10.1016/0020-0190(85)90107-3\">10.1016/0020-0190(85)90107-3</a>.","ista":"Edelsbrunner H, Maurer H. 1985. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. 21(1), 39–47.","short":"H. Edelsbrunner, H. Maurer, Information Processing Letters 21 (1985) 39–47.","apa":"Edelsbrunner, H., &#38; Maurer, H. (1985). Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(85)90107-3\">https://doi.org/10.1016/0020-0190(85)90107-3</a>","ieee":"H. Edelsbrunner and H. Maurer, “Finding extreme-points in 3-dimensions and solving the post-office problem in the plane,” <i>Information Processing Letters</i>, vol. 21, no. 1. Elsevier, pp. 39–47, 1985.","chicago":"Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.” <i>Information Processing Letters</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/0020-0190(85)90107-3\">https://doi.org/10.1016/0020-0190(85)90107-3</a>."},"_id":"4111","publication_identifier":{"eissn":["1872-6119"],"issn":["0020-0190"]},"extern":"1","acknowledgement":"Research reported in this paper was partially supported by the Austrian Fonds zur Förderung tier wissenschaftlichen\r\nForschung. \r\n","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","publist_id":"2009","date_updated":"2022-01-31T12:49:12Z","volume":21,"article_processing_charge":"No","publisher":"Elsevier","scopus_import":"1","language":[{"iso":"eng"}],"month":"07","article_type":"original","date_published":"1985-07-10T00:00:00Z","date_created":"2018-12-11T12:07:00Z","intvolume":"        21","status":"public","day":"10","type":"journal_article","issue":"1","publication":"Information Processing Letters","page":"39 - 47"},{"oa_version":"None","quality_controlled":"1","acknowledgement":"Research reported in this paper was done while the second author visited the University of Graz. The first author was supported by the Austrian Fonds zur Förderung der Wissenschaftlichen Forschung. The second author was supported by the Netherlands Organization for the Advancement of Pure Research (ZWO). \r\n","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"issn":["0196-6774"],"eissn":["1090-2678"]},"_id":"4112","article_processing_charge":"No","publist_id":"2010","date_updated":"2022-01-31T13:36:56Z","volume":6,"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"first_name":"Mark","full_name":"Overmars, Mark","last_name":"Overmars"}],"abstract":[{"lang":"eng","text":"The batched static version of a searching problem asks for performing a given set of queries on a given set of objects. All queries are known in advance. The batched dynamic version of a searching problem is the following: given a sequence of insertions, deletions, and queries, perform them on an initially empty set. We will develop methods for solving batched static and batched dynamic versions of searching problems which are in particular applicable to decomposable searching problems. The techniques show that batched static (dynamic) versions of searching problems can often be solved more efficiently than by using known static (dynamic) data structures. In particular, a technique called “streaming” is described that reduces the space requirements considerably. The methods have also a number of applications on set problems. E.g., the k intersecting pairs in a set of n axis-parallel hyper-rectangles in d dimensions can be reported in O (nlogd−1n + k) time using only O(n) space."}],"citation":{"apa":"Edelsbrunner, H., &#38; Overmars, M. (1985). Batched dynamic solutions to decomposable searching problems. <i>Journal of Algorithms</i>. Elsevier. <a href=\"https://doi.org/10.1016/0196-6774(85)90030-6\">https://doi.org/10.1016/0196-6774(85)90030-6</a>","ieee":"H. Edelsbrunner and M. Overmars, “Batched dynamic solutions to decomposable searching problems,” <i>Journal of Algorithms</i>, vol. 6, no. 4. Elsevier, pp. 515–542, 1985.","chicago":"Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.” <i>Journal of Algorithms</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/0196-6774(85)90030-6\">https://doi.org/10.1016/0196-6774(85)90030-6</a>.","ama":"Edelsbrunner H, Overmars M. Batched dynamic solutions to decomposable searching problems. <i>Journal of Algorithms</i>. 1985;6(4):515-542. doi:<a href=\"https://doi.org/10.1016/0196-6774(85)90030-6\">10.1016/0196-6774(85)90030-6</a>","mla":"Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.” <i>Journal of Algorithms</i>, vol. 6, no. 4, Elsevier, 1985, pp. 515–42, doi:<a href=\"https://doi.org/10.1016/0196-6774(85)90030-6\">10.1016/0196-6774(85)90030-6</a>.","ista":"Edelsbrunner H, Overmars M. 1985. Batched dynamic solutions to decomposable searching problems. Journal of Algorithms. 6(4), 515–542.","short":"H. Edelsbrunner, M. Overmars, Journal of Algorithms 6 (1985) 515–542."},"publication_status":"published","title":"Batched dynamic solutions to decomposable searching problems","doi":"10.1016/0196-6774(85)90030-6","year":"1985","page":"515 - 542","publication":"Journal of Algorithms","issue":"4","status":"public","intvolume":"         6","type":"journal_article","day":"01","date_created":"2018-12-11T12:07:00Z","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Elsevier","date_published":"1985-12-01T00:00:00Z","article_type":"original","month":"12"},{"article_processing_charge":"No","publist_id":"2011","date_updated":"2022-01-31T14:14:25Z","volume":38,"publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"extern":"1","_id":"4113","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"chicago":"Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Line Separations of a Finite Set in the Plane.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/0097-3165(85)90017-2\">https://doi.org/10.1016/0097-3165(85)90017-2</a>.","ieee":"H. Edelsbrunner and E. Welzl, “On the number of line separations of a finite set in the plane,” <i>Journal of Combinatorial Theory Series A</i>, vol. 38, no. 1. Elsevier, pp. 15–29, 1985.","apa":"Edelsbrunner, H., &#38; Welzl, E. (1985). On the number of line separations of a finite set in the plane. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/0097-3165(85)90017-2\">https://doi.org/10.1016/0097-3165(85)90017-2</a>","ista":"Edelsbrunner H, Welzl E. 1985. On the number of line separations of a finite set in the plane. Journal of Combinatorial Theory Series A. 38(1), 15–29.","short":"H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 38 (1985) 15–29.","mla":"Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Line Separations of a Finite Set in the Plane.” <i>Journal of Combinatorial Theory Series A</i>, vol. 38, no. 1, Elsevier, 1985, pp. 15–29, doi:<a href=\"https://doi.org/10.1016/0097-3165(85)90017-2\">10.1016/0097-3165(85)90017-2</a>.","ama":"Edelsbrunner H, Welzl E. On the number of line separations of a finite set in the plane. <i>Journal of Combinatorial Theory Series A</i>. 1985;38(1):15-29. doi:<a href=\"https://doi.org/10.1016/0097-3165(85)90017-2\">10.1016/0097-3165(85)90017-2</a>"},"publication_status":"published","abstract":[{"lang":"eng","text":"Let S denote a set of n points in the Euclidean plane. A subset S′ of S is termed a k-set of S if it contains k points and there exists a straight line which has no point of S on it and separates S′ from S−S′. We let fk(n) denote the maximum number of k-sets which can be realized by a set of n points. This paper studies the asymptotic behaviour of fk(n) as this function has applications to a number of problems in computational geometry. A lower and an upper bound on fk(n) is established. Both are nontrivial and improve bounds known before. In particular,  is shown by exhibiting special point-sets which realize that many k-sets. In addition,  is proved by the study of a combinatorial problem which is of interest in its own right."}],"author":[{"first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Emo","last_name":"Welzl","full_name":"Welzl, Emo"}],"year":"1985","doi":"10.1016/0097-3165(85)90017-2","title":"On the number of line separations of a finite set in the plane","publication":"Journal of Combinatorial Theory Series A","issue":"1","page":"15 - 29","day":"01","type":"journal_article","intvolume":"        38","status":"public","date_created":"2018-12-11T12:07:01Z","month":"01","date_published":"1985-01-01T00:00:00Z","article_type":"original","scopus_import":"1","publisher":"Elsevier","language":[{"iso":"eng"}]},{"doi":"10.1007/BF01908077","year":"1985","title":"Investigation of Proportional Link Linkage Clustering Methods","publication_status":"published","citation":{"short":"W. Day, H. Edelsbrunner, Journal of Classification 2 (1985) 239–254.","ista":"Day W, Edelsbrunner H. 1985. Investigation of Proportional Link Linkage Clustering Methods. Journal of Classification. 2(2–3), 239–254.","ama":"Day W, Edelsbrunner H. Investigation of Proportional Link Linkage Clustering Methods. <i>Journal of Classification</i>. 1985;2(2-3):239-254. doi:<a href=\"https://doi.org/10.1007/BF01908077\">10.1007/BF01908077</a>","mla":"Day, William, and Herbert Edelsbrunner. “Investigation of Proportional Link Linkage Clustering Methods.” <i>Journal of Classification</i>, vol. 2, no. 2–3, Springer, 1985, pp. 239–54, doi:<a href=\"https://doi.org/10.1007/BF01908077\">10.1007/BF01908077</a>.","chicago":"Day, William, and Herbert Edelsbrunner. “Investigation of Proportional Link Linkage Clustering Methods.” <i>Journal of Classification</i>. Springer, 1985. <a href=\"https://doi.org/10.1007/BF01908077\">https://doi.org/10.1007/BF01908077</a>.","ieee":"W. Day and H. Edelsbrunner, “Investigation of Proportional Link Linkage Clustering Methods,” <i>Journal of Classification</i>, vol. 2, no. 2–3. Springer, pp. 239–254, 1985.","apa":"Day, W., &#38; Edelsbrunner, H. (1985). Investigation of Proportional Link Linkage Clustering Methods. <i>Journal of Classification</i>. Springer. <a href=\"https://doi.org/10.1007/BF01908077\">https://doi.org/10.1007/BF01908077</a>"},"abstract":[{"text":"Proportional link linkage (PLL) clustering methods are a parametric family of monotone invariant agglomerative hierarchical clustering methods. This family includes the single, minimedian, and complete linkage clustering methods as special cases; its members are used in psychological and ecological applications. Since the literature on clustering space distortion is oriented to quantitative input data, we adapt its basic concepts to input data with only ordinal significance and analyze the space distortion properties of PLL methods. To enable PLL methods to be used when the numbern of objects being clustered is large, we describe an efficient PLL algorithm that operates inO(n 2 logn) time andO(n 2) space","lang":"eng"}],"author":[{"last_name":"Day","full_name":"Day, William","first_name":"William"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert"}],"publist_id":"2006","volume":2,"date_updated":"2022-01-31T10:37:13Z","article_processing_charge":"No","_id":"4114","extern":"1","publication_identifier":{"issn":["0176-4268"],"eissn":["1432-1343"]},"acknowledgement":"This work was partially supported by the Natural Sciences and Engineering Research Council of Canada and by the Austrian Fonds zur Förderung der wissenschaftlichen Forschung.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","month":"12","date_published":"1985-12-01T00:00:00Z","article_type":"original","publisher":"Springer","scopus_import":"1","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:07:01Z","day":"01","type":"journal_article","intvolume":"         2","status":"public","issue":"2-3","publication":"Journal of Classification","page":"239 - 254"},{"date_created":"2018-12-11T12:07:01Z","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Academic Press","date_published":"1985-06-01T00:00:00Z","article_type":"original","month":"06","page":"213 - 224","publication":"Journal of Algorithms","issue":"2","status":"public","intvolume":"         6","type":"journal_article","day":"01","title":"Computing the extreme distances between two convex polygons","doi":"10.1016/0196-6774(85)90039-2","year":"1985","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"eissn":["1090-2678"],"issn":["0196-6774"]},"extern":"1","_id":"4115","article_processing_charge":"No","date_updated":"2022-01-31T10:44:41Z","volume":6,"publist_id":"2007","author":[{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"A polygon in the plane is convex if it contains all line segments connecting any two of its points. Let P and Q denote two convex polygons. The computational complexity of finding the minimum and maximum distance possible between two points p in P and q in Q is studied. An algorithm is described that determines the minimum distance (together with points p and q that realize it) in O(logm + logn) time, where m and n denote the number of vertices of P and Q, respectively. This is optimal in the worst case. For computing the maximum distance, a lower bound Ω(m + n) is proved. This bound is also shown to be best possible by establishing an upper bound of O(m + n).","lang":"eng"}],"citation":{"mla":"Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” <i>Journal of Algorithms</i>, vol. 6, no. 2, Academic Press, 1985, pp. 213–24, doi:<a href=\"https://doi.org/10.1016/0196-6774(85)90039-2\">10.1016/0196-6774(85)90039-2</a>.","ama":"Edelsbrunner H. Computing the extreme distances between two convex polygons. <i>Journal of Algorithms</i>. 1985;6(2):213-224. doi:<a href=\"https://doi.org/10.1016/0196-6774(85)90039-2\">10.1016/0196-6774(85)90039-2</a>","ista":"Edelsbrunner H. 1985. Computing the extreme distances between two convex polygons. Journal of Algorithms. 6(2), 213–224.","short":"H. Edelsbrunner, Journal of Algorithms 6 (1985) 213–224.","ieee":"H. Edelsbrunner, “Computing the extreme distances between two convex polygons,” <i>Journal of Algorithms</i>, vol. 6, no. 2. Academic Press, pp. 213–224, 1985.","apa":"Edelsbrunner, H. (1985). Computing the extreme distances between two convex polygons. <i>Journal of Algorithms</i>. Academic Press. <a href=\"https://doi.org/10.1016/0196-6774(85)90039-2\">https://doi.org/10.1016/0196-6774(85)90039-2</a>","chicago":"Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” <i>Journal of Algorithms</i>. Academic Press, 1985. <a href=\"https://doi.org/10.1016/0196-6774(85)90039-2\">https://doi.org/10.1016/0196-6774(85)90039-2</a>."},"publication_status":"published"},{"status":"public","intvolume":"        35","type":"journal_article","day":"01","page":"55 - 69","issue":"1","publication":"Theoretical Computer Science","language":[{"iso":"eng"}],"publisher":"Elsevier","scopus_import":"1","article_type":"original","date_published":"1985-01-01T00:00:00Z","month":"01","date_created":"2018-12-11T12:07:02Z","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"A straight line that intersects all members of a set S of objects in the real plane is called a transversal of S. Geometric transforms are described that reduce transversal problems for various types of objects to convex hull problems for points. These reductions lead to efficient algorithms for finding transversals which are also described. Applications of the algorithms are found in computer graphics: “Reproduce the line displayed by a collection of pixels”, and in statistics: “Find the line that minimizes the maximum distance from a collection of (weighted) points in the plane”."}],"publication_status":"published","citation":{"ista":"Edelsbrunner H. 1985. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 35(1), 55–69.","short":"H. Edelsbrunner, Theoretical Computer Science 35 (1985) 55–69.","ama":"Edelsbrunner H. Finding Transversals for Sets of Simple Geometric-Figures. <i>Theoretical Computer Science</i>. 1985;35(1):55-69. doi:<a href=\"https://doi.org/10.1016/0304-3975(85)90005-2\">10.1016/0304-3975(85)90005-2</a>","mla":"Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” <i>Theoretical Computer Science</i>, vol. 35, no. 1, Elsevier, 1985, pp. 55–69, doi:<a href=\"https://doi.org/10.1016/0304-3975(85)90005-2\">10.1016/0304-3975(85)90005-2</a>.","chicago":"Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” <i>Theoretical Computer Science</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/0304-3975(85)90005-2\">https://doi.org/10.1016/0304-3975(85)90005-2</a>.","ieee":"H. Edelsbrunner, “Finding Transversals for Sets of Simple Geometric-Figures,” <i>Theoretical Computer Science</i>, vol. 35, no. 1. Elsevier, pp. 55–69, 1985.","apa":"Edelsbrunner, H. (1985). Finding Transversals for Sets of Simple Geometric-Figures. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3975(85)90005-2\">https://doi.org/10.1016/0304-3975(85)90005-2</a>"},"acknowledgement":"The author gratefully acknowledges the criticism of an anonymous referee who discovered a serious flaw in an earlier version of this paper. ","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"Published Version","quality_controlled":"1","_id":"4116","publication_identifier":{"eissn":["0304-3975"],"issn":["0304-3975"]},"extern":"1","publist_id":"2008","oa":1,"date_updated":"2022-01-31T11:09:26Z","volume":35,"article_processing_charge":"No","title":"Finding Transversals for Sets of Simple Geometric-Figures","doi":"10.1016/0304-3975(85)90005-2","year":"1985","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0304397585900052?via%3Dihub","open_access":"1"}]},{"publication_status":"published","citation":{"short":"B. Chazelle, H. Edelsbrunner, Journal of Symbolic Computation 1 (1985) 47–56.","ista":"Chazelle B, Edelsbrunner H. 1985. Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. 1(1), 47–56.","ama":"Chazelle B, Edelsbrunner H. Optimal solutions for a class of point retrieval problems. <i>Journal of Symbolic Computation</i>. 1985;1(1):47-56. doi:<a href=\"https://doi.org/10.1016/S0747-7171(85)80028-6\">10.1016/S0747-7171(85)80028-6</a>","mla":"Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.” <i>Journal of Symbolic Computation</i>, vol. 1, no. 1, Elsevier, 1985, pp. 47–56, doi:<a href=\"https://doi.org/10.1016/S0747-7171(85)80028-6\">10.1016/S0747-7171(85)80028-6</a>.","chicago":"Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.” <i>Journal of Symbolic Computation</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/S0747-7171(85)80028-6\">https://doi.org/10.1016/S0747-7171(85)80028-6</a>.","apa":"Chazelle, B., &#38; Edelsbrunner, H. (1985). Optimal solutions for a class of point retrieval problems. <i>Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0747-7171(85)80028-6\">https://doi.org/10.1016/S0747-7171(85)80028-6</a>","ieee":"B. Chazelle and H. Edelsbrunner, “Optimal solutions for a class of point retrieval problems,” <i>Journal of Symbolic Computation</i>, vol. 1, no. 1. Elsevier, pp. 47–56, 1985."},"author":[{"last_name":"Chazelle","full_name":"Chazelle, Bernard","first_name":"Bernard"},{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"Let P be a set of n points in the Euclidean plane and let C be a convex figure. We study the problem of preprocessing P so that for any query point q, the points of P in C+q can be retrieved efficiently. If constant time sumces for deciding the inclusion of a point in C, we then demonstrate the existence of an optimal solution: the algorithm requires O(n) space and O(k + log n) time for a query with output size k. If C is a disk, the problem becomes the wellknown fixed-radius neighbour problem, to which we thus provide the first known optimal solution.","lang":"eng"}],"volume":1,"date_updated":"2022-01-31T09:20:18Z","publist_id":"2004","oa":1,"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"The first author was supported i~1 part by NSF grants MCS 83-03925 and the Office of Naval Research and the Defense Advanced Research Projects Agency under contract N00014-g3-K-0146 and ARPA Order No. 4786.","oa_version":"Published Version","quality_controlled":"1","_id":"4120","extern":"1","publication_identifier":{"eissn":["1095-855X"],"issn":["0747-7171"]},"doi":"10.1016/S0747-7171(85)80028-6","year":"1985","title":"Optimal solutions for a class of point retrieval problems","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0747717185800286?via%3Dihub"}],"type":"journal_article","day":"01","status":"public","intvolume":"         1","page":"47 - 56","issue":"1","publication":"Journal of Symbolic Computation","article_type":"original","date_published":"1985-03-01T00:00:00Z","month":"03","language":[{"iso":"eng"}],"publisher":"Elsevier","date_created":"2018-12-11T12:07:03Z"},{"alternative_title":["Progress in leukocyte biology "],"date_created":"2018-12-11T12:07:48Z","month":"01","year":"1985","date_published":"1985-01-01T00:00:00Z","title":"Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy","publisher":"Liss","language":[{"iso":"eng"}],"publication":"Genetic Control of Host Resistance to Infection and Malignancy","editor":[{"first_name":"Emil","last_name":"Skamene","full_name":"Skamene, Emil"}],"article_processing_charge":"No","publist_id":"1872","volume":3,"date_updated":"2022-02-02T09:23:20Z","extern":"1","publication_identifier":{"isbn":["9780845141021"]},"_id":"4241","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","day":"01","citation":{"ista":"Curtis C, Curtis J, Barton NH. 1985.Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy. In: Genetic Control of Host Resistance to Infection and Malignancy. Progress in leukocyte biology , vol. 3.","short":"C. Curtis, J. Curtis, N.H. Barton, in:, E. Skamene (Ed.), Genetic Control of Host Resistance to Infection and Malignancy, Liss, 1985.","ama":"Curtis C, Curtis J, Barton NH. Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy. In: Skamene E, ed. <i>Genetic Control of Host Resistance to Infection and Malignancy</i>. Vol 3. Progress in leukocyte biology. Liss; 1985.","mla":"Curtis, C., et al. “Methodology for Testing the Hypothesis of Single Locus Control of Host Resistance to Infection and Malignancy.” <i>Genetic Control of Host Resistance to Infection and Malignancy</i>, edited by Emil Skamene, vol. 3, Liss, 1985.","chicago":"Curtis, C., J. Curtis, and Nicholas H Barton. “Methodology for Testing the Hypothesis of Single Locus Control of Host Resistance to Infection and Malignancy.” In <i>Genetic Control of Host Resistance to Infection and Malignancy</i>, edited by Emil Skamene, Vol. 3. Progress in Leukocyte Biology. Liss, 1985.","apa":"Curtis, C., Curtis, J., &#38; Barton, N. H. (1985). Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy. In E. Skamene (Ed.), <i>Genetic Control of Host Resistance to Infection and Malignancy</i> (Vol. 3). Liss.","ieee":"C. Curtis, J. Curtis, and N. H. Barton, “Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy,” in <i>Genetic Control of Host Resistance to Infection and Malignancy</i>, vol. 3, E. Skamene, Ed. Liss, 1985."},"publication_status":"published","series_title":"Progress in leukocyte biology","type":"book_chapter","intvolume":"         3","author":[{"first_name":"C.","full_name":"Curtis, C.","last_name":"Curtis"},{"first_name":"J.","last_name":"Curtis","full_name":"Curtis, J."},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"status":"public"},{"date_created":"2018-12-11T12:08:16Z","article_type":"original","date_published":"1985-04-25T00:00:00Z","year":"1985","doi":"10.1038/314668a0","month":"04","language":[{"iso":"eng"}],"publisher":"Nature Publishing Group","title":"Haldane's Rule OK","scopus_import":"1","external_id":{"pmid":["3990801"]},"publist_id":"1716","volume":314,"date_updated":"2022-01-28T12:42:09Z","page":"668 - 668","article_processing_charge":"No","publication":"Nature","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","pmid":1,"_id":"4325","extern":"1","type":"journal_article","publication_status":"published","citation":{"ista":"Jones S, Barton NH. 1985. Haldane’s Rule OK. Nature. 314, 668–668.","short":"S. Jones, N.H. Barton, Nature 314 (1985) 668–668.","ama":"Jones S, Barton NH. Haldane’s Rule OK. <i>Nature</i>. 1985;314:668-668. doi:<a href=\"https://doi.org/10.1038/314668a0\">10.1038/314668a0</a>","mla":"Jones, Steve, and Nicholas H. Barton. “Haldane’s Rule OK.” <i>Nature</i>, vol. 314, Nature Publishing Group, 1985, pp. 668–668, doi:<a href=\"https://doi.org/10.1038/314668a0\">10.1038/314668a0</a>.","chicago":"Jones, Steve, and Nicholas H Barton. “Haldane’s Rule OK.” <i>Nature</i>. Nature Publishing Group, 1985. <a href=\"https://doi.org/10.1038/314668a0\">https://doi.org/10.1038/314668a0</a>.","ieee":"S. Jones and N. H. Barton, “Haldane’s Rule OK,” <i>Nature</i>, vol. 314. Nature Publishing Group, pp. 668–668, 1985.","apa":"Jones, S., &#38; Barton, N. H. (1985). Haldane’s Rule OK. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/314668a0\">https://doi.org/10.1038/314668a0</a>"},"day":"25","status":"public","author":[{"full_name":"Jones, Steve","last_name":"Jones","first_name":"Steve"},{"first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"       314"},{"date_created":"2018-12-11T12:08:16Z","doi":"10.1146/annurev.es.16.110185.000553","year":"1985","month":"11","date_published":"1985-11-01T00:00:00Z","article_type":"original","publisher":"Annual Reviews","title":"Analysis of hybrid zones","language":[{"iso":"eng"}],"publication":"Annual Review of Ecology and Systematics","date_updated":"2022-01-28T12:32:23Z","publist_id":"1714","volume":16,"page":"113 - 148","article_processing_charge":"No","_id":"4326","extern":"1","publication_identifier":{"eissn":["1545-2069"],"issn":["0066-4162"]},"acknowledgement":"We thank R. Butlin, D. Currie, R. A. Nichols , and S. Rouhani for their thoughtful comments on the manuscript, and their help in preparing the Figures and Tables; all those (too numerous to name) who gave us details of their unpublished work; and T. Tsang and S. Ward for their patient typing. This work was supported by grants from the NERC and SERC to G. M. Hewitt, and from the SERC and the Nuffield Foundation to N. H. Barton.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","quality_controlled":"1","publication_status":"published","citation":{"chicago":"Barton, Nicholas H, and Godfrey Hewitt. “Analysis of Hybrid Zones.” <i>Annual Review of Ecology and Systematics</i>. Annual Reviews, 1985. <a href=\"https://doi.org/10.1146/annurev.es.16.110185.000553\">https://doi.org/10.1146/annurev.es.16.110185.000553</a>.","ieee":"N. H. Barton and G. Hewitt, “Analysis of hybrid zones,” <i>Annual Review of Ecology and Systematics</i>, vol. 16. Annual Reviews, pp. 113–148, 1985.","apa":"Barton, N. H., &#38; Hewitt, G. (1985). Analysis of hybrid zones. <i>Annual Review of Ecology and Systematics</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev.es.16.110185.000553\">https://doi.org/10.1146/annurev.es.16.110185.000553</a>","ista":"Barton NH, Hewitt G. 1985. Analysis of hybrid zones. Annual Review of Ecology and Systematics. 16, 113–148.","short":"N.H. Barton, G. Hewitt, Annual Review of Ecology and Systematics 16 (1985) 113–148.","ama":"Barton NH, Hewitt G. Analysis of hybrid zones. <i>Annual Review of Ecology and Systematics</i>. 1985;16:113-148. doi:<a href=\"https://doi.org/10.1146/annurev.es.16.110185.000553\">10.1146/annurev.es.16.110185.000553</a>","mla":"Barton, Nicholas H., and Godfrey Hewitt. “Analysis of Hybrid Zones.” <i>Annual Review of Ecology and Systematics</i>, vol. 16, Annual Reviews, 1985, pp. 113–48, doi:<a href=\"https://doi.org/10.1146/annurev.es.16.110185.000553\">10.1146/annurev.es.16.110185.000553</a>."},"day":"01","type":"journal_article","intvolume":"        16","status":"public","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H"},{"full_name":"Hewitt, Godfrey","last_name":"Hewitt","first_name":"Godfrey"}]}]