{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:50:54Z","timestamp":1743011454198,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030044138"},{"type":"electronic","value":"9783030044145"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04414-5_5","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T13:20:45Z","timestamp":1545052845000},"page":"67-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Turning Cliques into Paths to Achieve Planarity"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"731","DOI":"10.7155\/jgaa.00437","volume":"21","author":"P Angelini","year":"2017","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Intersection-link representations of graphs. J. Graph Algorithms Appl. 21(4), 731\u2013755 (2017). https:\/\/doi.org\/10.7155\/jgaa.00437","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR2","unstructured":"Angelini, P., Eades, P., Hong, S.-H., Klein, K., Kobourov, S., Liotta, G., Navarra, A., Tappini, A.: Turning cliques into paths to achieve planarity. CoRR 1808.08925v2 (2018). http:\/\/arxiv.org\/abs\/1808.08925v2"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On optimal 2- and 3-planargraphs. In: 33rd International Symposium on Computational Geometry, SoCG2017, 4-7 July 2017, Brisbane, Australia, pp. 16:1\u201316:16 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.16","DOI":"10.4230\/LIPIcs.SoCG.2017.16"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.7155\/jgaa.00461","volume":"22","author":"G Da Lozzo","year":"2018","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M.: Computing NodeTrix representations of clustered graphs. J. Graph Algorithms Appl. 22(2), 139\u2013176 (2018). https:\/\/doi.org\/10.7155\/jgaa.00461","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-319-73915-1_37","volume-title":"Graph Drawing and Network Visualization","author":"E Di Giacomo","year":"2018","unstructured":"Di Giacomo, E., Liotta, G., Patrignani, M., Tappini, A.: NodeTrix planarity testing with small clusters. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 479\u2013491. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_37"},{"key":"5_CR6","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. CoRR abs\/1804.07257 (2018). http:\/\/arxiv.org\/abs\/1804.07257"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1057\/palgrave.ivs.9500092","volume":"4","author":"M Ghoniem","year":"2005","unstructured":"Ghoniem, M., Fekete, J., Castagliola, P.: On the readability of graphs using node-link and matrix-based representations: a controlled experiment and statistical analysis. Inf. Vis. 4(2), 114\u2013135 (2005). https:\/\/doi.org\/10.1057\/palgrave.ivs.9500092","journal-title":"Inf. Vis."},{"issue":"6","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1109\/TVCG.2007.70582","volume":"13","author":"N Henry","year":"2007","unstructured":"Henry, N., Fekete, J., McGuffin, M.J.: NodeTrix: a hybrid visualization of social networks. IEEE Trans. Vis. Comput. Graph. 13(6), 1302\u20131309 (2007). https:\/\/doi.org\/10.1109\/TVCG.2007.70582","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"5_CR9","unstructured":"Kindermann, P., Klemz, B., Rutter, I., Schnider, P., Schulz, A.: The partition spanning forest problem. In: Mulzer, W. (ed.) Proceedings of the 34th European Workshop on Computational Geometry (EuroCG 2018), Berlin (2018, to appear)"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cosrev.2017.06.002","volume":"25","author":"SG Kobourov","year":"2017","unstructured":"Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49\u201367 (2017). https:\/\/doi.org\/10.1016\/j.cosrev.2017.06.002","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/1346330.1346336","volume":"55","author":"W Mulzer","year":"2008","unstructured":"Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55(2), 11:1\u201311:29 (2008). https:\/\/doi.org\/10.1145\/1346330.1346336","journal-title":"J. ACM"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-319-73915-1_23","volume-title":"Graph Drawing and Network Visualization","author":"M Okoe","year":"2018","unstructured":"Okoe, M., Jianu, R., Kobourov, S.: Revisited experimental comparison of node-link and matrix representations. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 287\u2013302. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_23"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997). https:\/\/doi.org\/10.1007\/BF01215922","journal-title":"Combinatorica"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TVCG.2016.2598472","volume":"23","author":"X Yang","year":"2017","unstructured":"Yang, X., Shi, L., Daianu, M., Tong, H., Liu, Q., Thompson, P.: Blockwise human brain network visual comparison using NodeTrix representation. IEEE Trans. Vis. Comput. Graph. 23(1), 181\u2013190 (2017). https:\/\/doi.org\/10.1109\/TVCG.2016.2598472","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"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-04414-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:52:56Z","timestamp":1710233576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04414-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030044138","9783030044145"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04414-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 December 2018","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":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dccg.upc.edu\/gd2018\/","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":"85","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":"41","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":"48% - 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.25","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.92","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 book also contains 1 full invited paper and 1 contest report","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}