{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:22:16Z","timestamp":1725790936146},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_4","type":"book-chapter","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T23:02:27Z","timestamp":1395702147000},"page":"35-46","source":"Crossref","is-referenced-by-count":2,"title":["Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 R.","family":"Correa","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Feuilloley","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 A.","family":"Soto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Wiese, A.: Approximation Schemes for Maximum Weight Independent Set of Rectangles. In: FOCS 2013 (2013)","DOI":"10.1109\/FOCS.2013.50"},{"key":"4_CR2","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 \u03b5-nets for axis-parallel rectangles and boxes. SIAM J. Comp.\u00a039, 3248\u20133282 (2010)","journal-title":"SIAM J. Comp."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Chuzhoy, J.: Maximum independent set of rectangles. In: SODA 2009 (2009)","DOI":"10.1137\/1.9781611973068.97"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. In: SoCG 2009 (2009)","DOI":"10.1145\/1542362.1542420"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1016\/j.comgeo.2013.05.008","volume":"46","author":"V. Chepoi","year":"2013","unstructured":"Chepoi, V., Felsner, S.: Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve. Computational Geometry\u00a046, 1036\u20131041 (2013)","journal-title":"Computational Geometry"},{"key":"4_CR6","unstructured":"Cibulka, J., Hladk\u00fd, J., Kazda, A., Lidick\u00fd, B., Ondr\u00e1\u010dkov\u00e1, E., Tancer, M., Jel\u00ednek, V.: Personal Communication (2011)"},{"key":"4_CR7","unstructured":"Correa, J.R., Feuilloley, L., P\u00e9rez-Lantero, P., Soto, J.A.: Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity. arXiv:1309.6659"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0012-365X(93)90587-J","volume":"120","author":"D.G. Fon-Der-Flaass","year":"1993","unstructured":"Fon-Der-Flaass, D.G., Kostochka, A.V.: Covering boxes by points. Disc. Math.\u00a0120, 269\u2013275 (1993)","journal-title":"Disc. Math."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0012-365X(85)90045-7","volume":"55","author":"A. Gy\u00e1rf\u00e1s","year":"1985","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: Covering and coloring problems for relatives of intervals. Disc. Math.\u00a055, 167\u2013180 (1985)","journal-title":"Disc. Math."},{"key":"4_CR10","unstructured":"Hixon, T.S.: Hook graphs and more: Some contributions to geometric graph theory. Master\u2019s thesis, Technische Universitat Berlin (2013)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett.\u00a012, 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(92)90216-I","volume":"43","author":"J.Y. Hsiao","year":"1992","unstructured":"Hsiao, J.Y., Tang, C.Y., Chang, R.S.: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs. Inf. Process. Lett.\u00a043, 229\u2013235 (1992)","journal-title":"Inf. Process. Lett."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0196-6774(83)90012-3","volume":"4","author":"H. Imai","year":"1983","unstructured":"Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. of Algorithms\u00a04, 310\u2013323 (1983)","journal-title":"J. of Algorithms"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01844847","volume":"16","author":"G. K\u00e1rolyi","year":"1996","unstructured":"K\u00e1rolyi, G., Tardos, G.: On point covers of multiple intervals and axis-parallel rectangles. Combinatorica\u00a016, 213\u2013222 (1996)","journal-title":"Combinatorica"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0095-8956(91)90073-S","volume":"53","author":"A. Lubiw","year":"1991","unstructured":"Lubiw, A.: A weighted min-max relation for intervals. J. Comb. Theory, Ser. B\u00a053, 151\u2013172 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s00454-010-9285-9","volume":"44","author":"N.H. Mustafa","year":"2010","unstructured":"Mustafa, N.H., Ray, S.: Improved results on geometric hitting set problems. Discrete Comput. Geom.\u00a044, 883\u2013895 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-20807-2_31","volume-title":"Integer Programming and Combinatoral Optimization","author":"J.A. Soto","year":"2011","unstructured":"Soto, J.A., Telha, C.: Jump Number of Two-Directional Orthogonal Ray Graphs. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol.\u00a06655, pp. 389\u2013403. Springer, Heidelberg (2011)"},{"key":"4_CR18","unstructured":"Soto, M., Thraves, C.: (c-)And graphs - more than intersection, more than geometric. arXiv:1306.1957 (2013) (submitted)"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF03008396","volume":"3","author":"G. Wegner","year":"1965","unstructured":"Wegner, G.: \u00dcber eine kombinatorisch-geometrische frage von hadwiger und debrunner. Israel J. of Mathematics\u00a03, 187\u2013198 (1965)","journal-title":"Israel J. of Mathematics"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M. Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Alg. Discr. Meth.\u00a03, 351\u2013358 (1982)","journal-title":"SIAM J. Alg. Discr. Meth."}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T08:48:21Z","timestamp":1558860501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}