{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:52:08Z","timestamp":1743141128034,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"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_21","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"268-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The QuaSEFE Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7602-1524","authenticated-orcid":false,"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1441-4189","authenticated-orcid":false,"given":"Henry","family":"F\u00f6rster","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5307-7106","authenticated-orcid":false,"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-3538","authenticated-orcid":false,"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0477-2724","authenticated-orcid":false,"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.dam.2014.05.025","volume":"175","author":"E Ackerman","year":"2014","unstructured":"Ackerman, E.: A note on 1-planar graphs. Discret. Appl. Math. 175, 104\u2013108 (2014). https:\/\/doi.org\/10.1016\/j.dam.2014.05.025","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.jcta.2006.08.002","volume":"114","author":"E Ackerman","year":"2007","unstructured":"Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Comb. Theor. Ser. A 114(3), 563\u2013571 (2007). https:\/\/doi.org\/10.1016\/j.jcta.2006.08.002","journal-title":"J. Comb. Theor. Ser. A"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"PK Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17(1), 1\u20139 (1997). https:\/\/doi.org\/10.1007\/BF01196127","journal-title":"Combinatorica"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2014.11.016","volume":"575","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Neuwirth, D.: Advancements on SEFE and partitioned book embedding problems. Theor. Comput. Sci. 575, 71\u201389 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.11.016","journal-title":"Theor. Comput. Sci."},{"key":"21_CR5","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:1\u201332:42 (2015). https:\/\/doi.org\/10.1145\/2629341","DOI":"10.1145\/2629341"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.7155\/jgaa.00250","volume":"16","author":"P Angelini","year":"2012","unstructured":"Angelini, P., Geyer, M., Kaufmann, M., Neuwirth, D.: On a tree and a path with no geometric simultaneous embedding. J. Graph Algorithms Appl. 16(1), 37\u201383 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.7155\/jgaa.00282","volume":"17","author":"EN Argyriou","year":"2013","unstructured":"Argyriou, E.N., Bekos, M.A., Kaufmann, M., Symvonis, A.: Geometric RAC simultaneous drawings of graphs. J. Graph Algorithms Appl. 17(1), 11\u201334 (2013). https:\/\/doi.org\/10.7155\/jgaa.00282","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.7155\/jgaa.00388","volume":"20","author":"MA Bekos","year":"2016","unstructured":"Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous drawing of planar graphs with right-angle crossings and few bends. J. Graph Algorithms Appl. 20(1), 133\u2013158 (2016). https:\/\/doi.org\/10.7155\/jgaa.00388","journal-title":"J. Graph Algorithms Appl."},{"key":"21_CR9","first-page":"349","volume-title":"Handbook on Graph Drawing and Visualization","author":"T Bl\u00e4sius","year":"2013","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 349\u2013381. Chapman and Hall\/CRC, London (2013)"},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/2738054","volume":"12","author":"T Bl\u00e4sius","year":"2016","unstructured":"Bl\u00e4sius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. ACM Trans. Algorithms 12(2), 16:1\u201316:46 (2016). https:\/\/doi.org\/10.1145\/2738054","journal-title":"ACM Trans. Algorithms"},{"key":"21_CR11","unstructured":"Brandenburg, F.J.: A simple quasi-planar drawing of $$K_{10}$$. In: Hu, Y., N\u00f6llenburg, M. (eds.) Graph Drawing. LNCS, vol. 9801, pp. 603\u2013604 (2016)"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P Bra\u00df","year":"2007","unstructured":"Bra\u00df, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom. 36(2), 117\u2013130 (2007). https:\/\/doi.org\/10.1016\/j.comgeo.2006.05.006","journal-title":"Comput. Geom."},{"issue":"11","key":"21_CR13","doi-asserted-by":"publisher","first-page":"3126","DOI":"10.1093\/comjnl\/bxv048","volume":"58","author":"E Di Giacomo","year":"2015","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Wismath, S.K.: Planar and quasi-planar simultaneous geometric embedding. Comput. J. 58(11), 3126\u20133140 (2015). https:\/\/doi.org\/10.1093\/comjnl\/bxv048","journal-title":"Comput. J."},{"issue":"16","key":"21_CR14","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.ipl.2012.05.006","volume":"112","author":"W Didimo","year":"2012","unstructured":"Didimo, W., Kaufmann, M., Liotta, G., Okamoto, Y., Spillner, A.: Vertex angle and crossing angle resolution of leveled tree drawings. Inf. Process. Lett. 112(16), 630\u2013635 (2012). https:\/\/doi.org\/10.1016\/j.ipl.2012.05.006","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"21_CR15","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). https:\/\/doi.org\/10.1145\/3301281","journal-title":"ACM Comput. Surv."},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-77537-9_28","volume-title":"Graph Drawing","author":"A Estrella-Balderrama","year":"2008","unstructured":"Estrella-Balderrama, A., Gassner, E., J\u00fcnger, M., Percan, M., Schaefer, M., Schulz, M.: Simultaneous geometric graph embeddings. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 280\u2013290. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77537-9_28"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2016.06.045","volume":"645","author":"WS Evans","year":"2016","unstructured":"Evans, W.S., Liotta, G., Montecchiani, F.: Simultaneous visibility representations of plane st-graphs using L-shapes. Theor. Comput. Sci. 645, 100\u2013111 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.06.045","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/110858586","volume":"27","author":"J Fox","year":"2013","unstructured":"Fox, J., Pach, J., Suk, A.: The number of edges in k-quasi-planar graphs. SIDMA 27(1), 550\u2013561 (2013). https:\/\/doi.org\/10.1137\/110858586","journal-title":"SIDMA"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-70904-6_12","volume-title":"Graph Drawing","author":"F Frati","year":"2007","unstructured":"Frati, F.: Embedding graphs simultaneously with fixed edges. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 108\u2013113. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_12"},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"101","DOI":"10.7155\/jgaa.00456","volume":"22","author":"L Grilli","year":"2018","unstructured":"Grilli, L.: On the NP-hardness of GRacSim drawing and k-SEFE problems. J. Graph Algorithms Appl. 22(1), 101\u2013116 (2018). https:\/\/doi.org\/10.7155\/jgaa.00456","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"21_CR21","doi-asserted-by":"publisher","first-page":"147","DOI":"10.7155\/jgaa.00289","volume":"17","author":"B Haeupler","year":"2013","unstructured":"Haeupler, B., Jampani, K.R., Lubiw, A.: Testing simultaneous planarity when the common graph is 2-connected. J. Graph Algorithms Appl. 17(3), 147\u2013171 (2013). https:\/\/doi.org\/10.7155\/jgaa.00289","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"21_CR22","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"JE Hopcroft","year":"1974","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974). https:\/\/doi.org\/10.1145\/321850.321852","journal-title":"J. ACM"},{"issue":"4","key":"21_CR23","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs Comb. 17(4), 717\u2013728 (2001). https:\/\/doi.org\/10.1007\/PL00007258","journal-title":"Graphs Comb."},{"issue":"4","key":"21_CR24","doi-asserted-by":"publisher","first-page":"367","DOI":"10.7155\/jgaa.00298","volume":"17","author":"M Schaefer","year":"2013","unstructured":"Schaefer, M.: Toward a theory of planarity: Hanani-tutte and planarity variants. J. Graph Algorithms Appl. 17(4), 367\u2013440 (2013). https:\/\/doi.org\/10.7155\/jgaa.00298","journal-title":"J. Graph Algorithms Appl."}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:04:18Z","timestamp":1701133458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_21","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"}]}}