{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T03:42:11Z","timestamp":1769571731207,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030044138","type":"print"},{"value":"9783030044145","type":"electronic"}],"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_16","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T18:20:45Z","timestamp":1545070845000},"page":"229-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Crossing Minimization in Perturbed Drawings"],"prefix":"10.1007","author":[{"given":"Radoslav","family":"Fulek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"key":"16_CR1","unstructured":"Fulek, R., Kyn\u010dl, J.: Hanani-Tutte for approximating maps of graphs. In: Proceedings of the 34th Symposium on Computational Geometry (SoCG). LIPIcs, vol. 99, pp. 39:1\u201339:15. Dagstuhl, Germany (2018)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/1.9781611975031.20","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Hugo A. Akitaya","year":"2018","unstructured":"Akitaya, H.A., Fulek, R., T\u00f3th, C.D.: Recognizing weak embeddings of graphs. In: Proceedings of the 29th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 274\u2013292. SIAM (2018)"},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1982","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebr. Discret. Methods 4(3), 312\u2013316 (1982)","journal-title":"SIAM J. Algebr. Discret. Methods"},{"issue":"5","key":"16_CR4","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."},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1007\/s00454-017-9918-3","volume":"58","author":"HA Akitaya","year":"2017","unstructured":"Akitaya, H.A., Aloupis, G., Erickson, J., T\u00f3th, C.D.: Recognizing weakly simple polygons. Discret. Comput. Geom. 58(4), 785\u2013821 (2017)","journal-title":"Discret. Comput. Geom."},{"key":"16_CR6","first-page":"1655","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Hsien-Chih Chang","year":"2014","unstructured":"Chang, H.C., Erickson, J., Xu, C.: Detecting weakly simple polygons. In: Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1655\u20131670 (2015)"},{"issue":"7","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1856","DOI":"10.1016\/j.disc.2007.12.090","volume":"309","author":"PF Cortese","year":"2009","unstructured":"Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: On embedding a cycle in a plane graph. Discret. Math. 309(7), 1856\u20131869 (2009)","journal-title":"Discret. Math."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.4064\/fm-23-1-135-142","volume":"23","author":"H Hanani","year":"1934","unstructured":"Hanani, H.: \u00dcber wesentlich unpl\u00e4ttbare Kurven im drei-dimensionalen Raume. Fundam. Math. 23, 135\u2013142 (1934)","journal-title":"Fundam. Math."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0021-9800(70)80007-2","volume":"8","author":"WT Tutte","year":"1970","unstructured":"Tutte, W.T.: Toward a theory of crossing numbers. J. Comb. Theory 8, 45\u201353 (1970)","journal-title":"J. Comb. Theory"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-8641(03)00069-5","volume":"134","author":"M Skopenkov","year":"2003","unstructured":"Skopenkov, M.: On approximability by embeddings of cycles in the plane. Topol. Appl. 134(1), 1\u201322 (2003)","journal-title":"Topol. Appl."},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-8641(97)00121-1","volume":"87","author":"D Repov\u0161","year":"1998","unstructured":"Repov\u0161, D., Skopenkov, A.B.: A deleted product criterion for approximability of maps by embeddings. Topol. Appl. 87(1), 1\u201319 (1998)","journal-title":"Topol. Appl."},{"issue":"4","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/s00453-016-0128-9","volume":"77","author":"P Angelini","year":"2017","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F.: Strip planarity testing for embedded planar graphs. Algorithmica 77(4), 1022\u20131059 (2017)","journal-title":"Algorithmica"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-37623-2_17","volume-title":"Graph Drawing","author":"M J\u00fcnger","year":"1998","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P.: Level planarity testing in linear time. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 224\u2013237. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-37623-2_17"},{"key":"16_CR14","unstructured":"Angelini, P., Lozzo, G.D.: Clustered planarity with pipes. In: Hong, S.H. (ed.) Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC). LIPIcs, vol. 64, pp. 13:1\u201313:13. Schloss Dagstuhl (2016)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BFb0030816","volume-title":"Computing and Combinatorics","author":"Q-W Feng","year":"1995","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: How to draw a planar clustered graph. In: Du, D.-Z., Li, M. (eds.) COCOON 1995. LNCS, vol. 959, pp. 21\u201330. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0030816"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Algorithms \u2014 ESA 1995","author":"Q-W Feng","year":"1995","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P. (ed.) ESA 1995. LNCS, vol. 979, pp. 213\u2013226. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60313-1_145"},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"391","DOI":"10.7155\/jgaa.00115","volume":"9","author":"PF Cortese","year":"2005","unstructured":"Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: Clustering cycles into cycles of clusters. J. Graph Algorithms Appl. 9(3), 391\u2013413 (2005)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BF02772960","volume":"51","author":"J Hass","year":"1985","unstructured":"Hass, J., Scott, P.: Intersections of curves on surfaces. Isr. J. Math. 51(1), 90\u2013120 (1985)","journal-title":"Isr. J. Math."}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:19:21Z","timestamp":1710249561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04414-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030044138","9783030044145"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04414-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}]}}