{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T09:48:40Z","timestamp":1747907320613},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412557"},{"type":"electronic","value":"9783540409960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40996-3_47","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:17:32Z","timestamp":1188350252000},"page":"552-563","source":"Crossref","is-referenced-by-count":1,"title":["Maintenance of a Piercing Set for Intervals with Applications"],"prefix":"10.1007","author":[{"given":"Matthew J.","family":"Katz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Segal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,1,29]]},"reference":[{"key":"47_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-48686-0_39","volume-title":"Generalized shooter location problem","author":"J. Chaudhri","year":"1999","unstructured":"J. Chaudhri and S. C. Nandy \u201cGeneralized shooter location problem\u201d, in Lecture Notes in Computer Science 1627, pp. 389\u2013401, 1999."},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02189314","volume":"9","author":"B. Chazelle","year":"1993","unstructured":"B. Chazelle \u201cCutting hyperplanes for divide-and-conquer\u201d, Discrete Comput. Geom. 9 (1993), pp. 145\u2013158.","journal-title":"Discrete Comput. Geom."},{"key":"47_CR3","unstructured":"K. Daniels and V. Milenkovic \u201cLimited Gaps\u201d, in Proc. 6th Canad. Conf. Comput. Geom., pp. 225\u2013231, 1994."},{"issue":"3","key":"47_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R. J. Fowler","year":"1981","unstructured":"R. J. Fowler and M. S. Paterson and S. L. Tanimoto \u201cOptimal packing and covering in the plane are NP-complete\u201d, Info. Processing Letters 12(3) (1981), pp. 133\u2013137.","journal-title":"Info. Processing Letters"},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/0196-6774(88)90023-5","volume":"9","author":"M. C. Golumbic","year":"1988","unstructured":"M. C. Golumbic and P. L. Hammer \u201cStability in circular arc graphs\u201d, J. of Algorithms 9 (1988), pp. 314\u2013320.","journal-title":"J. of Algorithms"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/net.3230120410","volume":"12","author":"U. Gupta","year":"1982","unstructured":"U. Gupta, D. T. Lee and Y.-T. Leung \u201cEfficient algorithms for interval graphs and circular-arc graphs\u201d, Networks 12 (1982), pp. 459\u2013467.","journal-title":"Networks"},{"key":"47_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(91)90165-E","volume":"40","author":"W.-L. Hsu","year":"1991","unstructured":"W.-L. Hsu and K.-H. Tsai \u201cLinear time algorithms on circular-arc graphs\u201d, Information Processing Letters 40 (1991), pp. 123\u2013129.","journal-title":"Information Processing Letters"},{"issue":"6","key":"47_CR8","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1137\/0219071","volume":"19","author":"D. T. Lee","year":"1990","unstructured":"D. T. Lee, M. Sarrafzadeh and Y. F. Wu \u201cMinimum cuts for circular-arc graphs\u201d, SIAM J. Computing 19(6) (1990), pp. 1041\u20131050.","journal-title":"SIAM J. Computing"},{"issue":"1","key":"47_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/0217003","volume":"17","author":"S. Masuda","year":"1988","unstructured":"S. Masuda and K. Nakajima \u201cAn optimal algorithm for finding a maximum independent set of a circular-arc graph\u201d, SIAM J. Computing 17(1) (1988), pp. 41\u201352.","journal-title":"SIAM J. Computing"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"S. C. Nandy and K. Mukhopadhyaya and B. B. Bhattacharya \u201cShooter location problem\u201d, in Proc. 8th Canad. Conf. Comput. Geom., pp. 93\u201398, 1996.","DOI":"10.1515\/9780773591134-018"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"F. Nielsen \u201cFast stabbing of boxes in high dimensions\u201d, in Proc. 8th Canad. Conf. Comput. Geom., pp. 87\u201392, 1996. Theo. Comp. Sci., Elsevier Sci., Sept. 2000.","DOI":"10.1016\/S0304-3975(98)00336-3"},{"key":"47_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(89)90195-6","volume":"33","author":"A. S. Rao","year":"1989","unstructured":"A. S. Rao and C. P. Rangan \u201cOptimal parallel algorithms on circular-arc graphs\u201d, Information Processing Letters 33 (1989), pp. 147\u2013156.","journal-title":"Information Processing Letters"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan \u201cData Structures and Network Algorithms\u201d, Regional Conference Series in Applied Mathematics 44, SIAM, 1983.","DOI":"10.1137\/1.9781611970265"},{"issue":"2","key":"47_CR14","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BF02526033","volume":"18","author":"K. H. Tsai","year":"1997","unstructured":"K. H. Tsai and D. T. Lee \u201ck-best cuts for circular-arc graphs\u201d, Algorithmica 18(2) (1997), pp. 198\u2013216.","journal-title":"Algorithmica"},{"key":"47_CR15","unstructured":"C. A. Wang and B. Zhu \u201cShooter location problems revisited\u201d, in Proc. 9th Canad. Conf. Comput. Geom., pp. 223\u2013228, 1997."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40996-3_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T16:56:43Z","timestamp":1708189003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40996-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540412557","9783540409960"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-40996-3_47","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}