{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:37:33Z","timestamp":1760441853207},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030307851"},{"type":"electronic","value":"9783030307868"}],"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-30786-8_18","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T21:22:57Z","timestamp":1568236977000},"page":"232-243","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Minimum Dominating Set on String Graphs"],"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,9,12]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.7155\/jgaa.00253","volume":"16","author":"A Asinowski","year":"2012","unstructured":"Asinowski, A., Cohen, E., Golumbic, M.C., Limouzy, V., Lipshteyn, M., Stern, M.: Vertex intersection graphs of paths on a grid. J. Graph Algorithms Appl. 16(2), 129\u2013150 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"18_CR2","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":"18_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-77974-2"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-34611-8_31","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"N Bousquet","year":"2012","unstructured":"Bousquet, N., Gon\u00e7alves, D., Mertzios, G.B., Paul, C., Sau, I., Thomass\u00e9, S.: Parameterized domination in circle graphs. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 308\u2013319. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-34611-8_31"},{"issue":"11","key":"18_CR5","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":"1\u20133","key":"18_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discret. Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discret. Math."},{"issue":"1\u20133","key":"18_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(90)90359-P","volume":"86","author":"CJ Colbourn","year":"1990","unstructured":"Colbourn, C.J., Stewart, L.K.: Permutation graphs: connected domination and steiner trees. Discret. Math. 86(1\u20133), 179\u2013189 (1990)","journal-title":"Discret. Math."},{"issue":"6","key":"18_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":"18_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+ \n                    \n                      \n                    \n                    $$\\varepsilon $$\n                  )-approximation scheme for minimum domination on circle graphs. J. Algorithms 42(2), 255\u2013276 (2002)","journal-title":"J. Algorithms"},{"key":"18_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). \n                    https:\/\/doi.org\/10.1007\/978-3-540-78773-0_64"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","volume":"6","author":"M Farber","year":"1985","unstructured":"Farber, M., Keil, J.M.: Domination in permutation graphs. J. Algorithms 6(3), 309\u2013321 (1985)","journal-title":"J. Algorithms"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-15775-2_21","volume-title":"Algorithms \u2013 ESA 2010","author":"M Gibson","year":"2010","unstructured":"Gibson, M., Pirwani, I.A.: Algorithms for dominating set in disk graphs: breaking the logn barrier. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 243\u2013254. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-15775-2_21"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(83)90019-5","volume":"43","author":"MC Golumbic","year":"1983","unstructured":"Golumbic, M.C., Rotem, D., Urrutia, J.: Comparability graphs and intersection graphs. Discrete Math. 43(1), 37\u201346 (1983)","journal-title":"Discrete Math."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, D., Isenmann, L., Pennarun, C.: Planar graphs as L-intersection or L-contact graphs. In: SODA, pp. 172\u2013184 (2018)","DOI":"10.1137\/1.9781611975031.12"},{"issue":"2","key":"18_CR15","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":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/978-3-319-26626-8_46","volume-title":"Combinatorial Optimization and Applications","author":"A Lahiri","year":"2015","unstructured":"Lahiri, A., Mukherjee, J., Subramanian, C.R.: Maximum independent set on \n                    \n                      \n                    \n                    $$B_1$$\n                  -VPG graphs. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 633\u2013646. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-26626-8_46"},{"issue":"1\u20133","key":"18_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(95)00316-O","volume":"154","author":"S McGuinness","year":"1996","unstructured":"McGuinness, S.: On bounding the chromatic number of L-graphs. Discrete Math. 154(1\u20133), 179\u2013187 (1996)","journal-title":"Discrete Math."},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-319-89441-6_7","volume-title":"Approximation and Online Algorithms","author":"S Mehrabi","year":"2018","unstructured":"Mehrabi, S.: Approximating domination on intersection graphs of paths on a grid. In: Solis-Oba, R., Fleischer, R. (eds.) WAOA 2017. LNCS, vol. 10787, pp. 76\u201389. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-89441-6_7"},{"issue":"2","key":"18_CR19","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","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30786-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T21:25:04Z","timestamp":1568237104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30786-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030307851","9783030307868"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30786-8_18","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":"12 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vall de N\u00faria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wg2019.sau.thilikos.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"87","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1-2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}