{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:38:10Z","timestamp":1766378290098,"version":"3.48.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030929305"},{"type":"electronic","value":"9783030929312"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92931-2_1","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Edge-Minimum Saturated k-Planar Drawings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3501-4608","authenticated-orcid":false,"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7791-3604","authenticated-orcid":false,"given":"Fabian","family":"Klute","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3147-0083","authenticated-orcid":false,"given":"Irene","family":"Parada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6769-7098","authenticated-orcid":false,"given":"Jonathan","family":"Rollin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0645-9715","authenticated-orcid":false,"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"101574","DOI":"10.1016\/j.comgeo.2019.101574","volume":"85","author":"E Ackerman","year":"2019","unstructured":"Ackerman, E.: On topological graphs with at most four crossings per edge. Comput. Geom. 85, 101574 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2019.101574","journal-title":"Comput. Geom."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-642-36763-2_50","volume-title":"Graph Drawing","author":"C Auer","year":"2013","unstructured":"Auer, C., Brandenburg, F.J., Glei\u00dfner, A., Hanauer, K.: On sparse maximal 2-planar graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 555\u2013556. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_50"},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s00454-014-9644-z","volume":"53","author":"M Balko","year":"2014","unstructured":"Balko, M., Fulek, R., Kyn\u010dl, J.: Crossing numbers and combinatorial characterization of monotone drawings of $$K_n$$. Discrete Comput. Geom. 53(1), 107\u2013143 (2014). https:\/\/doi.org\/10.1007\/s00454-014-9644-z","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/jgt.22187","volume":"88","author":"J Bar\u00e1t","year":"2018","unstructured":"Bar\u00e1t, J., T\u00f3th, G.: Improvements on the density of maximal 1-planar graphs. J. Graph Theor. 88(1), 101\u2013109 (2018). https:\/\/doi.org\/10.1002\/jgt.22187","journal-title":"J. Graph Theor."},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On optimal 2- and 3-planar graphs. In: Proceedings 33rd International Symposium on Computational Geometry (SoCG), pp. 16:1\u201316:16. LIPIcs 77, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.16","DOI":"10.4230\/LIPIcs.SoCG.2017.16"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-36763-2_29","volume-title":"Graph Drawing","author":"FJ Brandenburg","year":"2013","unstructured":"Brandenburg, F.J., Eppstein, D., Glei\u00dfner, A., Goodrich, M.T., Hanauer, K., Reislhuber, J.: On the density of maximal 1-planar graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 327\u2013338. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_29"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Klute, F., Parada, I., Rollin, J., Ueckerdt, T.: Edge-minimum saturated $$k$$-planar drawings. ArXiv e-Prints abs\/2012.08631v3 (2020)","DOI":"10.1007\/978-3-030-92931-2_1"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2013.09.029","volume":"513","author":"P Eades","year":"2013","unstructured":"Eades, P., Hong, S., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci. 513, 65\u201376 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.09.029","journal-title":"Theor. Comput. Sci."},{"issue":"10","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.2307\/2311408","volume":"71","author":"P Erd\u0151s","year":"1964","unstructured":"Erd\u0151s, P., Hajnal, A., Moon, J.W.: A problem in graph theory. Am. Math. Mon. 71(10), 1107\u20131110 (1964). https:\/\/doi.org\/10.2307\/2311408","journal-title":"Am. Math. Mon."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Currie, B.L., Faudree, J.R., Faudree, R.J., Schmitt, J.R.: A survey of minimum saturated graphs. Electron. J. Comb., DS19 (2011). https:\/\/doi.org\/10.37236\/41","DOI":"10.37236\/41"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-030-68766-3_30","volume-title":"Graph Drawing and Network Visualization","author":"S Felsner","year":"2020","unstructured":"Felsner, S., Hoffmann, M., Knorr, K., Parada, I.: On the maximum number of crossings in star-simple drawings of $$K_n$$ with no empty lens. In: GD 2020. LNCS, vol. 12590, pp. 382\u2013389. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_30"},{"issue":"1","key":"1_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":"11","key":"1_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.4230\/DagRep.6.11.35","volume":"6","author":"SH Hong","year":"2017","unstructured":"Hong, S.H., Kaufmann, M., Kobourov, S.G., Pach, J.: Beyond-planar graphs: algorithmics and combinatorics (Dagstuhl seminar 16452). Dagstuhl Rep. 6(11), 35\u201362 (2017). https:\/\/doi.org\/10.4230\/DagRep.6.11.35","journal-title":"Dagstuhl Rep."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1017\/CBO9781139004114.004","volume":"392","author":"P Keevash","year":"2011","unstructured":"Keevash, P.: Hypergraph Tur\u00e1n problems. Surv. Comb. 392, 83\u2013140 (2011). https:\/\/doi.org\/10.1017\/CBO9781139004114.004","journal-title":"Surv. Comb."},{"issue":"4","key":"1_CR15","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)","journal-title":"Comput. Geom."},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Pach, J., Radoi\u010di\u0107, R., Tardos, G., T\u00f3th, G.: Improving the Crossing Lemma by finding more crossings in sparse graphs. Discrete Comput. Geom. 36(4), 527\u2013552 (2006). https:\/\/doi.org\/10.1007\/s00454-006-1264-9","DOI":"10.1007\/s00454-006-1264-9"},{"issue":"3","key":"1_CR17","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":"1_CR18","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Comb. DS21 (2013). https:\/\/doi.org\/10.37236\/2713, version 6, May 21, 2021","DOI":"10.37236\/2713"},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01929486","volume":"11","author":"A Sidorenko","year":"1995","unstructured":"Sidorenko, A.: What we know and what we do not know about Tur\u00e1n numbers. Graphs Comb. 11(2), 179\u2013199 (1995). https:\/\/doi.org\/10.1007\/BF01929486","journal-title":"Graphs Comb."},{"key":"1_CR20","unstructured":"Tur\u00e1n, P.: Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 436\u2013452 (1941). in Hungarian, German summary"}],"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-92931-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:50Z","timestamp":1766365310000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 December 2021","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo.inf.uni-tuebingen.de\/gd2021\/","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":"74","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":"23","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":"5","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":"31% - 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.02","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":"8.6","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"}]}}