{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:32:54Z","timestamp":1760441574568,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_6","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"65-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dominating Set on Overlap Graphs of Rectangles Intersecting a Line"],"prefix":"10.1007","author":[{"given":"Dibyayan","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joydeep","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"key":"6_CR1","unstructured":"Bandyapadhyay, S., Maheshwari, A., Mehrabi, S., Suri, S.: Approximating dominating set on intersection graphs of rectangles and L-frames. In: MFCS, pp. 37:1\u201337:15 (2018)"},{"key":"6_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00224-013-9478-8","volume":"54","author":"N Bousquet","year":"2014","unstructured":"Bousquet, N., Gon\u00e7alves, D., Mertzios, G.B., Paul, C., Sau, I., Thomass\u00e9, S.: Parameterized domination in circle graphs. Theory Comput. Syst. 54(1), 45\u201372 (2014)","journal-title":"Theory Comput. Syst."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.dam.2015.08.019","volume":"216","author":"D Catanzaro","year":"2017","unstructured":"Catanzaro, D., et al.: Max point-tolerance graphs. Discret. Appl. Math. 216, 84\u201397 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"9","key":"6_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. Comput. Geom. 46(9), 1036\u20131041 (2013)","journal-title":"Comput. Geom."},{"issue":"11","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","volume":"206","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput. 206(11), 1264\u20131275 (2008)","journal-title":"Inf. Comput."},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/s00454-014-9661-y","volume":"53","author":"J Correa","year":"2015","unstructured":"Correa, J., Feuilloley, L., P\u00e9rez-Lantero, P., Soto, J.A.: Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity. Discrete Comput. Geom. 53(2), 344\u2013365 (2015)","journal-title":"Discrete Comput. Geom."},{"issue":"6","key":"6_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ipl.2005.11.007","volume":"97","author":"M Damian","year":"2006","unstructured":"Damian, M., Pemmaraju, S.V.: APX-hardness of domination problems in circle graphs. Inf. Process. Lett. 97(6), 231\u2013237 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/jagm.2001.1206","volume":"42","author":"M Damian-Iordache","year":"2002","unstructured":"Damian-Iordache, M., Pemmaraju, S.V.: A (2+ $$\\varepsilon $$)-approximation scheme for minimum domination on circle graphs. J. Algorithms 42(2), 255\u2013276 (2002)","journal-title":"J. Algorithms"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/978-3-540-78773-0_64","volume-title":"LATIN 2008: Theoretical Informatics","author":"T Erlebach","year":"2008","unstructured":"Erlebach, T., van Leeuwen, E.J.: Domination in geometric intersection graphs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 747\u2013758. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_64"},{"key":"6_CR11","unstructured":"Govindarajan, S., Raman, R., Ray, S., Basu Roy, A.: Packing and covering with non-piercing regions, In: ESA (2016)"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.comgeo.2004.07.002","volume":"30","author":"MJ Katz","year":"2005","unstructured":"Katz, M.J., Mitchell, J.S.B., Nir, Y.: Orthogonal segment stabbing. Comput. Geom.: Theory Appl. 30(2), 197\u2013205 (2005)","journal-title":"Comput. Geom.: Theory Appl."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.comgeo.2016.05.001","volume":"60","author":"JM Keil","year":"2017","unstructured":"Keil, J.M., Mitchell, J.S.B., Pradhan, D., Vatshelle, M.: An algorithm for the maximum weight independent set problem on outerstring graphs. Comput. Geom. 60, 19\u201325 (2017)","journal-title":"Comput. Geom."},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-$$\\varepsilon $$. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-26626-8_10","volume-title":"Combinatorial Optimization and Applications","author":"A Mudgal","year":"2015","unstructured":"Mudgal, A., Pandit, S.: Covering, hitting, piercing and packing rectangles intersecting an inclined line. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 126\u2013137. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_10"},{"key":"6_CR16","unstructured":"Pandit, S.: Dominating set of rectangles intersecting a straight line. In: CCCG, pp. 144\u2013149 (2017)"},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E Tardos","year":"1986","unstructured":"Tardos, E.: A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34(2), 250\u2013256 (1986)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26176-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:04:49Z","timestamp":1709820289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}