{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T01:37:55Z","timestamp":1688607475695},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01931281","type":"journal-article","created":{"date-parts":[[2005,7,30]],"date-time":"2005-07-30T20:17:25Z","timestamp":1122754645000},"page":"202-219","source":"Crossref","is-referenced-by-count":5,"title":["Finding squares and rectangles in sets of points"],"prefix":"10.1007","volume":"31","author":[{"given":"Marc J.","family":"van Kreveld","sequence":"first","affiliation":[]},{"given":"Mark T.","family":"De Berg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01931281_CR1","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N. and T. Nishizeki,Arboricity and subgraph listing algorithms, SIAM J. on Computing 14 (1985), 210\u2013223.","journal-title":"SIAM J. on Computing"},{"key":"BF01931281_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02187721","volume":"4","author":"F. R. K. Chung","year":"1989","unstructured":"Chung, F. R. K.,Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs, Discr. & Comp. Geometry 4 (1989), 183\u2013190.","journal-title":"Discr. & Comp. Geometry"},{"key":"BF01931281_CR3","doi-asserted-by":"crossref","unstructured":"Clarkson, K. L., H. Edelsbrunner, L. J. Guibas, M. Sharir and E. Welzl,Combinatorial complexity bounds for arrangements of curves and surfaces, 29th Ann. Symp. on Found. of Comp. Sci. (1988), 568\u2013579.","DOI":"10.1109\/SFCS.1988.21973"},{"key":"BF01931281_CR4","first-page":"79","volume":"1","author":"M. Berg de","year":"1990","unstructured":"de Berg, M., M. Overmars and M. van Kreveld,Finding complete bipartite subgraphs in bipartite graphs, Algorithms Review 1 (1990), 79\u201385.","journal-title":"Algorithms Review"},{"key":"BF01931281_CR5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1080\/00029890.1946.11991674","volume":"53","author":"P. Erd\u00f6s","year":"1946","unstructured":"Erd\u00f6s, P.,On sets of distances of n points, Amer. Math. Monthly 53 (1946), 248\u2013250.","journal-title":"Amer. Math. Monthly"},{"key":"BF01931281_CR6","first-page":"165","volume":"5","author":"P. Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P.,On sets of distances of n points in Euclidean space, Magyar Tud. Akad. Mat. Kutal\u00f3 Int. Kozl. 5 (1960), 165\u2013169.","journal-title":"Magyar Tud. Akad. Mat. Kutal\u00f3 Int. Kozl."},{"key":"BF01931281_CR7","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and D. S. Johnson,Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York (1979)."},{"key":"BF01931281_CR8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K\u00f6v\u00e1ri","year":"1954","unstructured":"K\u00f6v\u00e1ri, T., V. T. S\u00f3s and P. Tur\u00e1n,On a problem of K. Zarankiewicz, Colloquium Math. 3 (1954), 50\u201357.","journal-title":"Colloquium Math."},{"key":"BF01931281_CR9","first-page":"293","volume-title":"Graph Theory and Combinatories","author":"J. Spencer","year":"1984","unstructured":"Spencer, J., E. Szemer\u00e9di and W. T. Trotter, Jr.,Unit distances in the Euclidean plane, inGraph Theory and Combinatories, Academic Press, London, (1984), 293\u2013303."}],"container-title":["BIT Numerical Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01931281.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01931281\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01931281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T13:04:57Z","timestamp":1586351097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01931281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01931281"],"URL":"https:\/\/doi.org\/10.1007\/bf01931281","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}