{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:59:36Z","timestamp":1792072776839,"version":"4.4.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319266251","type":"print"},{"value":"9783319266268","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26626-8_46","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T04:08:43Z","timestamp":1449634123000},"page":"633-646","source":"Crossref","is-referenced-by-count":10,"title":["Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs"],"prefix":"10.1007","author":[{"given":"Abhiruk","family":"Lahiri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joydeep","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C. R.","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"issue":"2","key":"46_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."},{"issue":"1","key":"46_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM (JACM) 41(1), 153\u2013180 (1994)","journal-title":"J. ACM (JACM)"},{"key":"46_CR3","unstructured":"Biedl, T.C., Derka, M.: \n                      \n                        \n                      \n                      \n$$1$$\n\n                      \n                        \n                          \n                            1\n                          \n                        \n                      \n                    -string \n                      \n                        \n                      \n                      \n$$b_2$$\n\n                      \n                        \n                          \n                            b\n                            2\n                          \n                        \n                      \n                    -VPG representation of planar graphs. In: 31st International Symposium on Computational Geometry, SoCG 2015, 22\u201325 June 2015, Eindhoven, The Netherlands, pp. 141\u2013155 (2015)"},{"key":"46_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-25870-1_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Chaplick","year":"2011","unstructured":"Chaplick, S., Cohen, E., Stacho, J.: Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 319\u2013330. Springer, Heidelberg (2011)"},{"issue":"3","key":"46_CR5","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s00454-009-9196-9","volume":"43","author":"J Chalopin","year":"2010","unstructured":"Chalopin, J., Gon\u00e7alves, D., Ochem, P.: Planar graphs have 1-string representations. Discrete Comput. Geom. 43(3), 626\u2013647 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, E., Golumbic, M.C., Trotter, W.T., Wang, R.: Posets and VPG graphs. Order, pp. 1\u201311 (2015)","DOI":"10.1007\/s11083-015-9349-9"},{"key":"46_CR7","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)"},{"key":"46_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-45043-3_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Chaplick","year":"2013","unstructured":"Chaplick, S., Kobourov, S.G., Ueckerdt, T.: Equilateral L-contact graphs. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 139\u2013151. Springer, Heidelberg (2013)"},{"issue":"4","key":"46_CR9","doi-asserted-by":"publisher","first-page":"475","DOI":"10.7155\/jgaa.00300","volume":"17","author":"S Chaplick","year":"2013","unstructured":"Chaplick, S., Ueckerdt, T.: Planar graphs as VPG-graphs. J. Graph Algorithms Appl. 17(4), 475\u2013494 (2013)","journal-title":"J. Graph Algorithms Appl."},{"key":"46_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/978-3-662-44465-8_26","volume-title":"Mathematical Foundations of Computer Science 2014","author":"S Felsner","year":"2014","unstructured":"Felsner, S., Knauer, K., Mertzios, G.B., Ueckerdt, T.: Intersection graphs of L-shapes and segments in the plane. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 299\u2013310. Springer, Heidelberg (2014)"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Computing the independence number of intersection graphs. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, 23\u201325 January 2011, San Francisco, California, USA, pp. 1161\u20131165 (2011)","DOI":"10.1137\/1.9781611973082.87"},{"issue":"4","key":"46_CR12","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"46_CR13","series-title":"A Series of Books in the Mathematical Sciences","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences. W. H Freeman and Company, San Francisco (1979)"},{"key":"46_CR14","unstructured":"Halld\u00f3rsson, M.M.: Approximating discrete collections via local improvements. In: SODA, vol. 95, pp. 160\u2013169 (1995)"},{"key":"46_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stad","year":"1997","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within \n                      \n                        \n                      \n                      \n$$n{^{1-\\varepsilon }}$$\n\n                      \n                        \n                          \n                            n\n                            \n                              \n                              \n                                1\n                                -\n                                \u03b5\n                              \n                            \n                          \n                        \n                      \n                    . Acta Mathematica 182, 105\u2013142 (1997)","journal-title":"Acta Mathematica"},{"issue":"2","key":"46_CR16","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"HB Hunt","year":"1998","unstructured":"Hunt, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP-and PSPACE-hard problems for geometric graphs. J. Algorithms 26(2), 238\u2013274 (1998)","journal-title":"J. Algorithms"},{"issue":"1","key":"46_CR17","first-page":"85","volume":"031","author":"J Kratochv\u00edl","year":"1990","unstructured":"Kratochv\u00edl, J., Nesetril, J.: INDEPENDENT SET and CLIQUE problems in intersection-defined classes of graphs. Commentationes Mathematicae Universitatis Carolinae 031(1), 85\u201393 (1990)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"46_CR18","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 22\u201324 January 1990, San Francisco, California, pp. 138\u2013148 (1990)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T17:01:33Z","timestamp":1559322093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}