{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:23:46Z","timestamp":1725600226255},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22300-6_26","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T08:41:31Z","timestamp":1312879291000},"page":"302-313","source":"Crossref","is-referenced-by-count":2,"title":["On Rectilinear Partitions with Minimum Stabbing Number"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amirali","family":"Khosravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sander","family":"Verdonschot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"van der Weele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Erickson, J.: Geometric Range Searching and its Relatives. In: Chazelle, B., Goodman, J., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, pp. 1\u201356 (1998)","DOI":"10.1090\/conm\/223\/03131"},{"key":"26_CR2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"P.K. Ahuja","year":"1993","unstructured":"Ahuja, P.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"26_CR3","unstructured":"Arthur, D., Vassilvitskii, S.: K-means++: the Advantages of Careful Seeding. In: Proc. of the 18th Annual ACM-SIAM Sym. of Desc. Alg., pp. 1027\u20131035 (2007)"},{"key":"26_CR4","first-page":"467","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Welzl, E.: Quasi-optimal Range Searching in Spaces of Finite VC-dimension. Arch. Rat. Mech. Anal.\u00a04, 467\u2013490 (1989)","journal-title":"Arch. Rat. Mech. Anal."},{"key":"26_CR5","unstructured":"Ahuja, P.K., Magnanti, T.L., Orlin, J.B.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)"},{"key":"26_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"26_CR7","volume-title":"A Method of Programming","author":"E.W. Dijkstra","year":"1988","unstructured":"Dijkstra, E.W., Feijen, W.H.J., Sterringa, J.: A Method of Programming. Addison-Wesley, Reading (1988)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00454-008-9114-6","volume":"40","author":"S.P. Fekete","year":"2008","unstructured":"Fekete, S.P., L\u00fcbbecke, M.E., Meijer, H.: Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discr. Comput. Geom.\u00a040, 595\u2013621 (2008)","journal-title":"Discr. Comput. Geom."},{"key":"26_CR9","volume-title":"Computers and Interactibility: A Guide to the Theory of NP-Completness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Interactibility: A Guide to the Theory of NP-Completness. W.H. Freeman and Co., New York (1979)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Haverkort, H., van Walderveen, F.: Four-dimensional Hilbert Curves for R-trees. In: Proc. Workshop on Algorithms Engineering and Experiments, ALANEX (2009)","DOI":"10.1137\/1.9781611972894.7"},{"key":"26_CR11","series-title":"Series in Adv. Inf. and Knowledge Processing","volume-title":"R-trees: Theory and Applications","author":"Y. Manolopoulos","year":"2005","unstructured":"Manolopoulos, Y., Nanopoulos, A., Theodoridis, Y., Papadopoulos, A.: R-trees: Theory and Applications. Series in Adv. Inf. and Knowledge Processing. Springer, Heidelberg (2005)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J., Tarantello, G.: Efficient Partition Trees. Discr. Comput. Geom.\u00a08, 315\u2013334 (1992)","journal-title":"Discr. Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T18:54:08Z","timestamp":1560452048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}