{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T14:42:44Z","timestamp":1764859364765,"version":"3.41.2"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:p> In this paper, we present an approximation algorithm for the maximum independent set (MIS) problem over the class of [Formula: see text]-VPG graphs when the input is specified by a [Formula: see text]-VPG representation. We obtain a [Formula: see text]-approximation algorithm running in [Formula: see text] time. This is an improvement over the previously best [Formula: see text]-approximation algorithm [J. Fox and J. Pach, Computing the independence number of intersection graphs, in Proc. Twenty-Second Annual ACM-SIAM Symp. Discrete Algorithms (SODA 2011), 2011, pp. 1161\u20131165, doi:10.1137\/1.9781611973082.87] (for some fixed [Formula: see text]) designed for some subclasses of string graphs, on [Formula: see text]-VPG graphs. <\/jats:p>","DOI":"10.1142\/s1793830922500355","type":"journal-article","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:29:23Z","timestamp":1633930163000},"source":"Crossref","is-referenced-by-count":1,"title":["On approximating MIS over B1-VPG graphs*"],"prefix":"10.1142","volume":"14","author":[{"given":"Abhiruk","family":"Lahiri","sequence":"first","affiliation":[{"name":"CSA Department, Indian Institute of Science, Bengaluru, India"}]},{"given":"Joydeep","family":"Mukherjee","sequence":"additional","affiliation":[{"name":"Ramakrishna Mission Vivekananda University, Howrah 711202, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8100-1133","authenticated-orcid":false,"given":"C. R.","family":"Subramanian","sequence":"additional","affiliation":[{"name":"The Institute of Mathematical Scienes, HBNI, Chennai 600113, India"}]}],"member":"219","published-online":{"date-parts":[[2021,11,11]]},"reference":[{"key":"S1793830922500355BIB001","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00253"},{"key":"S1793830922500355BIB002","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"S1793830922500355BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40104-6_29"},{"key":"S1793830922500355BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.01.028"},{"key":"S1793830922500355BIB005","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.87"},{"key":"S1793830922500355BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2011.09.021"},{"key":"S1793830922500355BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"S1793830922500355BIB008","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214106"},{"key":"S1793830922500355BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2016.05.001"},{"key":"S1793830922500355BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90180-6"},{"key":"S1793830922500355BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26626-8_46"},{"key":"S1793830922500355BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00319-7"},{"key":"S1793830922500355BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90688-C"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922500355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T03:48:54Z","timestamp":1665805734000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922500355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,11]]},"references-count":13,"journal-issue":{"issue":"07","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["10.1142\/S1793830922500355"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922500355","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,11,11]]},"article-number":"2250035"}}