{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:37Z","timestamp":1725664117870},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589501"},{"type":"electronic","value":"9783540491552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58950-3_359","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:55:48Z","timestamp":1330275348000},"page":"84-95","source":"Crossref","is-referenced-by-count":5,"title":["On drawing angle graphs"],"prefix":"10.1007","author":[{"given":"Ashim","family":"Garg","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"R.F. Cohen, G. Di Battista, R. Tamassia, I.G. Tollis, and P. Bertolazzi, \u201cA Framework for Dynamic Graph Drawing,\u201d Proc. ACM Symp. on Computational Geometry, 1992, pp. 261\u2013270.","DOI":"10.1145\/142675.142728"},{"key":"9_CR2","unstructured":"I.F. Cruz, A. Garg, \u201cDrawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs,\u201d Graph Drawing '94 (Proc. DIMACS Workshop on Graph Drawing), to appear."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis, \u201cAlgorithms for Drawing Graphs: An Annotated Bibliography,\u201d Comp. Geom. Theory Appl., to appear","DOI":"10.1016\/0925-7721(94)00014-X"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"G. Di Battista, R. Tamassia, and I.G. Tollis, \u201cArea Requirement and Symmetry Display of Planar Upward Drawings,\u201d Disc. & Comp. Geom., vol. 7, 1992.","DOI":"10.1007\/BF02187850"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"G. Di Battista and L. Vismara, \u201cAngles of Planar Triangular Graphs,\u201d Proc. ACM Symp. on Theory of Computing, 1993.","DOI":"10.1145\/167088.167207"},{"key":"9_CR6","unstructured":"P. Eades and T. Lin. \u201cAlgorithmic and declarative approaches to aesthetic layout,\u201d Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F.T. Leighton, A. Simvonis, E. Welzl, and G. Woeginger, \u201cDrawing Graphs in the Plane with High Resolution,\u201d Proc. FOCS, 1990, pp. 86\u201395.","DOI":"10.1109\/FSCS.1990.89527"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"A. Garg, M.T. Goodrich, and R. Tamassia, \u201cArea-efficient Upward Tree Drawings\u201d, Proc. ACM Symp. on Computational Geometry, 1993, pp. 359\u2013368.","DOI":"10.1145\/160985.161165"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia, \u201cPlanar Drawings and Angular Resolution: Algorithms and Bounds\u201d, European Symposium on Algorithms, 1994.","DOI":"10.1007\/BFb0049393"},{"key":"9_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Gary","year":"1979","unstructured":"M.R. Gary and D.S. Johnson, \u201cComputers and Intractability: A Guide to the Theory of NP-Completeness,\u201d W.H. Freeman, New York, NY 1979."},{"key":"9_CR11","unstructured":"M. Himsolt, \u201cA View to Graph Drawing Algorithms Through GraphEd\u201d, Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing), Paris, 1993."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"T. Kamada. On Visualization of Abstract Objects and Relations. PhD thesis, Department of Information Science, University of Tokyo, 1988.","DOI":"10.1142\/0922"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"G. Kant. Drawing planar graphs using the lmc-ordering. In Proc. 33th Annu. IEEE Sympos. Found. Comput. Sci., pages 101\u2013110, 1992.","DOI":"10.1109\/SFCS.1992.267814"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"C.E. Leiserson, \u201cArea-Efficient Graph Layouts (for VLSI),\u201d Proc. IEEE Symp. on Foundations of Computer Science, 1980, pp. 270\u2013281.","DOI":"10.1109\/SFCS.1980.13"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"S.M. Malitz and A. Papakostas, \u201cOn the Angular Resolution of Planar Graphs,\u201d Proc. ACM Symp. on Theory of Computing, 1992, pp. 527\u2013538.","DOI":"10.1145\/129712.129764"},{"issue":"3","key":"9_CR16","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421\u2013444, 1987.","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR17","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."},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C-30","author":"L. Valiant","year":"1981","unstructured":"L. Valiant, \u201cUniversality Considerations in VLSI Circuits,\u201d IEEE Trans. on Computers, vol. C-30, 1981, pp. 135\u2013140.","journal-title":"IEEE Trans. on Computers"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"G. Vijayan, \u201cGeometry of Planar Graphs with Angles\u201d, Proc. ACM Symp. on Computational Geometry, 1986, pp. 116\u2013124.","DOI":"10.1145\/10515.10528"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"G. Vijayan and A. Wigderson, \u201cRectiliear Graphs and their Embeddings,\u201d SIAM Journal of Computing, Vol. 14, No. 2, May 1985.","DOI":"10.1137\/0214027"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58950-3_359.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:24:48Z","timestamp":1605648288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_359","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}