{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:14:00Z","timestamp":1764364440906,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_18","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"230-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Extending Simple Drawings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2401-8670","authenticated-orcid":false,"given":"Alan","family":"Arroyo","sequence":"first","affiliation":[]},{"given":"Martin","family":"Derka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3147-0083","authenticated-orcid":false,"given":"Irene","family":"Parada","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237(1), 123\u2013134 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(98)00158-3","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Angelini, P., Di Battista, G., Frati, F., Jel\u00ednek, V., Kratochv\u00edl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4), 32 (2015). https:\/\/doi.org\/10.1145\/2629341","DOI":"10.1145\/2629341"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Arroyo, A., Derka, M., Parada, I.: Extending simple drawings. ArXiv e-Prints (2019). http:\/\/arxiv.org\/abs\/1908.08129","DOI":"10.1007\/978-3-030-35802-0_18"},{"issue":"12\u201313","key":"18_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."},{"issue":"03","key":"18_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M de Berg","year":"2010","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions in the plane. Int. J. Comput. Geom. Appl. 22(03), 187\u2013205 (2010). https:\/\/doi.org\/10.1142\/S0218195912500045","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Br\u00fcckner, G., Rutter, I.: Partial and constrained level planarity. In: Klein, P.N. (ed.) Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pp. 2000\u20132011 (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.130","DOI":"10.1137\/1.9781611974782.130"},{"issue":"5","key":"18_CR7","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."},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.20382\/jocg.v9i1a7","volume":"9","author":"J Cardinal","year":"2018","unstructured":"Cardinal, J., Felsner, S.: Topological drawings of complete bipartite graphs. J. Comput. Geom. 9(1), 213\u2013246 (2018). https:\/\/doi.org\/10.20382\/jocg.v9i1a7","journal-title":"J. Comput. Geom."},{"key":"18_CR9","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"},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"KP Eswaran","year":"1976","unstructured":"Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5(4), 653\u2013665 (1976)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"18_CR11","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":"18_CR12","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":"18_CR13","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","journal-title":"Comput. Geom.: Theory Appl."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-319-27261-0_26","volume-title":"Graph Drawing and Network Visualization","author":"J Kyn\u010dl","year":"2015","unstructured":"Kyn\u010dl, J.: Simple realizability of complete abstract topological graphs simplified. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 309\u2013320. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_26"},{"issue":"3","key":"18_CR15","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. Discret. Comput. Geom. 50(3), 727\u2013770 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9535-8","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"18_CR16","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. 48(4), 295\u2013310 (2015). https:\/\/doi.org\/10.1016\/j.comgeo.2014.10.008","journal-title":"Comput. Geom."},{"issue":"1","key":"18_CR17","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"},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00454-003-0012-9","volume":"30","author":"J Pach","year":"2003","unstructured":"Pach, J., Solymosi, J., T\u00f3th, G.: Unavoidable configurations in complete topological graphs. Discret. Comput. Geom. 30(2), 311\u2013320 (2003). https:\/\/doi.org\/10.1007\/s00454-003-0012-9","journal-title":"Discret. Comput. Geom."},{"issue":"5","key":"18_CR19","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."},{"issue":"4","key":"18_CR20","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"}],"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-35802-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:04:16Z","timestamp":1701133456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","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":"113","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":"34","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":"8","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":"30% - 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.11","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":"12.55","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}