{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:21:48Z","timestamp":1742912508142,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"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_31","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"409-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Line and Plane Cover Numbers Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9003-3783","authenticated-orcid":false,"given":"Therese","family":"Biedl","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6150-1998","authenticated-orcid":false,"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"4","key":"31_CR1","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1007\/s00453-018-0487-5","volume":"81","author":"MJ Bannister","year":"2019","unstructured":"Bannister, M.J., Devanny, W.E., Dujmovi\u0107, V., Eppstein, D., Wood, D.R.: Track layouts, layered path decompositions, and leveled planarity. Algorithmica 81(4), 1561\u20131583 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0487-5","journal-title":"Algorithmica"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Biedl, T., Felsner, S., Meijer, H., Wolff, A.: Line and plane cover numbers revisited. Arxiv report (2019). http:\/\/arxiv.org\/abs\/1908.07647","DOI":"10.1007\/978-3-030-35802-0_31"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-319-50106-2_14","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2016","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing graphs on few lines and few planes. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 166\u2013180. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_14. https:\/\/arxiv.org\/abs\/1607.01196"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-62127-2_23","volume-title":"Algorithms and Data Structures","author":"S Chaplick","year":"2017","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The complexity of drawing graphs on few lines and few planes. Algorithms and Data Structures. LNCS, vol. 10389, pp. 265\u2013276. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_23. https:\/\/arxiv.org\/abs\/1607.06444"},{"issue":"3","key":"31_CR5","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.comgeo.2006.09.002","volume":"38","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. Comput. Geom. Theory Appl. 38(3), 194\u2013212 (2007). https:\/\/doi.org\/10.1016\/j.comgeo.2006.09.002","journal-title":"Comput. Geom. Theory Appl."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Dujmovic, V., Joret, G., Micek, P., Morin, P., Ueckerdt, T., Wood, D.R.: Planar graphs have bounded queue-number. Arxiv report (2019). http:\/\/arxiv.org\/abs\/1904.04791","DOI":"10.1109\/FOCS.2019.00056"},{"issue":"2","key":"31_CR7","first-page":"497","volume":"6","author":"V Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., P\u00f3r, A., Wood, D.R.: Track layouts of graphs. Discrete Math. Theor. Comput. Sci. 6(2), 497\u2013522 (2004). https:\/\/hal.inria.fr\/hal-00959023","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"31_CR8","unstructured":"Durocher, S., Mondal, D.: Drawing plane triangulations with few segments. In: Proceedings of 26th Canadian Confernce on Computational Geometry (CCCG 2014), pp. 40\u201345 (2014). http:\/\/cccg.ca\/proceedings\/2014\/papers\/paper06.pdf"},{"key":"31_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/9781108539180","volume-title":"Forbidden Configurations in Discrete Geometry","author":"D Eppstein","year":"2018","unstructured":"Eppstein, D.: Forbidden Configurations in Discrete Geometry. Cambridge University Press, Cambridge (2018)"},{"key":"31_CR10","doi-asserted-by":"publisher","unstructured":"Eppstein, D.: Cubic planar graphs that cannot be drawn on few lines. In: Proceedings of 35th International Symposium on Computational Geometry (SoCG 2019). LIPIcs, vol. 129, pp. 32:1\u201332:15 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2019.32. https:\/\/arxiv.org\/abs\/1903.05256","DOI":"10.4230\/LIPIcs.SoCG.2019.32"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Felsner, S.: 4-connected triangulations on few lines. In: Archambault, D., T\u00f3th, C.D. (eds.) Proceedings of 27th International Symposium on Graph Drawing & Network Visualization (GD 2019). LNCS, vol. 11904, pp. 395\u2013408. Springer (2019). https:\/\/arxiv.org\/abs\/1908.04524","DOI":"10.1007\/978-3-030-35802-0_30"},{"key":"31_CR12","unstructured":"Firman, O., Lipp, F., Straube, L., Wolff, A.: Examining weak line covers with two lines in the plane. In: Biedl, T., Kerren, A. (eds.) Proceedings of International Symposium on Graph Drawing Network Visualization (GD 2018). LNCS, vol. 11282, pp. 643\u2013645 (2018). https:\/\/link.springer.com\/content\/pdf\/bbm:978-3-030-04414-5\/1.pdf (poster)"},{"issue":"5","key":"31_CR13","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/0221055","volume":"21","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput. 21(5), 927\u2013958 (1992). https:\/\/doi.org\/10.1137\/0221055","journal-title":"SIAM J. Comput."},{"issue":"2","key":"31_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.7155\/jgaa.00473","volume":"22","author":"G H\u00fcltenschmidt","year":"2018","unstructured":"H\u00fcltenschmidt, G., Kindermann, P., Meulemans, W., Schulz, A.: Drawing planar graphs with few geometric primitives. J. Graph Alg. Appl. 22(2), 357\u2013387 (2018). https:\/\/doi.org\/10.7155\/jgaa.00473","journal-title":"J. Graph Alg. Appl."},{"issue":"3","key":"31_CR15","doi-asserted-by":"publisher","first-page":"501","DOI":"10.7155\/jgaa.00474","volume":"22","author":"P Kindermann","year":"2018","unstructured":"Kindermann, P., Meulemans, W., Schulz, A.: Experimental analysis of the accessibility of drawings with few segments. J. Graph Alg. Appl. 22(3), 501\u2013518 (2018). https:\/\/doi.org\/10.7155\/jgaa.00474","journal-title":"J. Graph Alg. Appl."},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"393","DOI":"10.7155\/jgaa.00366","volume":"19","author":"A Schulz","year":"2015","unstructured":"Schulz, A.: Drawing graphs with few arcs. J. Graph Alg. Appl. 19(1), 393\u2013412 (2015). https:\/\/doi.org\/10.7155\/jgaa.00366","journal-title":"J. Graph Alg. 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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:05:12Z","timestamp":1701133512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_31","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"}]}}