{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:23:50Z","timestamp":1760441030864,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"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-23719-5_6","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"61-69","source":"Crossref","is-referenced-by-count":3,"title":["On Isolating Points Using Disks"],"prefix":"10.1007","author":[{"given":"Matt","family":"Gibson","sequence":"first","affiliation":[]},{"given":"Gaurav","family":"Kanade","sequence":"additional","affiliation":[]},{"given":"Kasturi","family":"Varadarajan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","year":"1998","key":"6_CR1","unstructured":"Agarwal, P.K., Sharir, M.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1998)"},{"key":"6_CR2","unstructured":"Alt, H., Cabello, S., Giannopoulos, P., Knauer, C.: Minimum cell connection and separation in line segment arrangements (2011)(manuscript), http:\/\/arxiv.org\/abs\/1104.4618"},{"issue":"7","key":"6_CR3","doi-asserted-by":"publisher","first-page":"3248","DOI":"10.1137\/090762968","volume":"39","author":"B. Aronov","year":"2010","unstructured":"Aronov, B., Ezra, E., Sharir, M.: Small-size epsilon-nets for axis-parallel rectangles and boxes. SIAM J. Comput.\u00a039(7), 3248\u20133282 (2010)","journal-title":"SIAM J. Comput."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Balister, P., Zheng, Z., Kumar, S., Sinha, P.: Trap coverage: Allowing coverage holes of bounded diameter in wireless sensor networks. In: Proc. of IEEE INFOCOM, Rio de Janeiro (2009)","DOI":"10.1109\/INFCOM.2009.5061915"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-05434-1_5","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"S. Bereg","year":"2009","unstructured":"Bereg, S., Kirkpatrick, D.: Approximating Barrier Resilience in Wireless Sensor Networks. In: Dolev, S. (ed.) ALGOSENSORS 2009. LNCS, vol.\u00a05804, pp. 29\u201340. Springer, Heidelberg (2009)"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H. Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete & Computational Geometry\u00a014(4), 463\u2013479 (1995)","journal-title":"Discrete & Computational Geometry"},{"key":"6_CR7","unstructured":"Cabello, S.: Personal Communication (May 2011)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Chuzhoy, J.: Maximum independent set of rectangles. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, pp. 892\u2013901. Society for Industrial and Applied Mathematics, Philadelphia (2009)","DOI":"10.1137\/1.9781611973068.97"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Har- Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. In: Proc. Symposium on Computational Geometry, SCG 2009, pp. 333\u2013340 (2009)","DOI":"10.1145\/1542362.1542420"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. In: Proc. Symposium on Computational Geometry, SCG 2005, pp. 135\u2013141 (2005)","DOI":"10.1145\/1064092.1064115"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00454-003-2948-z","volume":"31","author":"J. Erickson","year":"2004","unstructured":"Erickson, J., Har- Peled, S.: Optimally cutting a surface into a disk. Discrete & Computational Geometry\u00a031(1), 37\u201359 (2004)","journal-title":"Discrete & Computational Geometry"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Computing the independence number of intersection graphs. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SODA 2011 (2011)","DOI":"10.1137\/1.9781611973082.87"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0196-6774(03)00111-1","volume":"50","author":"N. Garg","year":"2004","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in node weighted graphs. Journal of Algorithms\u00a050(1), 49\u201361 (2004)","journal-title":"Journal of Algorithms"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Gibson, M., Kanade, G., Varadarajan, K.: On isolating points using disks (2011) (manuscript), http:\/\/arxiv.org\/abs\/1104.5043v1","DOI":"10.1007\/978-3-642-23719-5_6"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K. Kedem","year":"1986","unstructured":"Kedem, K., Livne, R., Pach, J., Sharir, M.: On the union of Jordan regions and collision free translational motion amidst polygonal obstacles. Discrete Comput. Geom.\u00a01, 59\u201371 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"6_CR16","first-page":"284","volume-title":"MobiCom 2005: Proceedings of the 11th Annual International Conference on Mobile Computing and Networking","author":"S. Kumar","year":"2005","unstructured":"Kumar, S., Lai, T. H., Arora, A.: Barrier coverage with wireless sensors. In: MobiCom 2005: Proceedings of the 11th Annual International Conference on Mobile Computing and Networking, pp. 284\u2013298. ACM, New York (2005)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Mustafa, N.H., Ray, S.: PTAS for geometric hitting set problems via local search. In: Proc. Symposium on Computational Geometry, SCG 2009, pp. 17\u201322 (2009)","DOI":"10.1145\/1542362.1542367"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1137\/0212005","volume":"12","author":"J. Reif","year":"1983","unstructured":"Reif, J.: Minimum s-t cut of a planar undirected network in o(n log2 n) time. SIAM Journal on Computing\u00a012, 71\u201381 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR19","unstructured":"Sankararaman, S., Efrat, A., Ramasubramanian, S., Taheri, J.: Scheduling sensors for guaranteed sparse coverage (2009) (manuscript), http:\/\/arxiv.org\/abs\/0911.4332"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T12:10:38Z","timestamp":1741522238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}