{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:37:11Z","timestamp":1725514631479},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693109"},{"type":"electronic","value":"9783540693116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69311-6_30","type":"book-chapter","created":{"date-parts":[[2008,6,6]],"date-time":"2008-06-06T07:17:46Z","timestamp":1212736666000},"page":"288-299","source":"Crossref","is-referenced-by-count":3,"title":["The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants"],"prefix":"10.1007","author":[{"given":"Michael","family":"Dom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somnath","family":"Sikdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","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":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/11758471_5","volume-title":"Algorithms and Complexity","author":"G. Even","year":"2006","unstructured":"Even, G., Rawitz, D., Shahar, S.: Approximation algorithms for capacitated rectangle stabbing. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 18\u201329. Springer, Heidelberg (2006)"},{"key":"30_CR3","unstructured":"Fellows, M.R.: Personal communication (September 2007)"},{"key":"30_CR4","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems (manuscript, 2007)"},{"key":"30_CR5","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"1","key":"30_CR6","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"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Giannopoulos, P., Knauer, C., Whitesides, S.: Parameterized complexity of geometric problems. The Computer Journal (2007), doi:10.1093\/comjnl\/bxm053","DOI":"10.1093\/comjnl\/bxm053"},{"key":"30_CR8","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":"30_CR9","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":"30_CR10","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":"30_CR11","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":"30_CR12","unstructured":"Mecke, S., Sch\u00f6bel, A., Wagner, D.: Station location \u2013 complexity and approximation. In: Proc. 5th ATMOS, IBFI Dagstuhl, Germany (2005)"},{"key":"30_CR13","doi-asserted-by":"crossref","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)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69311-6_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:34:55Z","timestamp":1620002095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69311-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540693109","9783540693116"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69311-6_30","relation":{},"subject":[]}}