{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:35:56Z","timestamp":1725525356861},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_26","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"298-309","source":"Crossref","is-referenced-by-count":6,"title":["Parameterized Complexity of Stabbing Rectangles and Squares in the Plane"],"prefix":"10.1007","author":[{"given":"Michael","family":"Dom","sequence":"first","affiliation":[]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[]},{"given":"Frances A.","family":"Rosamond","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"26_CR1","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1142\/S0218195905001865","volume":"15","author":"G. C\u0103linescu","year":"2005","unstructured":"C\u0103linescu, G., Dumitrescu, A., Karloff, H.J., Wan, P.-J.: Separating points by axis-parallel lines. Internat. J. Comput. Geom. Appl.\u00a015(6), 575\u2013590 (2005)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-69311-6_30","volume-title":"Frontiers in Algorithmics","author":"M. Dom","year":"2008","unstructured":"Dom, M., Sikdar, S.: The parameterized complexity of the rectangle stabbing problem and its variants. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol.\u00a05059, pp. 288\u2013299. Springer, Heidelberg (2008)"},{"key":"26_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Even, G., Levi, R., Rawitz, D., Schieber, B., Shahar, S., Sviridenko, M.: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Trans. Algorithms\u00a04(3), Article\u00a034 (2008)","DOI":"10.1145\/1367064.1367074"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems (manuscript, 2008)","DOI":"10.1016\/j.tcs.2008.09.065"},{"key":"26_CR6","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"26_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jagm.2002.1221","volume":"43","author":"D.R. Gaur","year":"2002","unstructured":"Gaur, D.R., Ibaraki, T., Krishnamurti, R.: Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem. J.\u00a0Algorithms\u00a043(1), 138\u2013152 (2002)","journal-title":"J.\u00a0Algorithms"},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1093\/comjnl\/bxm053","volume":"51","author":"P. Giannopoulos","year":"2008","unstructured":"Giannopoulos, P., Knauer, C., Whitesides, S.: Parameterized complexity of geometric problems. The Computer Journal\u00a051(3), 372\u2013384 (2008)","journal-title":"The Computer Journal"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(91)90011-K","volume":"30","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discrete Appl. Math.\u00a030, 29\u201342 (1991)","journal-title":"Discrete Appl. Math."},{"key":"26_CR11","volume-title":"Proceedings of the IEEE CAS Workshop on Wireless Communications and Networking","author":"F. Koushanfar","year":"2002","unstructured":"Koushanfar, F., Slijepcevic, S., Potkonjak, M., Sangiovanni-Vincentelli, A.: Error-tolerant multimodal sensor fusion. In: Proceedings of the IEEE CAS Workshop on Wireless Communications and Networking. IEEE CAS, Los Alamitos (2002)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-45678-3_42","volume-title":"Algorithms and Computation","author":"S. Kovaleva","year":"2001","unstructured":"Kovaleva, S., Spieksma, F.C.R.: Approximation of a geometric set covering problem. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 493\u2013501. Springer, Heidelberg (2001)"},{"issue":"3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1137\/S089548010444273X","volume":"20","author":"S. Kovaleva","year":"2006","unstructured":"Kovaleva, S., Spieksma, F.C.R.: Approximation algorithms for rectangle stabbing and interval stabbing problems. SIAM J. Discrete Math.\u00a020(3), 748\u2013768 (2006)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"26_CR14","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s00454-004-1108-4","volume":"33","author":"S. Langerman","year":"2005","unstructured":"Langerman, S., Morin, P.: Covering things with things. Discrete Comput. Geom.\u00a033(4), 717\u2013729 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/11847250_14","volume-title":"Parameterized and Exact Computation","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Parameterized complexity of independence and domination on geometric graphs. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 154\u2013165. Springer, Heidelberg (2006)"},{"key":"26_CR16","unstructured":"Mecke, S., Sch\u00f6bel, A., Wagner, D.: Station location \u2013 complexity and approximation. In: Kroon, L.G., M\u00f6hring, R.H. (eds.) Proc. 5th ATMOS, IBFI Dagstuhl, Germany (2005)"},{"key":"26_CR17","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"2","key":"26_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00224-005-1273-8","volume":"40","author":"G. Xu","year":"2007","unstructured":"Xu, G., Xu, J.: Constant approximation algorithms for rectangle stabbing and related problems. Theory Comput. Syst.\u00a040(2), 187\u2013204 (2007)","journal-title":"Theory Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T23:07:33Z","timestamp":1558134453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}