{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:01:21Z","timestamp":1743058881753,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_20","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"271-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees"],"prefix":"10.1007","author":[{"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[]},{"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[]},{"given":"Emilio","family":"Di Giacomo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/s00454-018-0009-x","volume":"60","author":"P Angelini","year":"2018","unstructured":"Angelini, P., et al.: Small universal point sets for k-outerplanar graphs. Discrete Comput. Geometry 60(2), 430\u2013470 (2018). https:\/\/doi.org\/10.1007\/s00454-018-0009-x","journal-title":"Discrete Comput. Geometry"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-25878-7_8","volume-title":"Graph Drawing","author":"P Angelini","year":"2011","unstructured":"Angelini, P., Di Battista, G., Kaufmann, M., Mchedlidze, T., Roselli, V., Squarcella, C.: Small point sets for simply-nested planar graphs. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 75\u201385. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25878-7_8"},{"issue":"1","key":"20_CR3","first-page":"1","volume":"13","author":"J Bar\u00e1t","year":"2006","unstructured":"Bar\u00e1t, J., Matousek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electr. J. Comb. 13(1), 1\u201314 (2006)","journal-title":"Electr. J. Comb."},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/s00453-016-0203-2","volume":"79","author":"MA Bekos","year":"2016","unstructured":"Bekos, M.A., Bruckdorfer, T., Kaufmann, M., Raftopoulou, C.N.: The book thickness of 1-planar graphs is constant. Algorithmica 79(2), 444\u2013465 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0203-2","journal-title":"Algorithmica"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Da Lozzo, G., Griesbach, S., Gronemann, M., Montecchiani, F., Raftopoulou, C.N.: Book embeddings of nonplanar graphs with small faces in few pages. In: Cabello, S., Chen, D.Z. (eds.) 36th International Symposium on Computational Geometry, SoCG 2020. LIPIcs, vol. 164, pp. 16:1\u201316:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2020.16","DOI":"10.4230\/LIPIcs.SoCG.2020.16"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1137\/110832033","volume":"42","author":"H Chang","year":"2013","unstructured":"Chang, H., Lu, H.: Computing the girth of a planar graph in linear time. SIAM J. Comput. 42(3), 1077\u20131094 (2013). https:\/\/doi.org\/10.1137\/110832033","journal-title":"SIAM J. Comput."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Da Lozzo, G., Di Giacomo, E., Liotta, G., Montecchiani, F.: Planar drawings with few slopes of halin graphs and nested pseudotrees. CoRR abs\/2105.08124 (2021). https:\/\/arxiv.org\/abs\/2105.08124","DOI":"10.1007\/978-3-030-83508-8_20"},{"issue":"5","key":"20_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(90)90053-Z","volume":"35","author":"RJ Cimikowski","year":"1990","unstructured":"Cimikowski, R.J.: Finding hamiltonian cycles in certain planar graphs. Inf. Process. Lett. 35(5), 249\u2013254 (1990). https:\/\/doi.org\/10.1016\/0020-0190(90)90053-Z","journal-title":"Inf. Process. Lett."},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"Da Lozzo, G., Devanny, W.E., Eppstein, D., Johnson, T.: Square-contact representations of partial 2-trees and triconnected simply-nested graphs. In: Okamoto, Y., Tokuyama, T. (eds.) ISAAC 2017. LIPIcs, vol. 92, pp. 24:1\u201324:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2017.24","DOI":"10.4230\/LIPIcs.ISAAC.2017.24"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-00256-5_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G Da Lozzo","year":"2018","unstructured":"Da Lozzo, G., Eppstein, D., Goodrich, M.T., Gupta, S.: Subexponential-time and FPT algorithms for embedded flat clustered planarity. In: Brandst\u00e4dt, A., K\u00f6hler, E., Meer, K. (eds.) WG 2018. LNCS, vol. 11159, pp. 111\u2013124. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00256-5_10"},{"issue":"3","key":"20_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.7155\/jgaa.00114","volume":"9","author":"E Di Giacomo","year":"2005","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Computing radial drawings on the minimum number of circles. J. Graph Algorithms Appl. 9(3), 365\u2013389 (2005). https:\/\/doi.org\/10.7155\/jgaa.00114","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"707","DOI":"10.7155\/jgaa.00376","volume":"19","author":"E Di Giacomo","year":"2015","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: Drawing outer 1-planar graphs with few slopes. J. Graph Algorithms Appl. 19(2), 707\u2013741 (2015)","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2017.12.004","volume":"714","author":"E Di Giacomo","year":"2018","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: Drawing subcubic planar graphs with four slopes and optimal angular resolution. Theor. Comput. Sci. 714, 51\u201373 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2017.12.004","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"20_CR14","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. 38(3), 194\u2013212 (2007). https:\/\/doi.org\/10.1016\/j.comgeo.2006.09.002","journal-title":"Comput. Geom."},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.7155\/jgaa.00454","volume":"22","author":"V Dujmovic","year":"2018","unstructured":"Dujmovic, V., Frati, F.: Stack and queue layouts via layered separators. J. Graph Algorithms Appl. 22(1), 89\u201399 (2018). https:\/\/doi.org\/10.7155\/jgaa.00454","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR16","unstructured":"Halin, R.: Studies on minimally $$n$$-connected graphs. In: Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), pp. 129\u2013136. Academic Press, London (1971)"},{"issue":"4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1007\/s00373-012-1157-z","volume":"29","author":"V Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Jel\u00ednkov\u00e1, E., Kratochv\u00edl, J., Lidick\u00fd, B., Tesar, M., Vyskocil, T.: The planar slope number of planar partial 3-trees of bounded degree. Graphs Comb. 29(4), 981\u20131005 (2013)","journal-title":"Graphs Comb."},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/100815001","volume":"27","author":"B Keszegh","year":"2013","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D.: Drawing planar graphs of bounded degree with few slopes. SIAM J. Discrete Math. 27(2), 1171\u20131183 (2013)","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"20_CR19","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.comgeo.2014.01.003","volume":"47","author":"KB Knauer","year":"2014","unstructured":"Knauer, K.B., Micek, P., Walczak, B.: Outerplanar graph drawings with few slopes. Comput. Geom. 47(5), 614\u2013624 (2014)","journal-title":"Comput. Geom."},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-319-03841-4_36","volume-title":"Graph Drawing","author":"W Lenhart","year":"2013","unstructured":"Lenhart, W., Liotta, G., Mondal, D., Nishat, R.I.: Planar and plane slope number of partial 2-trees. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 412\u2013423. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_36"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Pach, J., P\u00e1lv\u00f6lgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electr. J. Comb. 13(1) (2006)","DOI":"10.37236\/1139"},{"issue":"2","key":"20_CR22","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1093\/comjnl\/37.2.139","volume":"37","author":"GA Wade","year":"1994","unstructured":"Wade, G.A., Chu, J.H.: Drawability of complete graphs using a minimal slope set. Comput. J. 37(2), 139\u2013142 (1994)","journal-title":"Comput. J."},{"issue":"1","key":"20_CR23","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci. 38(1), 36\u201367 (1989). https:\/\/doi.org\/10.1016\/0022-0000(89)90032-9","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:27:05Z","timestamp":1645183625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_20","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":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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":"0","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":"38% - 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.1","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":"13","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)"}}]}}