{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:36:55Z","timestamp":1766378215312},"publisher-location":"New York, NY","reference-count":9,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_653","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T14:28:46Z","timestamp":1553092126000},"page":"2308-2312","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Upward Graph Drawing"],"prefix":"10.1007","author":[{"given":"Walter","family":"Didimo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"3","key":"450_CR2174","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/s00453-001-0083-x","volume":"32","author":"P Bertolazzi","year":"2002","unstructured":"Bertolazzi P, Di Battista G, Didimo W (2002) Quasi-upward planarity. Algorithmica 32(3):474\u2013506","journal-title":"Algorithmica"},{"issue":"6","key":"450_CR2175","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"12","author":"P Bertolazzi","year":"1994","unstructured":"Bertolazzi P, Di Battista G, Liotta G, Mannino C (1994) Upward drawings of triconnected digraphs. Algorithmica 12(6):476\u2013497","journal-title":"Algorithmica"},{"key":"450_CR2176","volume-title":"Handbook of graph drawing and visualization","author":"M Chimani","year":"2013","unstructured":"Chimani M, Gutwenger C, J\u00fcnger M, Klau GW, Klein K, Mutzel P (2013) The open graph drawing framework (OGDF). In: Tamassia R (ed) Handbook of graph drawing and visualization. CRC Press - Taylor & Francis Group Boca Raton, FL, USA"},{"doi-asserted-by":"crossref","unstructured":"Chimani M, Zeranski R (2013) Upward planarity testing: a computational study. In: Proceedings of Graph Drawing (GD\u201913), Bordeaux. Volume\u00a08242 of LNCS. Springer, pp\u00a013\u201324","key":"450_CR2177","DOI":"10.1007\/978-3-319-03841-4_2"},{"key":"450_CR2178","volume-title":"Handbook of graph drawing and visualization","author":"G Battista Di","year":"2013","unstructured":"Di Battista G, Didimo W (2013) GDToolkit. In: Tamassia R (ed) Handbook of graph drawing and visualization. CRC Press - Taylor & Francis Group Boca Raton, FL, USA"},{"key":"450_CR2179","volume-title":"Graph drawing: algorithms for the visualization of graphs","author":"G Battista Di","year":"1998","unstructured":"Di Battista G, Eades P, Tamassia R, Tollis IG (1998) Graph drawing: algorithms for the visualization of graphs. Prentice Hall, Upper Saddle River, New Jersey, USA"},{"key":"450_CR2180","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Battista Di","year":"1988","unstructured":"Di Battista G, Tamassia R (1988) Algorithms for plane representations of acyclic digraphs. Theor Comput Sci 61:175\u2013198","journal-title":"Theor Comput Sci"},{"issue":"4","key":"450_CR2181","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/070696854","volume":"23","author":"W Didimo","year":"2009","unstructured":"Didimo W, Giordano F, Liotta G (2009) Upward spirality and upward planarity testing. SIAM J Discret Math 23(4):1842\u20131899","journal-title":"SIAM J Discret Math"},{"issue":"2","key":"450_CR2182","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A Garg","year":"1992","unstructured":"Garg A, Tamassia R (1992) On the computational complexity of upward and rectilinear planarity testing. SIAM J Comput 31(2):601\u2013625","journal-title":"SIAM J Comput"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:14:46Z","timestamp":1553094886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_653","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}