{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:08Z","timestamp":1725497168314},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_13","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T09:55:58Z","timestamp":1196934958000},"page":"133-144","source":"Crossref","is-referenced-by-count":0,"title":["On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Frati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1142\/S0218195994000215","volume":"4","author":"P. Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Cohen, R.F., Di Battista, G., Tamassia, R., Tollis, I.G.: How to draw a series-parallel digraph. Int. J. Comput. Geom. Appl.\u00a04(4), 385\u2013402 (1994)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"6","key":"13_CR2","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.: Upward drawings of triconnected digraphs. Algorithmica\u00a012(6), 476\u2013497 (1994)","journal-title":"Algorithmica"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-002-0937-x","volume":"34","author":"T.M. Chan","year":"2002","unstructured":"Chan, T.M.: A near-linear area bound for drawing binary trees. Algorithmica\u00a034(1), 1\u201313 (2002)","journal-title":"Algorithmica"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","volume":"2","author":"P. Crescenzi","year":"1992","unstructured":"Crescenzi, P., Di Battista, G., Piperno, A.: A note on optimal area algorithms for upward drawings of binary trees. Comput. Geom.\u00a02, 187\u2013200 (1992)","journal-title":"Comput. Geom."},{"key":"13_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Upper Saddle River, NJ (1999)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Di Battista, G., Frati, F.: Small area drawings of outerplanar graphs. In: Graph Drawing, pp. 89\u2013100 (2005)","DOI":"10.1007\/11618058_9"},{"issue":"6","key":"13_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0020-0190(90)90045-Y","volume":"36","author":"G. Battista Di","year":"1990","unstructured":"Di Battista, G., Liu, W.P., Rival, I.: Bipartite graphs, upward drawings, and planarity. Inf. Process. Lett.\u00a036(6), 317\u2013322 (1990)","journal-title":"Inf. Process. Lett."},{"key":"13_CR8","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.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci.\u00a061, 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G. Battista Di","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I.G.: Area requirement and symmetry display of planar upward drawings. Disc. & Computat. Geometry\u00a07, 381\u2013401 (1992)","journal-title":"Disc. & Computat. Geometry"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Garg, A., Rusu, A.: Area-efficient drawings of outerplanar graphs. In: Graph Drawing, pp. 129\u2013134 (2003)","DOI":"10.1007\/978-3-540-24595-7_12"},{"issue":"6","key":"13_CR11","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1142\/S021819590300130X","volume":"13","author":"A. Garg","year":"2003","unstructured":"Garg, A., Rusu, A.: Area-efficient order-preserving planar straight-line drawings of ordered trees. Int. J. Comput. Geometry Appl.\u00a013(6), 487\u2013505 (2003)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Garg, A., Tamassia, R.: Efficient computation of planar straight-line. In: Graph Drawing (Proc. ALCOM Workshop on Graph Drawing), pp. 298\u2013306 (1994)","DOI":"10.1007\/3-540-57811-0_2"},{"issue":"2","key":"13_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.\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S0097539792235906","volume":"25","author":"M.D. Hutton","year":"1996","unstructured":"Hutton, M.D., Lubiw, A.: Upward planarity testing of single-source acyclic digraphs. SIAM J. Comput.\u00a025(2), 291\u2013311 (1996)","journal-title":"SIAM J. Comput."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Papakostas, A.: Upward planarity testing of outerplanar dags. In: Graph Drawing, pp. 298\u2013306 (1994)","DOI":"10.1007\/3-540-58950-3_385"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:42:30Z","timestamp":1619505750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_13","relation":{},"subject":[]}}