{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:19:50Z","timestamp":1742948390637,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030687656"},{"type":"electronic","value":"9783030687663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-68766-3_16","type":"book-chapter","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T09:11:53Z","timestamp":1613293913000},"page":"191-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4697-5391","authenticated-orcid":false,"given":"Sreejith K.","family":"Pallathumadam","sequence":"first","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":[[2021,2,14]]},"reference":[{"issue":"4","key":"16_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 Comb. 33(4), 653\u2013664 (2017)","journal-title":"Graphs Comb."},{"issue":"2","key":"16_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":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0097-3165(76)90004-2","volume":"21","author":"KP Bogart","year":"1976","unstructured":"Bogart, K.P., Rabinovich, I., Trotter Jr., W.T.: A bound on the dimension of interval orders. J. Comb. Theory Ser. A 21(3), 319\u2013328 (1976)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"6","key":"16_CR4","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)","journal-title":"Theory Comput. Syst."},{"key":"16_CR5","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"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s11083-017-9437-0","volume":"35","author":"S Chaplick","year":"2018","unstructured":"Chaplick, S., Felsner, S., Hoffmann, U., Wiechert, V.: Grid intersection graphs and order dimension. Order 35(2), 363\u2013391 (2018)","journal-title":"Order"},{"key":"16_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). https:\/\/doi.org\/10.1007\/978-3-642-34611-8_28"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-36763-2_16","volume-title":"Graph Drawing","author":"S Chaplick","year":"2013","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"},{"key":"16_CR9","unstructured":"Chejnovsk\u00e1, A.: Optimisation using graph searching on special graph classes. Bachelor Thesis, Univerzita Karlova, Matematicko-fyzik\u00e1ln\u00ed fakulta (2015)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.dam.2014.06.020","volume":"178","author":"E Cohen","year":"2014","unstructured":"Cohen, E., Golumbic, M.C., Ries, B.: Characterizations of cographs as intersection graphs of paths on a grid. Discrete Appl. Math. 178, 46\u201357 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"16_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"},{"key":"16_CR12","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: LBFS orderings and cocomparability graphs. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 883\u2013884 (1999)"},{"issue":"2\u20133","key":"16_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci. 61(2\u20133), 175\u2013198 (1988)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"GD Battista","year":"1992","unstructured":"Battista, G.D., Tamassia, R., Tollis, I.G.: Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geometry 7(4), 381\u2013401 (1992). https:\/\/doi.org\/10.1007\/BF02187850","journal-title":"Discrete Comput. Geometry"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.7155\/jgaa.00099","volume":"9","author":"M Dickerson","year":"2005","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: visualizing non-planar diagrams in a planar way. J. Graph Algorithms Appl. 9(1), 31\u201352 (2005)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0022-2496(70)90062-3","volume":"7","author":"PC Fishburn","year":"1970","unstructured":"Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psychol. 7(1), 144\u2013149 (1970)","journal-title":"J. Math. Psychol."},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"PC Gilmore","year":"1964","unstructured":"Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Can. J. Math. 16, 539\u2013548 (1964)","journal-title":"Can. J. Math."},{"issue":"3","key":"16_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02253207","volume":"18","author":"MC Golumbic","year":"1977","unstructured":"Golumbic, M.C.: The complexity of comparability graph recognition and coloring. Computing 18(3), 199\u2013208 (1977)","journal-title":"Computing"},{"issue":"2","key":"16_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(84)90016-7","volume":"9","author":"MC Golumbic","year":"1984","unstructured":"Golumbic, M.C., Monma, C.L., Trotter Jr., W.T.: Tolerance graphs. Discrete Appl. Math. 9(2), 157\u2013170 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"16_CR20","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 Comb. 29(3), 499\u2013517 (2013)","journal-title":"Graphs Comb."},{"issue":"1","key":"16_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(91)90069-E","volume":"87","author":"IBA 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":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-642-36763-2_52","volume-title":"Graph Drawing","author":"EM Kornaropoulos","year":"2013","unstructured":"Kornaropoulos, E.M., Tollis, I.G.: Weak dominance drawings for directed acyclic graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 559\u2013560. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_52"},{"key":"16_CR23","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"},{"issue":"2","key":"16_CR24","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theory Ser. B 62(2), 289\u2013315 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"16_CR25","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0406032","volume":"6","author":"D Kratsch","year":"1993","unstructured":"Kratsch, D., Stewart, L.: Domination on cocomparability graphs. SIAM J. Discrete Math. 6(3), 400\u2013417 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Pallathumadam, S.K., Rajendraprasad, D.: Characterization and a 2D visualization of B$$_0$$-VPG cocomparability graphs. arXiv preprint arXiv:2008.02173 (2020)","DOI":"10.1007\/978-3-030-68766-3_16"},{"issue":"1","key":"16_CR27","doi-asserted-by":"publisher","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","volume":"23","author":"A Pnueli","year":"1971","unstructured":"Pnueli, A., Lempel, A., Even, S.: Transitive orientation of graphs and identification of permutation graphs. Can. J. Math. 23(1), 160\u2013175 (1971)","journal-title":"Can. J. Math."},{"issue":"2","key":"16_CR28","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":"3","key":"16_CR29","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"J Spinrad","year":"1987","unstructured":"Spinrad, J., Brandst\u00e4dt, A., Stewart, L.: Bipartite permutation graphs. Discrete Appl. Math. 18(3), 279\u2013292 (1987)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"16_CR30","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1090\/S0002-9939-1976-0417001-6","volume":"60","author":"WT Trotter","year":"1976","unstructured":"Trotter, W.T., Moore, J.I., Sumner, D.P.: The dimension of a comparability graph. Proc. Am. Math. Soc. 60(1), 35\u201338 (1976)","journal-title":"Proc. Am. Math. Soc."},{"key":"16_CR31","unstructured":"Trotter, W., Keller, M.: Applied Combinatorics. CreateSpace Independent Publishing Platform (2016)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68766-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T23:03:31Z","timestamp":1739401411000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68766-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030687656","9783030687663"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68766-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vancouver, BC","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2020.cs.ubc.ca\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","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":"29","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":"9","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":"35% - 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,02","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":"3","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":"The conference was held virtually due to the COVID-19 pandemic","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)"}}]}}