{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:31:59Z","timestamp":1743107519882,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492716"},{"type":"electronic","value":"9783031492723"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49272-3_6","type":"book-chapter","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:04:34Z","timestamp":1704963874000},"page":"78-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["String Graphs with\u00a0Precise Number of\u00a0Intersections"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9131-1458","authenticated-orcid":false,"given":"Petr","family":"Chmel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4831-4079","authenticated-orcid":false,"given":"V\u00edt","family":"Jel\u00ednek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,1]]},"reference":[{"issue":"2","key":"6_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). https:\/\/doi.org\/10.7155\/jgaa.00253","journal-title":"J. Graph Algorithms Appl."},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Cabello, S., Jej\u010di\u010d, M.: Refining the hierarchies of classes of geometric intersection graphs. Electron. J. Comb. P1\u201333 (2017). https:\/\/doi.org\/10.37236\/6040","DOI":"10.37236\/6040"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.dam.2020.11.018","volume":"290","author":"N Champseix","year":"2021","unstructured":"Champseix, N., Galby, E., Munaro, A., Ries, B.: CPG graphs: some structural and hardness results. Discret. Appl. Math. 290, 17\u201335 (2021). https:\/\/doi.org\/10.1016\/j.dam.2020.11.018","journal-title":"Discret. Appl. Math."},{"key":"6_CR4","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":"6_CR5","unstructured":"Chmel, P., Jel\u00ednek, V.: String graphs with precise number of intersections. CoRR abs\/2308.15590 (2023). https:\/\/arxiv.org\/abs\/2308.15590"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-04414-5_22","volume-title":"Graph Drawing and Network Visualization","author":"Z Deniz","year":"2018","unstructured":"Deniz, Z., Galby, E., Munaro, A., Ries, B.: On contact graphs of paths on a grid. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 317\u2013330. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_22"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jctb.1998.1846","volume":"74","author":"P Hlin\u011bn\u00fd","year":"1998","unstructured":"Hlin\u011bn\u00fd, P.: Classes and recognition of curve contact graphs. J. Comb. Theor. Ser. B 74(1), 87\u2013103 (1998). https:\/\/doi.org\/10.1006\/jctb.1998.1846","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0012-365X(00)00263-6","volume":"235","author":"P Hlin\u011bn\u00fd","year":"2001","unstructured":"Hlin\u011bn\u00fd, P.: Contact graphs of line segments are NP-complete. Discret. Math. 235(1), 95\u2013106 (2001). https:\/\/doi.org\/10.1016\/S0012-365X(00)00263-6","journal-title":"Discret. Math."},{"issue":"1","key":"6_CR9","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. J. Comb. Theor. Ser. B 52(1), 67\u201378 (1991). https:\/\/doi.org\/10.1016\/0095-8956(91)90091-W","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Discret. Appl. Math. 52(3), 233\u2013252 (1994). https:\/\/doi.org\/10.1016\/0166-218X(94)90143-0","journal-title":"Discret. Appl. Math."},{"key":"6_CR11","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: NP-hardness results for intersection graphs. Commentationes Mathematicae Universitatis Carolinae 030(4), 761\u2013773 (1989). http:\/\/eudml.org\/doc\/17790"},{"issue":"2","key":"6_CR12","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. Theor. Ser. B 62(2), 289\u2013315 (1994). https:\/\/doi.org\/10.1006\/jctb.1994.1071","journal-title":"J. Comb. Theor. Ser. B"},{"key":"6_CR13","unstructured":"Musta\u0163\u0103, I., Pergel, M.: What makes the recognition problem hard for classes related to segment and string graphs? CoRR abs\/2201.08498 (2022). https:\/\/arxiv.org\/abs\/2201.08498"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/jctb.2000.1978","volume":"80","author":"J Pach","year":"2000","unstructured":"Pach, J., T\u00f3th, G.: Which crossing number is it anyway? J. Comb. Theor. Ser. B 80(2), 225\u2013246 (2000). https:\/\/doi.org\/10.1006\/jctb.2000.1978","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s00454-008-9058-x","volume":"39","author":"MJ Pelsmajer","year":"2008","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovic, D.: Odd crossing number and crossing number are not the same. Discrete Comput. Geom. 39(1), 442\u2013454 (2008). https:\/\/doi.org\/10.1007\/s00454-008-9058-x","journal-title":"Discrete Comput. Geom."},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Comb. DS21-Apr (2012). https:\/\/doi.org\/10.37236\/2713","DOI":"10.37236\/2713"},{"issue":"2","key":"6_CR17","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). https:\/\/doi.org\/10.1016\/S0022-0000(03)00045-X","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.jcss.2003.07.002","volume":"68","author":"M Schaefer","year":"2004","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Decidability of string graphs. J. Comput. Syst. Sci. 68(2), 319\u2013334 (2004). https:\/\/doi.org\/10.1016\/j.jcss.2003.07.002","journal-title":"J. Comput. Syst. Sci."},{"issue":"9","key":"6_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). https:\/\/doi.org\/10.1002\/j.1538-7305.1966.tb01713.x","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/jgt.3190030302","volume":"3","author":"WT Trotter Jr","year":"1979","unstructured":"Trotter, W.T., Jr., Harary, F.: On double and multiple interval graphs. J. Graph Theory 3(3), 205\u2013211 (1979). https:\/\/doi.org\/10.1002\/jgt.3190030302","journal-title":"J. Graph Theory"}],"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-031-49272-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:05:30Z","timestamp":1704963930000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49272-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492716","9783031492723"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49272-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2024","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":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"100","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":"31","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":"7","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":"13","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":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","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)"}}]}}