{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:40Z","timestamp":1759638400316,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030044138"},{"type":"electronic","value":"9783030044145"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04414-5_11","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T13:20:45Z","timestamp":1545052845000},"page":"152-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"given":"Lena","family":"Schlipf","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-03841-4_8","volume-title":"Graph Drawing","author":"MJ Alam","year":"2013","unstructured":"Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: Straight-line grid drawings of 3-connected 1-planar graphs. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 83\u201394. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_8"},{"doi-asserted-by":"publisher","unstructured":"Angelini, P., Bekos, M.A., Liotta, G., Montecchiani, F.: A universal slope set for 1-bend planar drawings. In: Aronov, B., Katz, M.J. (eds.) Proceedings of 33rd International Symposium on Computational Geometry (SoCG 2017). LIPIcs, vol. 77, pp. 9:1\u20139:16. Schloss Dagstuhl (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.9","key":"11_CR2","DOI":"10.4230\/LIPIcs.SoCG.2017.9"},{"doi-asserted-by":"crossref","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). http:\/\/www.combinatorics.org\/Volume_13\/Abstracts\/v13i1r3.html","key":"11_CR3","DOI":"10.37236\/1029"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2017.05.039","volume":"689","author":"MA Bekos","year":"2017","unstructured":"Bekos, M.A., Didimo, W., Liotta, G., Mehrabi, S., Montecchiani, F.: On RAC drawings of 1-planar graphs. Theor. Comput. Sci. 689, 48\u201357 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.05.039","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"657","DOI":"10.7155\/jgaa.00369","volume":"19","author":"MA Bekos","year":"2015","unstructured":"Bekos, M.A., Gronemann, M., Kaufmann, M., Krug, R.: Planar octilinear drawings with one bend per edge. J. Graph Algorithms Appl. 19(2), 657\u2013680 (2015). https:\/\/doi.org\/10.7155\/jgaa.00369","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T Biedl","year":"1998","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. Theory Appl. 9(3), 159\u2013180 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(97)00026-6","journal-title":"Comput. Geom. Theory Appl."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.comgeo.2017.10.007","volume":"69","author":"FJ Brandenburg","year":"2018","unstructured":"Brandenburg, F.J.: T-shape visibility representations of 1-planar graphs. Comput. Geom. 69, 16\u201330 (2018). https:\/\/doi.org\/10.1016\/j.comgeo.2017.10.007","journal-title":"Comput. Geom."},{"unstructured":"Chaplick, S., Lipp, F., Wolff, A., Zink, J.: 1-bend RAC drawings of NIC-planar graphs in quadratic area. In: Korman, M., Mulzer, W. (eds.) Proceedings of 34th European Workshop on Computational Geometry (EuroCG 2018). pp. 28:1\u201328:6. FU Berlin, Berlin (2018). https:\/\/conference.imp.fu-berlin.de\/eurocg18\/download\/paper_28.pdf","key":"11_CR8"},{"unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd ed. MIT Press, Cambridge (2009). https:\/\/mitpress.mit.edu\/books\/introduction-algorithms-third-edition","key":"11_CR9"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61, 175\u2013198 (1988). https:\/\/doi.org\/10.1016\/0304-3975(88)90123-5","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"11_CR11","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1007\/s00453-017-0324-2","volume":"80","author":"E Di Giacomo","year":"2018","unstructured":"Di Giacomo, E., et al.: Ortho-polygon visibility representations of embedded graphs. Algorithmica 80(8), 2345\u20132383 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0324-2","journal-title":"Algorithmica"},{"issue":"2","key":"11_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). https:\/\/doi.org\/10.7155\/jgaa.00376","journal-title":"J. Graph Algorithms Appl."},{"key":"11_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."},{"doi-asserted-by":"crossref","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. arxiv report arXiv:1804.07257 (2018)","key":"11_CR14","DOI":"10.1145\/3301281"},{"issue":"3","key":"11_CR15","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."},{"unstructured":"Duncan, C., Goodrich, M.T.: Planar orthogonal and polyline drawing algorithms. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization. Chapman and Hall\/CRC, Boca Raton (2013). http:\/\/cs.brown.edu\/people\/rtamassi\/gdhandbook\/chapters\/orthogonal.pdf","key":"11_CR16"},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.7155\/jgaa.00073","volume":"7","author":"CA Duncan","year":"2003","unstructured":"Duncan, C.A., Kobourov, S.G.: Polar coordinate drawing of planar graphs with good angular resolution. J. Graph Algorithms Appl. 7(4), 311\u2013333 (2003). https:\/\/doi.org\/10.7155\/jgaa.00073","journal-title":"J. Graph Algorithms Appl."},{"issue":"7\u20138","key":"11_CR18","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1016\/j.dam.2012.11.019","volume":"161","author":"P Eades","year":"2013","unstructured":"Eades, P., Liotta, G.: Right angle crossing graphs and $$1$$-planarity. Discrete Appl. Math. 161(7\u20138), 961\u2013969 (2013). https:\/\/doi.org\/10.1016\/j.dam.2012.11.019","journal-title":"Discrete Appl. Math."},{"issue":"7\u20138","key":"11_CR19","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.disc.2005.11.056","volume":"307","author":"I Fabrici","year":"2007","unstructured":"Fabrici, I., Madaras, T.: The structure of 1-planar graphs. Discrete Math. 307(7\u20138), 854\u2013865 (2007). https:\/\/doi.org\/10.1016\/j.disc.2005.11.056","journal-title":"Discrete Math."},{"issue":"5","key":"11_CR20","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/0222063","volume":"22","author":"M Formann","year":"1993","unstructured":"Formann, M., et al.: Drawing graphs in the plane with high resolution. SIAM J. Comput. 22(5), 1035\u20131052 (1993). https:\/\/doi.org\/10.1137\/0222063","journal-title":"SIAM J. Comput."},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1007\/s00373-012-1157-z","volume":"29","author":"V Jelinek","year":"2013","unstructured":"Jelinek, V., Jelinkov\u00e1, E., Kratochvil, 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). https:\/\/doi.org\/10.1007\/s00373-012-1157-z","journal-title":"Graphs Comb."},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-56402-0_53","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G Kant","year":"1993","unstructured":"Kant, G.: Hexagonal grid drawings. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol. 657, pp. 263\u2013276. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56402-0_53"},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16(1), 4\u201332 (1996). https:\/\/doi.org\/10.1007\/BF02086606","journal-title":"Algorithmica"},{"issue":"2","key":"11_CR24","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). https:\/\/doi.org\/10.1137\/100815001","journal-title":"SIAM J. Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Kindermann, P., Montecchiani, F., Schlipf, L., Schulz, A.: Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles. arxiv report arXiv:1808.08496 (2018)","key":"11_CR25","DOI":"10.1007\/978-3-030-04414-5_11"},{"issue":"5","key":"11_CR26","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). https:\/\/doi.org\/10.1016\/j.comgeo.2014.01.003","journal-title":"Comput. Geom."},{"key":"11_CR27","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. Reviews 25, 49\u201367 (2017). https:\/\/doi.org\/10.1016\/j.cosrev.2017.06.002","journal-title":"Comput. Sci. Reviews"},{"key":"11_CR28","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"},{"issue":"1\u20133","key":"11_CR29","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-03841-4_36","volume":"81","author":"Y Liu","year":"1998","unstructured":"Liu, Y., Morgana, A., Simeone, B.: A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid. Discrete Appl. Math. 81(1\u20133), 69\u201391 (1998). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_36","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"11_CR30","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0895480193242931","volume":"7","author":"SM Malitz","year":"1994","unstructured":"Malitz, S.M., Papakostas, A.: On the angular resolution of planar graphs. SIAM J. Discrete Math. 7(2), 172\u2013183 (1994). https:\/\/doi.org\/10.1137\/S0895480193242931","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-25878-7_25","volume-title":"Graph Drawing","author":"P Mukkamala","year":"2012","unstructured":"Mukkamala, P., P\u00e1lv\u00f6lgyi, D.: Drawing cubic graphs with the four basic slopes. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 254\u2013265. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25878-7_25"},{"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), 1\u20134 (2006). http:\/\/www.combinatorics.org\/Volume_13\/Abstracts\/v13i1n1.html","key":"11_CR32","DOI":"10.37236\/1139"},{"issue":"1\u20132","key":"11_CR33","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02996313","volume":"29","author":"G Ringel","year":"1965","unstructured":"Ringel, G.: Ein Sechsfarbenproblem auf der Kugel. Abh. Math. Semin. Univ. Hambg. 29(1\u20132), 107\u2013117 (1965). https:\/\/doi.org\/10.1007\/BF02996313","journal-title":"Abh. Math. Semin. Univ. Hambg."}],"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-04414-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:53:29Z","timestamp":1710233609000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04414-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030044138","9783030044145"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04414-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 December 2018","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":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dccg.upc.edu\/gd2018\/","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":"85","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":"41","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":"48% - 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.25","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":"3.92","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":"The book also contains 1 full invited paper and 1 contest report","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","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"}]}}