{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:38:49Z","timestamp":1766378329673,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"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_6","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T13:20:45Z","timestamp":1545052845000},"page":"77-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Universal Slope Sets for Upward Planar Drawings"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[]},{"given":"Emilio","family":"Di Giacomo","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"key":"6_CR1","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.) SoCG. LIPIcs, vol. 77, pp. 9:1\u20139:16. Schloss Dagstuhl (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.9, https:\/\/arxiv.org\/abs\/1703.04283","DOI":"10.4230\/LIPIcs.SoCG.2017.9"},{"key":"6_CR2","unstructured":"Bekos, M.A., Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F.: Universal slope sets for upward planar drawings. ArXiv e-prints abs\/1803.09949v2 (2018). https:\/\/arxiv.org\/abs\/1803.09949v2"},{"issue":"2","key":"6_CR3","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."},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-662-49529-2_12","volume-title":"LATIN 2016: Theoretical Informatics","author":"MA Bekos","year":"2016","unstructured":"Bekos, M.A., Kaufmann, M., Krug, R.: On the total number of bends for planar octilinear drawings. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 152\u2013163. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49529-2_12"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132\u2013169 (1998). https:\/\/doi.org\/10.1137\/S0097539794279626","journal-title":"SIAM J. Comput."},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97),00026-6","volume":"9","author":"TC Biedl","year":"1998","unstructured":"Biedl, T.C., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159\u2013180 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(97),00026-6","journal-title":"Comput. Geom."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.7155\/jgaa.00083","volume":"8","author":"HL Bodlaender","year":"2004","unstructured":"Bodlaender, H.L., Tel, G.: A note on rectilinearity and angular resolution. J. Graph Algorithms Appl. 8, 89\u201394 (2004). https:\/\/doi.org\/10.7155\/jgaa.00083","journal-title":"J. Graph Algorithms Appl."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-319-73915-1_36","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2018","unstructured":"Chaplick, S., et al.: Planar L-drawings of directed graphs. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 465\u2013478. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_36"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"1.2:1.1","DOI":"10.1145\/2699875","volume":"20","author":"M Chimani","year":"2015","unstructured":"Chimani, M., Zeranski, R.: Upward planarity testing in practice: SAT formulations and comparative study. ACM J. Exp. Algorithmics 20, 1.2:1.1\u20131.2:1.27 (2015). https:\/\/doi.org\/10.1145\/2699875","journal-title":"ACM J. Exp. Algorithmics"},{"key":"6_CR10","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF00383762","volume":"7","author":"J Czyzowicz","year":"1990","unstructured":"Czyzowicz, J., Pelc, A., Rival, I., Urrutia, J.: Crooked diagrams with few slopes. Order 7(2), 133\u2013143 (1990). https:\/\/doi.org\/10.1007\/BF00383762","journal-title":"Order"},{"key":"6_CR12","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, New Jersey (1999)"},{"key":"6_CR13","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."},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-50106-2_10","volume-title":"Graph Drawing and Network Visualization","author":"E Di Giacomo","year":"2016","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: 1-bend upward planar drawings of SP-digraphs. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 123\u2013130. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_10"},{"key":"6_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27848-8_653-1","volume-title":"Encyclopedia of Algorithms","author":"W Didimo","year":"2015","unstructured":"Didimo, W.: Upward graph drawing. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-642-27848-8_653-1"},{"key":"6_CR16","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 (2013)"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990). https:\/\/doi.org\/10.1007\/BF02122694","journal-title":"Combinatorica"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601\u2013625 (2001). https:\/\/doi.org\/10.1137\/S0097539794277123","journal-title":"SIAM J. Comput."},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-50106-2_18","volume-title":"Graph Drawing and Network Visualization","author":"M Gronemann","year":"2016","unstructured":"Gronemann, M.: Bitonic st-orderings for upward planar graphs. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 222\u2013235. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_18"},{"key":"6_CR20","unstructured":"Healy, P., Nikolov, N.S.: Hierarchical drawing algorithms. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization. Chapman and Hall\/CRC (2013)"},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.jvlc.2005.09.001","volume":"17","author":"S Hong","year":"2006","unstructured":"Hong, S., Merrick, D., do Nascimento, H.A.D.: Automatic visualisation of metro maps. J. Vis. Lang. Comput. 17(3), 203\u2013224 (2006). https:\/\/doi.org\/10.1016\/j.jvlc.2005.09.001","journal-title":"J. Vis. Lang. Comput."},{"issue":"2\u20133","key":"6_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0012-365X(87),90008-2","volume":"63","author":"D Kelly","year":"1987","unstructured":"Kelly, D.: Fundamentals of planar ordered sets. Discrete Math. 63(2\u20133), 197\u2013216 (1987). https:\/\/doi.org\/10.1016\/0012-365X(87),90008-2","journal-title":"Discrete Math."},{"issue":"2","key":"6_CR23","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."},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-662-49529-2_41","volume-title":"LATIN 2016: Theoretical Informatics","author":"K Knauer","year":"2016","unstructured":"Knauer, K., Walczak, B.: Graph drawings with one bend and few slopes. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 549\u2013561. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49529-2_41"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: FOCS, pp. 270\u2013281. IEEE (1980). https:\/\/doi.org\/10.1109\/SFCS.1980.13","DOI":"10.1109\/SFCS.1980.13"},{"key":"6_CR26","unstructured":"N\u00f6llenburg, M.: Automated drawings of metro maps. Technical report 2005\u201325, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe (2005)"},{"issue":"5","key":"6_CR27","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1109\/TVCG.2010.81","volume":"17","author":"M N\u00f6llenburg","year":"2011","unstructured":"N\u00f6llenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans. Vis. Comput. Graph. 17(5), 626\u2013641 (2011). https:\/\/doi.org\/10.1109\/TVCG.2010.81","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TVCG.2010.24","volume":"17","author":"JM Stott","year":"2011","unstructured":"Stott, J.M., Rodgers, P., Martinez-Ovando, J.C., Walker, S.G.: Automatic metro map layout using multicriteria optimization. IEEE Trans. Vis. Comput. Graph. 17(1), 101\u2013114 (2011). https:\/\/doi.org\/10.1109\/TVCG.2010.24","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"6_CR29","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421\u2013444 (1987). https:\/\/doi.org\/10.1137\/0216030","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR30","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"LG Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comput. 30(2), 135\u2013140 (1981). https:\/\/doi.org\/10.1109\/TC.1981.6312176","journal-title":"IEEE Trans. Comput."}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:53:20Z","timestamp":1710233600000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04414-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030044138","9783030044145"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04414-5_6","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"}]}}