{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:57:13Z","timestamp":1725469033238},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377917"},{"type":"electronic","value":"9783540377931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_30","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T10:25:12Z","timestamp":1156501512000},"page":"339-350","source":"Crossref","is-referenced-by-count":1,"title":["k-Sets of Convex Inclusion Chains of Planar Point Sets"],"prefix":"10.1007","author":[{"given":"Wael","family":"El Oraiby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Schmitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48447-7_1","volume-title":"Algorithms and Data Structures","author":"A. Andrzejak","year":"1999","unstructured":"Andrzejak, A., Fukuda, K.: Optimization over k-set polytopes and efficient k-set enumeration. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 1\u201312. Springer, Heidelberg (1999)"},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s00454-002-2778-4","volume":"29","author":"A. Andrzejak","year":"2003","unstructured":"Andrzejak, A., Welzl, E.: In between k-sets, j-facets, and i-faces: (i,j)-partitions. Discrete Comput. Geom.\u00a029, 105\u2013131 (2003)","journal-title":"Discrete Comput. Geom."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/363647.363652","volume":"48","author":"T.M. Chan","year":"2001","unstructured":"Chan, T.M.: Dynamic planar convex hull operations in near-logarithmic amortized time. J. ACM\u00a048, 1\u201312 (2001)","journal-title":"J. ACM"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0216005","volume":"16","author":"R. Cole","year":"1987","unstructured":"Cole, R., Sharir, M., Yap, C.K.: On k-hulls and related problems. SIAM J. Comput.\u00a016, 61\u201377 (1987)","journal-title":"SIAM J. Comput."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"T.K. Dey","year":"1998","unstructured":"Dey, T.K.: Improved bounds on planar k-sets and related problems. Discrete Comput. Geom.\u00a019, 373\u2013382 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/PL00009291","volume":"17","author":"H. Edelsbrunner","year":"1997","unstructured":"Edelsbrunner, H., Valtr, P., Welzl, E.: Cutting dense point sets in half. Discrete Comput. Geom.\u00a017, 243\u2013255 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TC.1982.1675946","volume":"C-31","author":"D.T. Lee","year":"1982","unstructured":"Lee, D.T.: On k-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput.\u00a0C-31, 478\u2013487 (1982)","journal-title":"IEEE Trans. Comput."},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"A. Melkman","year":"1987","unstructured":"Melkman, A.: On-line construction of the convex hull of a simple polyline. Inform. Process. Lett.\u00a025, 11\u201312 (1987)","journal-title":"Inform. Process. Lett."},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"The Design of Dynamic Data Structures","author":"M.H. Overmars","year":"1983","unstructured":"Overmars, M.H.: The Design of Dynamic Data Structures. LNCS, vol.\u00a0156. Springer, Heidelberg (1983)"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M.H. Overmars","year":"1981","unstructured":"Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci.\u00a023, 166\u2013204 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0012-365X(85)90193-1","volume":"56","author":"G.W. Peck","year":"1985","unstructured":"Peck, G.W.: On k-sets in the plane. Discrete Math.\u00a056, 73\u201374 (1985)","journal-title":"Discrete Math."},{"issue":"2","key":"30_CR12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s004540010022","volume":"26","author":"G. T\u00f3th","year":"2001","unstructured":"T\u00f3th, G.: Point sets with many k-sets. Discrete Comput. Geom.\u00a026(2), 187\u2013194 (2001)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T23:50:39Z","timestamp":1553298639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11821069_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}