{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:34:02Z","timestamp":1760441642185,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"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-60440-0_26","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"325-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Inserting One Edge into a Simple Drawing Is Hard"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2401-8670","authenticated-orcid":false,"given":"Alan","family":"Arroyo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7791-3604","authenticated-orcid":false,"given":"Fabian","family":"Klute","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3147-0083","authenticated-orcid":false,"given":"Irene","family":"Parada","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2349-785X","authenticated-orcid":false,"given":"Raimund","family":"Seidel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7166-4467","authenticated-orcid":false,"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5923-4114","authenticated-orcid":false,"given":"Tilo","family":"Wiedera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"issue":"4","key":"26_CR1","doi-asserted-by":"publisher","first-page":"32:1","DOI":"10.1145\/2629341","volume":"11","author":"P Angelini","year":"2015","unstructured":"Angelini, P., et al.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4), 32:1\u201332:42 (2015). https:\/\/doi.org\/10.1145\/2629341","journal-title":"ACM Trans. Algorithms"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-030-35802-0_18","volume-title":"Graph Drawing and Network Visualization","author":"A Arroyo","year":"2019","unstructured":"Arroyo, A., Derka, M., Parada, I.: Extending simple drawings. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 230\u2013243. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_18"},{"issue":"4","key":"26_CR3","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1002\/jgt.22167","volume":"87","author":"A Arroyo","year":"2018","unstructured":"Arroyo, A., McQuillan, D., Richter, R.B., Salazar, G.: Levi\u2019s lemma, pseudolinear drawings of $${K}_n$$, and empty triangles. J. Graph Theory 87(4), 443\u2013459 (2018). https:\/\/doi.org\/10.1002\/jgt.22167","journal-title":"J. Graph Theory"},{"issue":"12\u201313","key":"26_CR4","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ipl.2010.04.019","volume":"110","author":"A Bagheri","year":"2010","unstructured":"Bagheri, A., Razzazi, M.: Planar straight-line point-set embedding of trees with partial embeddings. Inf. Process. Lett. 110(12\u201313), 521\u2013523 (2010). https:\/\/doi.org\/10.1016\/j.ipl.2010.04.019","journal-title":"Inf. Process. Lett."},{"key":"26_CR5","doi-asserted-by":"publisher","unstructured":"Br\u00fcckner, G., Rutter, I.: Partial and constrained level planarity. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pp. 2000\u20132011. SIAM (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.130","DOI":"10.1137\/1.9781611974782.130"},{"issue":"5","key":"26_CR6","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). https:\/\/doi.org\/10.1137\/120872310","journal-title":"SIAM J. Comput."},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-12340-0_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Chaplick","year":"2014","unstructured":"Chaplick, S., Dorbec, P., Kratochv\u00edl, J., Montassier, M., Stacho, J.: Contact representations of planar graphs: extending a partial representation is hard. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 139\u2013151. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12340-0_12"},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1002\/jgt.22436","volume":"91","author":"S Chaplick","year":"2019","unstructured":"Chaplick, S., Fulek, R., Klav\u00edk, P.: Extending partial representations of circle graphs. J. Graph Theory 91(4), 365\u2013394 (2019). https:\/\/doi.org\/10.1002\/jgt.22436","journal-title":"J. Graph Theory"},{"issue":"8","key":"26_CR9","doi-asserted-by":"publisher","first-page":"2286","DOI":"10.1007\/s00453-017-0322-4","volume":"80","author":"S Chaplick","year":"2017","unstructured":"Chaplick, S., Gu\u015bpiel, G., Gutowski, G., Krawczyk, T., Liotta, G.: The partial visibility representation extension problem. Algorithmica 80(8), 2286\u20132323 (2017). https:\/\/doi.org\/10.1007\/s00453-017-0322-4","journal-title":"Algorithmica"},{"key":"26_CR10","doi-asserted-by":"publisher","unstructured":"Chimani, M., Gutwenger, C., Mutzel, P., Wolf, C.: Inserting a vertex into a planar graph. In: Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pp. 375\u2013383. SIAM (2009). https:\/\/doi.org\/10.1137\/1.9781611973068.42","DOI":"10.1137\/1.9781611973068.42"},{"key":"26_CR11","doi-asserted-by":"publisher","unstructured":"Chimani, M., Hlinen\u00fd, P.: Inserting multiple edges into a planar graph. In: Proceedings of the 32nd International Symposium on Computational Geometry (SoCG 2016), vol. 51, pp. 30:1\u201330:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2016.30","DOI":"10.4230\/LIPIcs.SoCG.2016.30"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-030-24766-9_25","volume-title":"Algorithms and Data Structures","author":"G Da Lozzo","year":"2019","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F.: Extending upward planar graph drawings. In: Friggstad, Z., Sack, J.-R., Salavatipour, M.R. (eds.) WADS 2019. LNCS, vol. 11646, pp. 339\u2013352. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24766-9_25"},{"key":"26_CR13","first-page":"125","volume-title":"Handbook of Discrete and Computational Geometry","author":"S Felsner","year":"2017","unstructured":"Felsner, S., Goodman, J.E.: Pseudoline arrangements. In: T\u00f3th, C.D., O\u2019Rourke, J., Goodman, J.E. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn., pp. 125\u2013157. CRC Press, Boca Raton. (2017)","edition":"3"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Arrangements and spreads. AMS (1972)","DOI":"10.1090\/cbms\/010"},{"issue":"4","key":"26_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00453-004-1128-8","volume":"41","author":"C Gutwenger","year":"2005","unstructured":"Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. Algorithmica 41(4), 289\u2013308 (2005). https:\/\/doi.org\/10.1007\/s00453-004-1128-8","journal-title":"Algorithmica"},{"issue":"1","key":"26_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.7155\/jgaa.00460","volume":"22","author":"P Hajnal","year":"2018","unstructured":"Hajnal, P., Igamberdiev, A., Rote, G., Schulz, A.: Saturated simple and 2-simple topological graphs with few edges. J. Graph Algorithms Appl. 22(1), 117\u2013138 (2018). https:\/\/doi.org\/10.7155\/jgaa.00460","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"26_CR17","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.comgeo.2012.07.005","volume":"46","author":"V Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Kratochv\u00edl, J., Rutter, I.: A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. Theory Appl. 46(4), 466\u2013492 (2013). https:\/\/doi.org\/10.1016\/j.comgeo.2012.07.005. Special Issue on the 27th Annual Symposium on Computational Geometry (SoCG\u201911)","journal-title":"Comput. Geom. Theory Appl."},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-642-33090-2_58","volume-title":"Algorithms \u2013 ESA 2012","author":"P Klav\u00edk","year":"2012","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Krawczyk, T., Walczak, B.: Extending partial representations of function graphs and permutation graphs. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 671\u2013682. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_58"},{"key":"26_CR19","doi-asserted-by":"publisher","unstructured":"Klav\u00edk, P., et al.: Extending partial representations of proper and unit interval graphs. Algorithmica 77(4), 1071\u20131104 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0133-z","DOI":"10.1007\/s00453-016-0133-z"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2015.02.007","volume":"576","author":"P Klav\u00edk","year":"2015","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Otachi, Y., Saitoh, T.: Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. 576, 85\u2013101 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.02.007","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"26_CR21","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1007\/s00453-016-0186-z","volume":"78","author":"P Klav\u00edk","year":"2016","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Otachi, Y., Saitoh, T., Vysko\u010dil, T.: Extending partial representations of interval graphs. Algorithmica 78(3), 945\u2013967 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0186-z","journal-title":"Algorithmica"},{"issue":"4","key":"26_CR22","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.comgeo.2014.10.008","volume":"48","author":"J Kyn\u010dl","year":"2015","unstructured":"Kyn\u010dl, J., Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: Saturated simple and $$k$$-simple topological graphs. Comput. Geom. Theory Appl. 48(4), 295\u2013310 (2015). https:\/\/doi.org\/10.1016\/j.comgeo.2014.10.008","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"26_CR23","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00454-013-9535-8","volume":"50","author":"J Kyn\u010dl","year":"2013","unstructured":"Kyn\u010dl, J.: Improved enumeration of simple topological graphs. Discrete Comput. Geom. 50(3), 727\u2013770 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9535-8","journal-title":"Discrete Comput. Geom."},{"key":"26_CR24","first-page":"256","volume":"78","author":"F Levi","year":"1926","unstructured":"Levi, F.: Die Teilung der projektiven Ebene durch Gerade oder Pseudogerade. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig, Mathematisch-Physische Klasse 78, 256\u2013267 (1926). (in German)","journal-title":"Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig, Mathematisch-Physische Klasse"},{"issue":"1","key":"26_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-015-0018-6","volume":"76","author":"T Mchedlidze","year":"2015","unstructured":"Mchedlidze, T., N\u00f6llenburg, M., Rutter, I.: Extending convex partial drawings of graphs. Algorithmica 76(1), 47\u201367 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0018-6","journal-title":"Algorithmica"},{"key":"26_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29929-7","volume-title":"Research Problems in Discrete Geometry","author":"J Pach","year":"2005","unstructured":"Pach, J., Brass, P., Moser, W.O.J.: Research Problems in Discrete Geometry. Springer, New York (2005). https:\/\/doi.org\/10.1007\/0-387-29929-7"},{"issue":"5","key":"26_CR27","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1142\/S0129054106004261","volume":"17","author":"M Patrignani","year":"2006","unstructured":"Patrignani, M.: On extending a partial straight-line drawing. Int. J. Found. Comput. Sci. 17(5), 1061\u20131070 (2006). https:\/\/doi.org\/10.1142\/S0129054106004261","journal-title":"Int. J. Found. Comput. Sci."},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-030-04414-5_29","volume-title":"Graph Drawing and Network Visualization","author":"M Radermacher","year":"2018","unstructured":"Radermacher, M., Rutter, I.: Inserting an edge into a geometric embedding. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 402\u2013415. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_29"},{"issue":"4","key":"26_CR29","first-page":"405","volume":"31","author":"A Riskin","year":"1996","unstructured":"Riskin, A.: The crossing number of a cubic plane polyhedral map plus an edge. Studia Scientiarum Mathematicarum Hungarica 31(4), 405\u2013414 (1996)","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"key":"26_CR30","doi-asserted-by":"publisher","DOI":"10.1201\/9781315152394","volume-title":"Crossing Numbers of Graphs","author":"M Schaefer","year":"2018","unstructured":"Schaefer, M.: Crossing Numbers of Graphs. CRC Press, Boca Raton (2018)"},{"key":"26_CR31","unstructured":"Schaefer, M.: A proof of Levi\u2019s extension lemma. ArXiv e-Prints (2019)"},{"key":"26_CR32","doi-asserted-by":"publisher","unstructured":"Snoeyink, J., Hershberger, J.: Sweeping arrangements of curves. In: Discrete and Computational Geometry: Papers from the DIMACS Special Year, vol. 6, pp. 309\u2013350. DIMACS\/AMS (1991). https:\/\/doi.org\/10.1090\/dimacs\/006\/21","DOI":"10.1090\/dimacs\/006\/21"},{"issue":"1","key":"26_CR33","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02573961","volume":"10","author":"B Sturmfels","year":"1993","unstructured":"Sturmfels, B., Ziegler, G.M.: Extension spaces of oriented matroids. Discrete Comput. Geom. 10(1), 23\u201345 (1993). https:\/\/doi.org\/10.1007\/BF02573961","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60440-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:02:12Z","timestamp":1710266532000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_26","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":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","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":"94","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":"32","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":"34% - 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.7","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":"2.1","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)"}}]}}