{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:50:45Z","timestamp":1787500245866,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540584346","type":"print"},{"value":"9783540487944","type":"electronic"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994]]},"DOI":"10.1007\/bfb0049393","type":"book-chapter","created":{"date-parts":[[2006,3,6]],"date-time":"2006-03-06T13:42:35Z","timestamp":1141652555000},"page":"12-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Planar drawings and angular resolution: Algorithms and bounds"],"prefix":"10.1007","author":[{"given":"Ashim","family":"Garg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,2,23]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, R. F. Cohen, G. Di Battista, R. Tamassia, and I. G. Tollis. How to draw a series-parallel digraph. Proc. 3rd Scand. Workshop Algorithm Theory, vol. 621 of Lecture Notes in Computer Science, pp. 272\u2013283. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55706-7_23"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/0020-0190(80)90034-4","volume":"11","author":"R. P. Brent","year":"1980","unstructured":"R. P. Brent and H. T. Kung. On the area of binary tree layouts. Inform. Process. Lett., 11:521\u2013534, 1980.","journal-title":"Inform. Process. Lett."},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","volume":"2","author":"P. Crescenzi","year":"1992","unstructured":"P. Crescenzi, G. Di Battista, and A. Piperno. A note on optimal area algorithms for upward drawings of binary trees. Comp. Geom. Theory Appl., 2:187\u2013200, 1992.","journal-title":"Comp. Geom. Theory Appl."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fary embeddings of planar graphs. Proc. 20th ACM Sympos. Theory Comput., pp. 426\u2013433, 1988.","DOI":"10.1145\/62212.62254"},{"key":"3_CR5","volume-title":"Algorithms for drawing graphs: an annotated bibliography","author":"G. Battista Di","year":"1993","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Preprint, Dept. Comput. Sci., Brown Univ., Providence, RI, November 1993. To appear in Comput. Geom. Theory Appl. Preliminary version available via anonymous ftp from wilma.cs.brown.edu, gdbiblio. tex.Z and gdbiblio.ps.Z in \/pub\/papers\/compgeo."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G. Battista Di","year":"1992","unstructured":"G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom., 7:381\u2013401, 1992.","journal-title":"Discrete Comput. Geom."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"G. Di Battista and L. Vismara. Angles of planar triangular graphs. Proc. 25th ACM Sympos. Theory Comput. (STOC 93), pp. 431\u2013437, 1993.","DOI":"10.1145\/167088.167207"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F. T. Leighton, A. Simvonis, E. Welzl, and G. Woeginger. Drawing graphs in the plane with high resolution. Proc. 31th IEEE Sympos. Found. Comput. Sci., pp. 86\u201395, 1990.","DOI":"10.1109\/FSCS.1990.89527"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"A. Garg, M. T. Goodrich, and R. Tamassia. Area-efficient upward tree drawings. Proc. 9th ACM Sympos. Comput. Geom., pp. 359\u2013368, 1993.","DOI":"10.1145\/160985.161165"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"G. Kant. Drawing planar graphs using the lmc-ordering. Proc. 33th IEEE Sympos. Found. Comput. Sci., pp. 101\u2013110, 1992.","DOI":"10.1109\/SFCS.1992.267814"},{"key":"3_CR11","volume-title":"PhD thesis","author":"G. Kant","year":"1993","unstructured":"G. Kant. Algorithms for Drawing Planar Graphs. PhD thesis, Dept. Comput. Sci., Univ. Utrecht, Utrecht, Netherlands, 1993."},{"key":"3_CR12","unstructured":"G. Kant. A more compact visibility representation. Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci. (WG'93), 1993."},{"key":"3_CR13","unstructured":"G. Kant, G. Liotta, R. Tamassia, and I. Tollis. Area requirement of visibility representations of trees. Proc. 5th Canad. Conf. Comp. Geom., pp. 192\u2013197, 1993."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"C. E. Leiserson. Area-efficient graph layouts (for VLSI). Proc. 21st IEEE Sympos. Found. Comput. Sci., pp. 270\u2013281, 1980.","DOI":"10.1109\/SFCS.1980.13"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"S. Malitz and A. Papakostas. On the angular resolution of planar graphs. Proc. 24th ACM Sympos. Theory Comput., pp. 527\u2013538, 1992.","DOI":"10.1145\/129712.129764"},{"issue":"4","key":"3_CR16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom., 1(4):343\u2013353, 1986.","journal-title":"Discrete Comput. Geom."},{"key":"3_CR17","unstructured":"W. Schnyder. Embedding planar graphs on the grid. Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pp. 138\u2013148, 1990."},{"issue":"4","key":"3_CR18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom., 1(4):321\u2013341, 1986.","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"3_CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C-30","author":"L. Valiant","year":"1981","unstructured":"L. Valiant. Universality considerations in VLSI circuits. IEEE Trans. Comput., C-30(2):135\u2013140, 1981.","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0049393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T18:00:05Z","timestamp":1736272805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0049393"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584346","9783540487944"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0049393","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"23 February 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}