{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T22:34:52Z","timestamp":1701124492514},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,11,9]],"date-time":"2010-11-09T00:00:00Z","timestamp":1289260800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00453-010-9471-4","type":"journal-article","created":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T12:45:14Z","timestamp":1289220314000},"page":"564-594","source":"Crossref","is-referenced-by-count":3,"title":["The Parameterized Complexity of Stabbing Rectangles"],"prefix":"10.1007","volume":"62","author":[{"given":"Michael","family":"Dom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frances A.","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somnath","family":"Sikdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,9]]},"reference":[{"issue":"3","key":"9471_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","volume":"73","author":"K.R. Abrahamson","year":"1995","unstructured":"Abrahamson, K.R., Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogues. Ann. Pure Appl. Logic 73(3), 235\u2013276 (1995)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"4","key":"9471_CR2","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Comput. Surv. 30(4), 412\u2013458 (1998)","journal-title":"ACM Comput. Surv."},{"issue":"1\u20133","key":"9471_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0166-218X(96)00055-8","volume":"71","author":"J.E. Atkins","year":"1996","unstructured":"Atkins, J.E., Middendorf, M.: On physical mapping and the consecutive ones property for sparse matrices. Discrete Appl. Math. 71(1\u20133), 23\u201340 (1996)","journal-title":"Discrete Appl. Math."},{"key":"9471_CR4","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/978-3-540-27821-4_5","volume-title":"Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX\u201904)","author":"V. Bil\u00f2","year":"2004","unstructured":"Bil\u00f2, V., Goyal, V., Ravi, R., Singh, M.: On the crossing spanning tree problem. In: Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX\u201904). LNCS, vol. 3122, pp. 51\u201360. Springer, Berlin (2004)"},{"issue":"6","key":"9471_CR5","doi-asserted-by":"crossref","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. Int. J. Comput. Geom. Appl. 15(6), 575\u2013590 (2005)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"9471_CR6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.ic.2005.05.001","volume":"201","author":"J. Chen","year":"2005","unstructured":"Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D., Kanj, I.A., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201(2), 216\u2013231 (2005)","journal-title":"Inf. Comput."},{"issue":"1","key":"9471_CR7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"K.L. Clarkson","year":"2007","unstructured":"Clarkson, K.L., Varadarajan, K.R.: Improved approximation algorithms for geometric set cover. Discrete Comput. Geom. 37(1), 43\u201358 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"9471_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S1571-0661(04)81014-4","volume":"78","author":"R.G. Downey","year":"2003","unstructured":"Downey, R.G., Estivill-Castro, V., Fellows, M., Prieto, E., Rosamond, F.A.: Cutting up is hard to do: the parameterised complexity of k-Cut and related problems. Electron. Notes Theor. Comput. Sci. 78, 209\u2013222 (2003)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"9471_CR9","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, Berlin (1999)"},{"issue":"3","key":"9471_CR10","doi-asserted-by":"crossref","DOI":"10.1145\/1367064.1367074","volume":"4","author":"G. Even","year":"2008","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 4(3), Article\u00a034 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"9471_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9471_CR12","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/BF01944351","volume":"16","author":"M. Flammini","year":"1996","unstructured":"Flammini, M., Gambosi, G., Salomone, S.: Interval routing schemes. Algorithmica 16(6), 549\u2013568 (1996)","journal-title":"Algorithmica"},{"key":"9471_CR13","first-page":"71","volume":"84","author":"J. Flum","year":"2004","unstructured":"Flum, J., Grohe, M.: Parametrized complexity and subexponential time. Bull. EATCS 84, 71\u2013100 (2004)","journal-title":"Bull. EATCS"},{"key":"9471_CR14","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"key":"9471_CR15","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":"9471_CR16","doi-asserted-by":"crossref","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. Algorithms 43(1), 138\u2013152 (2002)","journal-title":"J. Algorithms"},{"key":"9471_CR17","first-page":"281","volume-title":"Proceedings of the 25th European Workshop on Computational Geometry (EuroCG\u201909)","author":"P. Giannopoulos","year":"2009","unstructured":"Giannopoulos, P., Knauer, C., Rote, G., Werner, D.: Fixed-parameter tractability and lower bounds for stabbing problems. In: Proceedings of the 25th European Workshop on Computational Geometry (EuroCG\u201909), pp. 281\u2013284 (2009)"},{"issue":"3","key":"9471_CR18","doi-asserted-by":"crossref","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. Comput. J. 51(3), 372\u2013384 (2008)","journal-title":"Comput. J."},{"issue":"1","key":"9471_CR19","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"P.W. Goldberg","year":"1995","unstructured":"Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. J. Comput. Biol. 2(1), 139\u2013152 (1995)","journal-title":"J. Comput. Biol."},{"key":"9471_CR20","doi-asserted-by":"crossref","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. 30, 29\u201342 (1991)","journal-title":"Discrete Appl. Math."},{"key":"9471_CR21","doi-asserted-by":"crossref","unstructured":"Heggernes, P., Kratsch, D., Lokshtanov, D., Raman, V., Saurabh, S.: Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing. Manuscript (2009)","DOI":"10.1007\/978-3-642-13731-0_32"},{"issue":"4","key":"9471_CR22","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9471_CR23","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.comgeo.2004.07.002","volume":"30","author":"M.J. Katz","year":"2005","unstructured":"Katz, M.J., Mitchell, J.S.B., Nir, Y.: Orthogonal segment stabbing. Comput. Geom. 30(2), 197\u2013205 (2005)","journal-title":"Comput. Geom."},{"key":"9471_CR24","first-page":"113","volume-title":"Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (SOCG\u201996)","author":"M.J. Katz","year":"1996","unstructured":"Katz, M.J., Nielsen, F.: On piercing sets of objects. In: Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (SOCG\u201996), pp. 113\u2013121. ACM, New York (1996)"},{"key":"9471_CR25","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, Piscataway (2002)"},{"key":"9471_CR26","series-title":"LNCS","first-page":"493","volume-title":"Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC\u201901)","author":"S. Kovaleva","year":"2001","unstructured":"Kovaleva, S., Spieksma, F.C.R.: Approximation of a geometric set covering problem. In: Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC\u201901). LNCS, vol. 2223, pp. 493\u2013501. Springer, Berlin (2001)"},{"issue":"3","key":"9471_CR27","doi-asserted-by":"crossref","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. 20(3), 748\u2013768 (2006)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"9471_CR28","doi-asserted-by":"crossref","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. 33(4), 717\u2013729 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"9471_CR29","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/11847250_14","volume-title":"Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC\u201906)","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Parameterized complexity of independence and domination on geometric graphs. In: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC\u201906). LNCS, vol. 4169, pp. 154\u2013165. Springer, Berlin (2006)"},{"key":"9471_CR30","volume-title":"Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS\u201905)","author":"S. Mecke","year":"2005","unstructured":"Mecke, S., Sch\u00f6bel, A., Wagner, D.: Station location\u2014complexity and approximation. In: Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS\u201905). IBFI Dagstuhl, Germany (2005)"},{"key":"9471_CR31","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0167-6377(82)90039-6","volume":"1","author":"N. Megiddo","year":"1982","unstructured":"Megiddo, N., Tamir, A.: On the complexity of locating linear facilities in the plane. Oper. Res. Lett. 1, 194\u2013197 (1982)","journal-title":"Oper. Res. Lett."},{"key":"9471_CR32","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, London (2006)"},{"key":"9471_CR33","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1145\/258726.258828","volume-title":"Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC\u201997)","author":"D. Nussbaum","year":"1997","unstructured":"Nussbaum, D.: Rectilinear p-piercing problems. In: Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC\u201997), pp. 316\u2013323. ACM Press, New York (1997)"},{"issue":"4","key":"9471_CR34","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"67","author":"K. Pietrzak","year":"2003","unstructured":"Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. Syst. Sci. 67(4), 757\u2013771 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9471_CR35","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1142\/S0218195999000157","volume":"9","author":"M. Segal","year":"1999","unstructured":"Segal, M.: On piercing sets of axis-parallel rectangles and rings. Int. J. Comput. Geom. Appl. 9(3), 219\u2013233 (1999)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9471_CR36","first-page":"122","volume-title":"Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (SOCG\u201996)","author":"M. Sharir","year":"1996","unstructured":"Sharir, M., Welzl, E.: Rectilinear and polygonal p-piercing and p-center problems. In: Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (SOCG\u201996), pp. 122\u2013132. ACM, New York (1996)"},{"issue":"17","key":"9471_CR37","doi-asserted-by":"crossref","first-page":"2312","DOI":"10.1016\/j.dam.2007.06.009","volume":"155","author":"R. Wang","year":"2007","unstructured":"Wang, R., Lau, F.C.M., Zhao, Y.: Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices. Discrete Appl. Math. 155(17), 2312\u20132320 (2007)","journal-title":"Discrete Appl. Math."},{"key":"9471_CR38","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/3-540-44968-X_38","volume-title":"Proceedings of the 6th Annual International Computing and Combinatorics Conference (COCOON\u201900)","author":"S. Weis","year":"2000","unstructured":"Weis, S., Reischuk, R.: The complexity of physical mapping with strict chimerism. In: Proceedings of the 6th Annual International Computing and Combinatorics Conference (COCOON\u201900). LNCS, vol. 1858, pp. 383\u2013395. Springer, Berlin (2000)"},{"issue":"2","key":"9471_CR39","doi-asserted-by":"crossref","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. 40(2), 187\u2013204 (2007)","journal-title":"Theory Comput. Syst."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9471-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9471-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9471-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T00:13:09Z","timestamp":1559779989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9471-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,9]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9471"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9471-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,9]]}}}