{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:26:51Z","timestamp":1743006411652,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031433795"},{"type":"electronic","value":"9783031433801"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43380-1_7","type":"book-chapter","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T20:29:12Z","timestamp":1695414552000},"page":"86-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Nonplanar Graph Drawings with k Vertices per\u00a0Face"],"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-0003-4224-1550","authenticated-orcid":false,"given":"Giuseppe","family":"Di Battista","sequence":"additional","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-0003-1698-3868","authenticated-orcid":false,"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-3538","authenticated-orcid":false,"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0471-4118","authenticated-orcid":false,"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9192-2067","authenticated-orcid":false,"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,23]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00454-009-9143-9","volume":"41","author":"E Ackerman","year":"2009","unstructured":"Ackerman, E.: On the maximum number of edges in topological graphs with no four pairwise crossing edges. Discret. Comput. Geom. 41(3), 365\u2013375 (2009). https:\/\/doi.org\/10.1007\/s00454-009-9143-9","journal-title":"Discret. Comput. Geom."},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Ackerman, E.: On topological graphs with at most four crossings per edge. Comput. Geom. 85 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2019.101574","DOI":"10.1016\/j.comgeo.2019.101574"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-18469-7_1","volume-title":"Graph Drawing","author":"E Ackerman","year":"2011","unstructured":"Ackerman, E., Fulek, R., T\u00f3th, C.D.: On the size of graphs that admit polyline drawings with few bends and crossing angles. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 1\u201312. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18469-7_1"},{"issue":"3","key":"7_CR4","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. Theory Ser. A 114(3), 563\u2013571 (2007). https:\/\/doi.org\/10.1016\/j.jcta.2006.08.002","journal-title":"J. Comb. Theory Ser. A"},{"issue":"24","key":"7_CR5","doi-asserted-by":"publisher","first-page":"3636","DOI":"10.1016\/j.disc.2012.08.019","volume":"312","author":"P Ali","year":"2012","unstructured":"Ali, P., Dankelmann, P., Mukwembi, S.: The radius of $$k$$-connected planar graphs with bounded faces. Discret. Math. 312(24), 3636\u20133642 (2012). https:\/\/doi.org\/10.1016\/j.disc.2012.08.019","journal-title":"Discret. Math."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF02187731","volume":"4","author":"N Alon","year":"1989","unstructured":"Alon, N., Erd\u0151s, P.: Disjoint edges in geometric graphs. Discret. Comput. Geom. 4, 287\u2013290 (1989). https:\/\/doi.org\/10.1007\/BF02187731","journal-title":"Discret. Comput. Geom."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2019.08.006","volume":"142","author":"P Angelini","year":"2020","unstructured":"Angelini, P., et al.: Simple k-planar graphs are simple (k+1)-quasiplanar. J. Comb. Theory Ser. B 142, 1\u201335 (2020). https:\/\/doi.org\/10.1016\/j.jctb.2019.08.006","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"7_CR8","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). https:\/\/doi.org\/10.1007\/s00453-015-0002-1","journal-title":"Algorithmica"},{"key":"7_CR9","first-page":"2","volume":"3","author":"S Avital","year":"1966","unstructured":"Avital, S., Hanani, H.: Graphs. Gilyonot Lematematika 3, 2\u20138 (1966)","journal-title":"Gilyonot Lematematika"},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00453-016-0200-5","volume":"79","author":"MA Bekos","year":"2017","unstructured":"Bekos, M.A., Cornelsen, S., Grilli, L., Hong, S., Kaufmann, M.: On the recognition of fan-planar and maximal outer-fan-planar graphs. Algorithmica 79(2), 401\u2013427 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0200-5","journal-title":"Algorithmica"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On optimal 2- and 3-planar graphs. In: SoCG. LIPIcs, vol. 77, pp. 16:1\u201316:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.16","DOI":"10.4230\/LIPIcs.SoCG.2017.16"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.7155\/jgaa.00398","volume":"21","author":"C Binucci","year":"2017","unstructured":"Binucci, C., et al.: Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus. J. Graph Algorithms Appl. 21(1), 81\u2013102 (2017). https:\/\/doi.org\/10.7155\/jgaa.00398","journal-title":"J. Graph Algorithms Appl."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2015.04.020","volume":"589","author":"C Binucci","year":"2015","unstructured":"Binucci, C., et al.: Fan-planarity: properties and complexity. Theor. Comput. Sci. 589, 76\u201386 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.04.020","journal-title":"Theor. Comput. Sci."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/mana.3211170125","volume":"117","author":"R Bodendiek","year":"1984","unstructured":"Bodendiek, R., Schumacher, H., Wagner, K.: \u00dcber 1-optimale graphen. Math. Nachr. 117, 323\u2013339 (1984)","journal-title":"Math. Nachr."},{"key":"7_CR15","volume-title":"Extremal Graph Theory","author":"B Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Academic Press, New York (1978)"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(03)00027-0","volume":"26","author":"P Bose","year":"2003","unstructured":"Bose, P., Kirkpatrick, D.G., Li, Z.: Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. Comput. Geom. 26(3), 209\u2013219 (2003). https:\/\/doi.org\/10.1016\/S0925-7721(03)00027-0","journal-title":"Comput. Geom."},{"key":"7_CR17","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Hoboken (1999)"},{"issue":"3","key":"7_CR18","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00224-010-9275-6","volume":"49","author":"E Di Giacomo","year":"2011","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing resolution of non-planar graph drawings. Theory Comput. Syst. 49(3), 565\u2013575 (2011). https:\/\/doi.org\/10.1007\/s00224-010-9275-6","journal-title":"Theory Comput. Syst."},{"issue":"7","key":"7_CR19","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.ipl.2013.01.013","volume":"113","author":"W Didimo","year":"2013","unstructured":"Didimo, W.: Density of straight-line 1-planar graph drawings. Inf. Process. Lett. 113(7), 236\u2013240 (2013). https:\/\/doi.org\/10.1016\/j.ipl.2013.01.013","journal-title":"Inf. Process. Lett."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-981-15-6533-5_9","volume-title":"Beyond Planar Graphs","author":"W Didimo","year":"2020","unstructured":"Didimo, W.: Right angle crossing drawings of graphs. In: Hong, S.-H., Tokuyama, T. (eds.) Beyond Planar Graphs, pp. 149\u2013169. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5_9"},{"issue":"39","key":"7_CR21","doi-asserted-by":"publisher","first-page":"5156","DOI":"10.1016\/j.tcs.2011.05.025","volume":"412","author":"W Didimo","year":"2011","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39), 5156\u20135166 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.025","journal-title":"Theor. Comput. Sci."},{"key":"7_CR22","doi-asserted-by":"publisher","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","DOI":"10.1145\/3301281"},{"issue":"3","key":"7_CR23","first-page":"401","volume":"80","author":"B Du Preez","year":"2021","unstructured":"Du Preez, B.: Plane graphs with large faces and small diameter. Australas. J. Comb. 80(3), 401\u2013418 (2021)","journal-title":"Australas. J. Comb."},{"key":"7_CR24","unstructured":"Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. Chicago J. Theor. Comput. Sci. 2011 (2011)"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-981-15-6533-5_1","volume-title":"Beyond Planar Graphs","author":"S-H Hong","year":"2020","unstructured":"Hong, S.-H.: Beyond planar graphs: introduction. In: Hong, S.-H., Tokuyama, T. (eds.) Beyond Planar Graphs, pp. 1\u20139. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5_1"},{"issue":"4","key":"7_CR26","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). https:\/\/doi.org\/10.1007\/s00453-014-9890-8","journal-title":"Algorithmica"},{"issue":"11","key":"7_CR27","doi-asserted-by":"publisher","first-page":"35","DOI":"10.4230\/DagRep.6.11.35","volume":"6","author":"S Hong","year":"2016","unstructured":"Hong, S., Kaufmann, M., Kobourov, S.G., Pach, J.: Beyond-planar graphs: algorithmics and combinatorics (Dagstuhl Seminar 16452). Dagstuhl Rep. 6(11), 35\u201362 (2016). https:\/\/doi.org\/10.4230\/DagRep.6.11.35","journal-title":"Dagstuhl Rep."},{"key":"7_CR28","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). https:\/\/doi.org\/10.1016\/j.cosrev.2017.06.002","journal-title":"Comput. Sci. Rev."},{"key":"7_CR29","unstructured":"Kupitz, Y.S.: Extremal problems in combinatorial geometry. Lecture notes series, Matematisk institut, Aarhus universitet (1979)"},{"issue":"2","key":"7_CR30","doi-asserted-by":"publisher","first-page":"2","DOI":"10.37236\/8255","volume":"26","author":"Y Lan","year":"2019","unstructured":"Lan, Y., Shi, Y., Song, Z.: Extremal $$h$$-free planar graphs. Electron. J. Comb. 26(2), 2 (2019). https:\/\/doi.org\/10.37236\/8255","journal-title":"Electron. J. Comb."},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Pach, J.: Geometric graph theory. In: Handbook of Discrete and Computational Geometry, 2nd edn., pp. 219\u2013238. Chapman and Hall\/CRC (2004). https:\/\/doi.org\/10.1201\/9781420035315.ch10","DOI":"10.1201\/9781420035315.ch10"},{"issue":"4","key":"7_CR32","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00454-006-1264-9","volume":"36","author":"J Pach","year":"2006","unstructured":"Pach, J., Radoicic, R., Tardos, G., T\u00f3th, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Discret. Computat. Geom. 36(4), 527\u2013552 (2006). https:\/\/doi.org\/10.1007\/s00454-006-1264-9","journal-title":"Discret. Computat. Geom."},{"key":"7_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02574361","volume":"12","author":"J Pach","year":"1994","unstructured":"Pach, J., T\u00f6r\u00f6csik, J.: Some geometric applications of Dilworth\u2019s theorem. Discret. Comput. Geom. 12, 1\u20137 (1994). https:\/\/doi.org\/10.1007\/BF02574361","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"7_CR34","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). https:\/\/doi.org\/10.1007\/BF01215922","journal-title":"Combinatorica"},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.comgeo.2015.06.001","volume":"50","author":"A Suk","year":"2015","unstructured":"Suk, A., Walczak, B.: New bounds on the maximum number of edges in $$k$$-quasi-planar graphs. Comput. Geom. 50, 24\u201333 (2015). https:\/\/doi.org\/10.1016\/j.comgeo.2015.06.001","journal-title":"Comput. Geom."},{"key":"7_CR36","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-981-15-6533-5_4","volume-title":"Beyond Planar Graphs","author":"Y Suzuki","year":"2020","unstructured":"Suzuki, Y.: 1-planar graphs. In: Hong, S.-H., Tokuyama, T. (eds.) Beyond Planar Graphs, pp. 47\u201368. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5_4"}],"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-031-43380-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T20:29:56Z","timestamp":1695414596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43380-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031433795","9783031433801"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43380-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 September 2023","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":"Fribourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.unifr.ch\/wg2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}