{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T04:27:03Z","timestamp":1666067223357},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,2,12]],"date-time":"2019-02-12T00:00:00Z","timestamp":1549929600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["PDF\/2016\/001647"],"award-info":[{"award-number":["PDF\/2016\/001647"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s00224-019-09912-4","type":"journal-article","created":{"date-parts":[[2019,2,12]],"date-time":"2019-02-12T07:47:41Z","timestamp":1549957661000},"page":"1336-1357","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Bounds on the Bend Number of Split and Cocomparability Graphs"],"prefix":"10.1007","volume":"63","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"}]},{"given":"Uma Kant","family":"Sahoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,12]]},"reference":[{"issue":"2","key":"9912_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. Journal of Graph Algorithms and Applications 16(2), 129\u2013150 (2012)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"1","key":"9912_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"AA Bertossi","year":"1984","unstructured":"Bertossi, A.A.: Dominating sets for split and bipartite graphs. Inf. Process. Lett. 19(1), 37\u201340 (1984)","journal-title":"Inf. Process. Lett."},{"key":"9912_CR3","unstructured":"Biedl, T.C., Derka, M.: 1-String B\n                           2-VPG representation of planar graphs. In: 31St International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands, pp. 141\u2013155 (2015)"},{"key":"9912_CR4","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Cohen, E., Stacho, J.: Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid. In: Graph-Theoretic Concepts in Computer Science, pp. 319\u2013330. Springer (2011)","DOI":"10.1007\/978-3-642-25870-1_29"},{"key":"9912_CR5","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Jel\u00ednek, V., Kratochvil, J., Vysko\u010dil, T.: Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill. In: Graph-Theoretic Concepts in Computer Science, pp. 274\u2013285. Springer (2012)","DOI":"10.1007\/978-3-642-34611-8_28"},{"issue":"1","key":"9912_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s11083-015-9349-9","volume":"33","author":"E Cohen","year":"2016","unstructured":"Cohen, E., Golumbic, M.C., Trotter, W.T., Wang, R.: Posets and vpg graphs. Order 33(1), 39\u201349 (2016)","journal-title":"Order"},{"issue":"3","key":"9912_CR7","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1016\/j.aim.2012.03.011","volume":"230","author":"J Fox","year":"2012","unstructured":"Fox, J., Pach, J.: String graphs and incomparability graphs. Adv. Math. 230(3), 1381\u20131401 (2012)","journal-title":"Adv. Math."},{"issue":"1","key":"9912_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal of Combinatorial Theory, Series B 16(1), 47\u201356 (1974)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"9912_CR9","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). \n                    https:\/\/doi.org\/10.1016\/0012-365X(83)90019-5","journal-title":"Discrete Math."},{"key":"9912_CR10","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 Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201918, pp. 172\u2013184. New Orleans, Louisiana (2018)","DOI":"10.1137\/1.9781611975031.12"},{"key":"9912_CR11","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison Wesley, Boston (1969)"},{"issue":"1","key":"9912_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0095-8956(91)90090-7","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. I. the number of critical nonstring graphs is infinite. Journal of Combinatorial Theory, Series B 52(1), 53\u201366 (1991)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"9912_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. II. recognizing string graphs is NP-hard. Journal of Combinatorial Theory, Series B 52(1), 67\u201378 (1991)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"9912_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(91)90050-T","volume":"53","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: String graphs requiring exponential representations. Journal of Combinatorial Theory, Series B 53(1), 1\u20134 (1991)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"9912_CR15","doi-asserted-by":"crossref","unstructured":"Lahiri, A., Mukherjee, J., Subramanian, C.: Maximum independent Set on B\n                           1-VPG Graphs. In: Combinatorial Optimization and Applications, pp. 633\u2013646. Springer (2015)","DOI":"10.1007\/978-3-319-26626-8_46"},{"key":"9912_CR16","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: String graphs and separators. In: Geometry, Structure and Randomness in Combinatorics, pp. 61\u201397. Springer (2014)","DOI":"10.1007\/978-88-7642-525-7_5"},{"key":"9912_CR17","unstructured":"Mehrabi, S.: Approximation algorithms for independence and domination on B\n                           1-VPG and B\n                           1-EPG graphs. arXiv:\n                    1702.05633\n                    \n                   (2017)"},{"issue":"2","key":"9912_CR18","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0022-0000(03)00045-X","volume":"67","author":"M Schaefer","year":"2003","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Recognizing string graphs in NP. J. Comput. Syst. Sci. 67(2), 365\u2013380 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"9","key":"9912_CR19","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1002\/j.1538-7305.1966.tb01713.x","volume":"45","author":"FW Sinden","year":"1966","unstructured":"Sinden, F.W.: Topology of thin film rc circuits. Bell Syst. Tech. J. 45(9), 1639\u20131662 (1966)","journal-title":"Bell Syst. Tech. J."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-019-09912-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-019-09912-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-019-09912-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T00:15:21Z","timestamp":1581466521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-019-09912-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,12]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["9912"],"URL":"https:\/\/doi.org\/10.1007\/s00224-019-09912-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,12]]},"assertion":[{"value":"12 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}