{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:49:55Z","timestamp":1743140995358,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030950170"},{"type":"electronic","value":"9783030950187"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95018-7_9","type":"book-chapter","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:04Z","timestamp":1642982704000},"page":"103-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$$B_0$$-VPG Representation of AT-free Outerplanar Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5175-8511","authenticated-orcid":false,"given":"Sparsh","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4697-5391","authenticated-orcid":false,"given":"Sreejith K.","family":"Pallathumadam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9101-8967","authenticated-orcid":false,"given":"Deepak","family":"Rajendraprasad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s00373-017-1791-6","volume":"33","author":"L Alc\u00f3n","year":"2017","unstructured":"Alc\u00f3n, L., Bonomo, F., Mazzoleni, M.P.: Vertex intersection graphs of paths on a grid: characterization within block graphs. Graphs and Combinatorics 33(4), 653\u2013664 (2017)","journal-title":"Graphs and Combinatorics"},{"issue":"2","key":"9_CR2","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":"2","key":"9_CR3","first-page":"191","volume":"7","author":"T Biedl","year":"2016","unstructured":"Biedl, T., Derka, M.: 1-string B$$_{2}$$-VPG representation of planar graphs. J. Comput. Geom. (Old Web Site) 7(2), 191\u2013215 (2016)","journal-title":"J. Comput. Geom. (Old Web Site)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.7155\/jgaa.00043","volume":"6","author":"N de Castro","year":"2002","unstructured":"de Castro, N., Cobos, F.J., Dana, J.C., M\u00e1rquez, A., Noy, M.: Triangle-free planar graphs and segment intersection graphs. J. Graph Algorithms Appl. 6(1), 7\u201326 (2002)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.dam.2015.08.019","volume":"216","author":"D Catanzaro","year":"2017","unstructured":"Catanzaro, D., et al.: Max point-tolerance graphs. Discret. Appl. Math. 216, 84\u201397 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1007\/s00224-019-09912-4","volume":"63","author":"D Chakraborty","year":"2019","unstructured":"Chakraborty, D., Das, S., Mukherjee, J., Sahoo, U.K.: Bounds on the bend number of split and cocomparability graphs. Theory Comput. Syst. 63(6), 1336\u20131357 (2019). https:\/\/doi.org\/10.1007\/s00224-019-09912-4","journal-title":"Theory Comput. Syst."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Gon\u00e7alves, D.: Every planar graph is the intersection graph of segments in the plane. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 631\u2013638 (2009)","DOI":"10.1145\/1536414.1536500"},{"key":"9_CR8","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). https:\/\/doi.org\/10.1007\/978-3-642-25870-1_29"},{"key":"9_CR9","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"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Chaplick, S., Ueckerdt, T.: Planar graphs as VPG-graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 174\u2013186. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_16","DOI":"10.1007\/978-3-642-36763-2_16"},{"issue":"1","key":"9_CR11","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":"9_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(98)00046-5","volume":"66","author":"J Czyzowicz","year":"1998","unstructured":"Czyzowicz, J., Kranakis, E., Urrutia, J.: A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments. Inf. Process. Lett. 66(3), 125\u2013126 (1998)","journal-title":"Inf. Process. Lett."},{"key":"9_CR13","first-page":"109","volume":"63","author":"H De Fraysseix","year":"1991","unstructured":"De Fraysseix, H., Ossona de Mendez, P., Pach, J.: Representation of planar graphs by segments. Intuitive Geom. 63, 109\u2013117 (1991)","journal-title":"Intuitive Geom."},{"issue":"1\u20134","key":"9_CR14","first-page":"215","volume":"38","author":"HJ Fleischner","year":"1974","unstructured":"Fleischner, H.J., Geller, D.P., Harary, F.: Outerplanar graphs and weak duals. J. Indian Math. Soc. 38(1\u20134), 215\u2013219 (1974)","journal-title":"J. Indian Math. Soc."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.dam.2016.07.007","volume":"215","author":"MC Francis","year":"2016","unstructured":"Francis, M.C., Lahiri, A.: VPG and EPG bend-numbers of Halin graphs. Discret. Appl. Math. 215, 95\u2013105 (2016)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s00373-012-1133-7","volume":"29","author":"MC Golumbic","year":"2013","unstructured":"Golumbic, M.C., Ries, B.: On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs. Graphs and Combinatorics 29(3), 499\u2013517 (2013)","journal-title":"Graphs and Combinatorics"},{"key":"9_CR17","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 ACMSIAM Symposium on Discrete Algorithms, pp. 172\u2013184. SIAM (2018)","DOI":"10.1137\/1.9781611975031.12"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(91)90069-E","volume":"87","author":"IB-A Hartman","year":"1991","unstructured":"Hartman, I.B.-A., Newman, I., Ziv, R.: On grid intersection graphs. Discrete Math. 87(1), 41\u201352 (1991)","journal-title":"Discrete Math."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J.: String graphs. II. Recognizing string graphs is NP-hard. J. Comb. Theory Ser. B 52(1), 67\u201378 (1991)","DOI":"10.1016\/0095-8956(91)90091-W"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theory, Series B 62(2), 289\u2013315 (1994)","DOI":"10.1006\/jctb.1994.1071"},{"key":"9_CR21","unstructured":"Mehrabi, S.: Approximation algorithms for independence and domination on B$${_{1}}$$-VPG and B$${_{1}}$$-EPG graphs. arXiv preprint arXiv:1702.05633 (2017)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-68766-3_16","volume-title":"Graph Drawing and Network Visualization","author":"SK Pallathumadam","year":"2020","unstructured":"Pallathumadam, S.K., Rajendraprasad, D.: Characterization and a 2D visualization of B$$_{0}$$-VPG cocomparability graphs. In: GD 2020. LNCS, vol. 12590, pp. 191\u2013204. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_16"},{"issue":"2","key":"9_CR23","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."},{"key":"9_CR24","unstructured":"Scheinerman, E.R.: Intersection classes and multiple intersection parameters of graphs. Princeton University (1984)"},{"key":"9_CR25","unstructured":"West, D.: Open problems. SIAM J. Discrete Math. Newslett. 2, 10\u201312 (1991)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95018-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:39Z","timestamp":1642982739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95018-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030950170","9783030950187"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95018-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puducherry","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acsdm.org\/caldam\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","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":"25","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":"31% - 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","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":"6","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}