{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:33:02Z","timestamp":1760441582095,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"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-24766-9_16","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"211-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Maximum Independent Set on Outerstring Graphs and Their Relatives"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[]},{"given":"Mark J.","family":"Keil","sequence":"additional","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Saeed","family":"Mehrabi","sequence":"additional","affiliation":[]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.comgeo.2005.12.001","volume":"34","author":"PK Agarwal","year":"2006","unstructured":"Agarwal, P.K., Mustafa, N.H.: Independent set of intersection graphs of convex objects in 2D. Comput. Geom. 34(2), 83\u201395 (2006)","journal-title":"Comput. Geom."},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(92)90200-T","volume":"36","author":"A Apostolico","year":"1992","unstructured":"Apostolico, A., Atallah, M.J., Hambrusch, S.E.: New clique and independent set algorithms for circle graphs. Discrete Appl. Math. 36(1), 1\u201324 (1992)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"16_CR3","first-page":"681","volume":"E74","author":"T Asano","year":"1991","unstructured":"Asano, T., Imai, H., Mukaiyama, A.: Finding a maximum weight independent set of a circle graph. IEICE Trans. E74(4), 681\u2013683 (1991)","journal-title":"IEICE Trans."},{"issue":"2","key":"16_CR4","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."},{"unstructured":"Bandyapadhyay, S., Maheshwari, A., Mehrabi, S., Suri, S.: Approximating dominating set on intersection graphs of rectangles and L-frames. In: Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Liverpool, UK, pp. 37:1\u201337:15 (2018)","key":"16_CR5"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-62127-2_14","volume-title":"Algorithms and Data Structures","author":"T Biedl","year":"2017","unstructured":"Biedl, T., Derka, M.: Splitting $$B_2$$-VPG graphs into outer-string and co-comparability graphs. Algorithms and Data Structures. LNCS, vol. 10389, pp. 157\u2013168. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_14"},{"unstructured":"Bose, P., et al.: Computing maximum independent set on outerstring graphs and their relatives. CoRR abs\/1903.07024 (2019). http:\/\/arxiv.org\/abs\/1903.07024","key":"16_CR7"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.7155\/jgaa.00470","volume":"22","author":"J Cardinal","year":"2018","unstructured":"Cardinal, J., Felsner, S., Miltzow, T., Tompkins, C., Vogtenhuber, B.: Intersection graphs of rays and grounded segments. J. Graph Algorithms Appl. 22(2), 273\u2013295 (2018)","journal-title":"J. Graph Algorithms Appl."},{"doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Chuzhoy, J.: Maximum independent set of rectangles. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA. pp. 892\u2013901 (2009)","key":"16_CR9","DOI":"10.1137\/1.9781611973068.97"},{"doi-asserted-by":"crossref","unstructured":"Chalopin, J., Gon\u00e7alves, D.: Every planar graph is the intersection graph of segments in the plane: extended abstract. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC 2009), Bethesda, MD, USA. pp. 631\u2013638 (2009)","key":"16_CR10","DOI":"10.1145\/1536414.1536500"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00454-012-9417-5","volume":"48","author":"TM Chan","year":"2012","unstructured":"Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. Discrete Comput. Geom. 48(2), 373\u2013392 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-34611-8_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Chaplick","year":"2012","unstructured":"Chaplick, S., Jel\u00ednek, V., Kratochv\u00edl, J., Vysko\u010dil, T.: Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 274\u2013285. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34611-8_28"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(76)90022-8","volume":"21","author":"G Ehrlich","year":"1976","unstructured":"Ehrlich, G., Even, S., Tarjan, R.E.: Intersection graphs of curves in the plane. J. Comb. Theory, Ser. B 21(1), 8\u201320 (1976)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"6","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM J. Comput. 34(6), 1302\u20131323 (2005)","journal-title":"SIAM J. Comput."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.dam.2016.01.028","volume":"206","author":"S Felsner","year":"2016","unstructured":"Felsner, S., Knauer, K.B., Mertzios, G.B., Ueckerdt, T.: Intersection graphs of L-shapes and segments in the plane. Discrete Appl. Math. 206, 48\u201355 (2016)","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Computing the independence number of intersection graphs. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, USA, pp. 1161\u20131165 (2011)","key":"16_CR16","DOI":"10.1137\/1.9781611973082.87"},{"unstructured":"Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Proceedings of the 5th British Combinatorial Conference (1975)","key":"16_CR17"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F Gavril","year":"1973","unstructured":"Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3, 261\u2013273 (1973)","journal-title":"Networks"},{"doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, D., Isenmann, L., Pennarun, C.: Planar graphs as L-intersection or L-contact graphs. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), New Orleans, LA, USA, pp. 172\u2013184 (2018)","key":"16_CR19","DOI":"10.1137\/1.9781611975031.12"},{"unstructured":"H\u00e5stad, J.: Clique is hard to approximate within $$n^{1-\\epsilon }$$. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS 1996), Burlington, Vermont, USA, pp. 627\u2013636 (1996)","key":"16_CR20"},{"issue":"4","key":"16_CR21","doi-asserted-by":"publisher","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."},{"unstructured":"Jel\u00ednek, V., T\u00f6pfer, M.: On grounded L-graphs and their relatives. CoRR abs\/1808.04148 (2018)","key":"16_CR22"},{"key":"16_CR23","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":"1","key":"16_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0095-8956(91)90090-7","volume":"52","author":"Jan Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. I. the number of critical nonstring graphs is infinite. J. Comb. Theory, Ser. B 52(1), 53\u201366 (1991)","journal-title":"Journal of Combinatorial Theory, Series B"},{"doi-asserted-by":"crossref","unstructured":"Lahiri, A., Mukherjee, J., Subramanian, C.R.: Maximum independent set on B$$_1$$-VPG graphs. In: Proceedings of the 9th International Conference Combinatorial Optimization and Applications (COCOA 2015), Houston, TX, USA, pp. 633\u2013646 (2015)","key":"16_CR25","DOI":"10.1007\/978-3-319-26626-8_46"},{"key":"16_CR26","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). https:\/\/doi.org\/10.1007\/978-3-319-89441-6_7"},{"unstructured":"Mehrabi, S.: Approximation algorithms for independence and domination on B$${}_{\\text{1}}$$-VPG and B$${}_{\\text{1 }}$$-EPG graphs. CoRR abs\/1702.05633 (2017)","key":"16_CR27"},{"issue":"1\u20133","key":"16_CR28","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0012-365X(93)90176-T","volume":"111","author":"M Middendorf","year":"1993","unstructured":"Middendorf, M., Pfeiffer, F.: Weakly transitive orientations, Hasse diagrams and string graphs. Discrete Math. 111(1\u20133), 393\u2013400 (1993)","journal-title":"Discrete Math."},{"issue":"16","key":"16_CR29","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.ipl.2010.05.016","volume":"110","author":"N Nash","year":"2010","unstructured":"Nash, N., Gregg, D.: An output sensitive algorithm for computing a maximum independent set of a circle graph. Inf. Process. Lett. 110(16), 630\u2013634 (2010)","journal-title":"Inf. Process. Lett."},{"unstructured":"Scheinerman, E.R.: Intersection Classes and Multiple Intersection Parameters of Graphs. Ph.D. thesis, Princeton University (1984)","key":"16_CR30"},{"issue":"1","key":"16_CR31","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1109\/TCAD.1987.1270250","volume":"6","author":"KJ Supowit","year":"1987","unstructured":"Supowit, K.J.: Finding a maximum planar subset of a set of nets in a channel. IEEE Trans. CAD Integr. Circ. Syst. 6(1), 93\u201394 (1987)","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-24587-2_15","volume-title":"Algorithms and Computation","author":"G Valiente","year":"2003","unstructured":"Valiente, G.: A new simple algorithm for the maximum-weight independent set problem on circle graphs. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 129\u2013137. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24587-2_15"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:53:42Z","timestamp":1710266022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_16","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 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}