{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:30:59Z","timestamp":1760441459072,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319739144"},{"type":"electronic","value":"9783319739151"}],"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-319-73915-1_36","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"465-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Planar L-Drawings of Directed Graphs"],"prefix":"10.1007","author":[{"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Chimani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabine","family":"Cornelsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-662-49192-8_11","volume-title":"SOFSEM 2016: Theory and Practice of Computer Science","author":"P Angelini","year":"2016","unstructured":"Angelini, P., Da Lozzo, G., Di Bartolomeo, M., Di Donato, V., Patrignani, M., Roselli, V., Tollis, I.G.: L-drawings of directed graphs. In: Freivalds, R.M., Engels, G., Catania, B. (eds.) SOFSEM 2016. LNCS, vol. 9587, pp. 134\u2013147. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49192-8_11"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-70904-6_33","volume-title":"Graph Drawing","author":"W Barth","year":"2007","unstructured":"Barth, W., Mutzel, P., Y\u0131ld\u0131z, C.: A new approximation algorithm for bend minimization in the Kandinsky model. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 343\u2013354. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_33"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-319-20086-6_27","volume-title":"Experimental Algorithms","author":"MA Bekos","year":"2015","unstructured":"Bekos, M.A., Kaufmann, M., Krug, R., Siebenhaller, M.: The effect of almost-empty faces on planar Kandinsky drawings. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 352\u2013364. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20086-6_27"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-662-44777-2_14","volume-title":"Algorithms - ESA 2014","author":"T Bl\u00e4sius","year":"2014","unstructured":"Bl\u00e4sius, T., Br\u00fcckner, G., Rutter, I.: Complexity of higher-degree orthogonal graph embedding in the Kandinsky model. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 161\u2013172. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_14"},{"key":"36_CR5","unstructured":"Br\u00fcckner, G.: Higher-degree orthogonal graph drawing with flexibility constraints. Bachelor thesis, Department of Informatics, KIT (2013). https:\/\/i11www.iti.kit.edu\/_media\/teaching\/theses\/ba-brueckner-13.pdf"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Chimani, M., Cornelsen, S., Da Lozzo, G., N\u00f6llenburg, M., Patrignani, M., Tollis, I.G., Wolff, A.: Planar L-drawings of directed graphs. arXiv:1708.09107, Cornell University (2017)","DOI":"10.1007\/978-3-319-73915-1_36"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25, 956\u2013997 (1996). https:\/\/doi.org\/10.1137\/S0097539794280736","journal-title":"SIAM J. Comput."},{"key":"36_CR8","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":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/BFb0032061","volume-title":"Automata, Languages and Programming","author":"G Di Battista","year":"1990","unstructured":"Di Battista, G., Tamassia, R.: On-line graph algorithms with SPQR-trees. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 598\u2013611. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032061"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-662-45803-7_29","volume-title":"Graph Drawing","author":"W Didimo","year":"2014","unstructured":"Didimo, W., Liotta, G., Patrignani, M.: On the complexity of HV-rectilinear planarity testing. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 343\u2013354. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_29"},{"key":"36_CR11","unstructured":"Eigelsperger, M.: Automatic layout of UML class diagrams: a topology-shape-metrics approach. Ph.D. thesis, Eberhard-Karls-Universit\u00e4t zu T\u00fcbingen (2003)"},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Graph Drawing","author":"U F\u00f6\u00dfmeier","year":"1996","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 254\u2013266. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021809"},{"issue":"2","key":"36_CR13","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":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-662-45803-7_14","volume-title":"Graph Drawing","author":"M Gronemann","year":"2014","unstructured":"Gronemann, M.: Bitonic st-orderings of biconnected planar graphs. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 162\u2013173. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_14"},{"key":"36_CR15","unstructured":"Gronemann, M.: Algorithms for incremental planar graph drawing and two-page book embeddings. Ph.D. thesis, University of Cologne (2015). http:\/\/kups.ub.uni-koeln.de\/id\/eprint\/6329"},{"key":"36_CR16","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. https:\/\/arxiv.org\/abs\/1608.08578"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-25878-7_24","volume-title":"Graph Drawing","author":"EM Kornaropoulos","year":"2012","unstructured":"Kornaropoulos, E.M., Tollis, I.G.: Overloaded orthogonal drawings. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 242\u2013253. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25878-7_24"}],"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-319-73915-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:25:28Z","timestamp":1710242728000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_36","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":"21 January 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":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}