{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:33:36Z","timestamp":1760441616569,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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-39881-1_28","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"329-335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Experimental Study of a 1-Planarity Testing and Embedding Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9110","authenticated-orcid":false,"given":"Carla","family":"Binucci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-6059","authenticated-orcid":false,"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"28_CR1","unstructured":"http:\/\/www.graphdrawing.org\/data.html\n\n. Accessed June 2019"},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1007\/s00453-015-0002-1","volume":"74","author":"C Auer","year":"2016","unstructured":"Auer, C., et al.: Outer 1-planar graphs. Algorithmica 74(4), 1293\u20131320 (2016)","journal-title":"Algorithmica"},{"issue":"1","key":"28_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.7155\/jgaa.00347","volume":"19","author":"C Auer","year":"2015","unstructured":"Auer, C., Brandenburg, F.J., Glei\u00dfner, A., Reislhuber, J.: 1-planarity of graphs with a rotation system. J. Graph Algorithms Appl. 19(1), 67\u201386 (2015)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.7155\/jgaa.00457","volume":"22","author":"MJ Bannister","year":"2018","unstructured":"Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. J. Graph Algorithms Appl. 22(1), 23\u201349 (2018)","journal-title":"J. Graph Algorithms Appl."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Binucci, C., Didimo, W., Montecchiani, F.: An experimental study of a 1-planarity testing and embedding algorithm. CoRR \narXiv:1911.00573\n\n (2019)","DOI":"10.1007\/978-3-030-39881-1_28"},{"issue":"3","key":"28_CR6","doi-asserted-by":"publisher","first-page":"421","DOI":"10.7155\/jgaa.00330","volume":"18","author":"FJ Brandenburg","year":"2014","unstructured":"Brandenburg, F.J.: 1-visibility representations of 1-planar graphs. J. Graph Algorithms Appl. 18(3), 421\u2013438 (2014)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-016-0226-8","volume":"80","author":"FJ Brandenburg","year":"2018","unstructured":"Brandenburg, F.J.: Recognizing optimal 1-planar graphs in linear time. Algorithmica 80(1), 1\u201328 (2018)","journal-title":"Algorithmica"},{"issue":"5","key":"28_CR8","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1007\/s00453-018-0510-x","volume":"81","author":"FJ Brandenburg","year":"2019","unstructured":"Brandenburg, F.J.: Characterizing and recognizing 4-map graphs. Algorithmica 81(5), 1818\u20131843 (2019)","journal-title":"Algorithmica"},{"issue":"5","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/120872310","volume":"42","author":"S Cabello","year":"2013","unstructured":"Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42(5), 1803\u20131829 (2013)","journal-title":"SIAM J. Comput."},{"key":"28_CR10","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Handbook of Graph Drawing and Visualization, pp. 543\u2013569. Chapman and Hall\/CRC (2013)"},{"key":"28_CR11","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River (1999)"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G Battista Di","year":"1997","unstructured":"Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Comput. Geom. 7, 303\u2013325 (1997)","journal-title":"Comput. Geom."},{"issue":"8","key":"28_CR13","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1007\/s00453-017-0324-2","volume":"80","author":"E Giacomo Di","year":"2018","unstructured":"Di Giacomo, E., et al.: Ortho-polygon visibility representations of embedded graphs. Algorithmica 80(8), 2345\u20132383 (2018)","journal-title":"Algorithmica"},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/3301281","volume":"52","author":"W Didimo","year":"2019","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Surv. 52(1), 4:1\u20134:37 (2019)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","volume":"49","author":"A Grigoriev","year":"2007","unstructured":"Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49(1), 1\u201311 (2007)","journal-title":"Algorithmica"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-24595-7_2","volume-title":"Graph Drawing","author":"C Gutwenger","year":"2004","unstructured":"Gutwenger, C., Mutzel, P.: An experimental study of crossing minimization heuristics. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 13\u201324. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24595-7_2"},{"issue":"4","key":"28_CR17","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1007\/s00453-014-9890-8","volume":"72","author":"S Hong","year":"2015","unstructured":"Hong, S., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear-time algorithm for testing outer-1-planarity. Algorithmica 72(4), 1033\u20131054 (2015)","journal-title":"Algorithmica"},{"key":"28_CR18","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)","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"28_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"VP Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. J. Graph Theory 72(1), 30\u201371 (2013)","journal-title":"J. Graph Theory"},{"issue":"3","key":"28_CR20","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)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:06:23Z","timestamp":1582139183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_28","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":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","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":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}