{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:24:28Z","timestamp":1760441068805},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564027"},{"type":"electronic","value":"9783540475545"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56402-0_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:09:32Z","timestamp":1330236572000},"page":"263-276","source":"Crossref","is-referenced-by-count":19,"title":["Hexagonal grid drawings"],"prefix":"10.1007","author":[{"given":"Goos","family":"Kant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Cohen, R.F., G. Di Battista, R. Tamassia, I.G. Tollis and P. Bertolazzi, A Framework for dynamic graph drawing, to appear in: Proc. ACM Symp. on Computational Geometry, Berlin, 1992.","DOI":"10.1145\/142675.142728"},{"key":"24_CR2","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"Di Battista, G., and R. Tamassia, Algorithms for plane representations of acyclic digraphs, Theoret. Comp. Science 61 (1988), pp. 436\u2013441.","journal-title":"Theoret. Comp. Science"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Di Battista, G., R. Tamassia and I.G. Tollis, Area requirement and symmetry display in drawing graphs, Proc. ACM Symp. on Computational Geometry, Saarbr\u00fccken, 1989, pp. 319\u2013321.","DOI":"10.1145\/73833.73839"},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(92)90072-4","volume":"41","author":"G. Battista Di","year":"1992","unstructured":"Di Battista, G., R. Tamassia and I.G. Tollis, Constrained visibility representations of graphs, Inf. Proc. Letters 41 (1992), pp. 1\u20137.","journal-title":"Inf. Proc. Letters"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Formann, M., 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 Ann. IEEE Symp. on Found. of Comp. Science, St. Louis, 1990, pp. 86\u201395.","DOI":"10.1109\/FSCS.1990.89527"},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"Fraysseix, H. de, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990), pp. 41\u201351.","journal-title":"Combinatorica"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Kant, G., A New Method for Planar Graph Drawings on a Grid, Tech. Report, Dept. of Comp. Science, Utrecht University, 1992 (to appear).","DOI":"10.1145\/152992.153006"},{"key":"24_CR8","volume-title":"Lecture Notes in Comp. Science","author":"G. Kant","year":"1992","unstructured":"Kant, G., and H.L. Bodlaender, Triangulating Planar Graphs While Minimizing the Maximum Degree, to appear in: Proc. 3rd Scandinavian Workshop on Algorithm Theory (SWAT '92), Lecture Notes in Comp. Science, Springer-Verlag, Berlin\/Heidelberg, 1992."},{"key":"24_CR9","unstructured":"Schnyder, W., Embedding planar graphs on the grid, in: Proc. 1st Annual ACM-SIAM Symp. on Discr. Alg., San Fransisco, 1990, pp. 138\u2013147."},{"key":"24_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230140202","volume":"14","author":"J.A. Storer","year":"1984","unstructured":"Storer, J.A., On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181\u2013212.","journal-title":"Networks"},{"key":"24_CR11","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R., On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987), pp. 421\u2013444.","journal-title":"SIAM J. Comput."},{"key":"24_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"Tamassia, R., G. Di Battista and C. Batini, Automatic graph drawing and readability of diagrams, IEEE Trans. on Systems, Man and Cybernetics 18 (1988), pp. 61\u201379.","journal-title":"IEEE Trans. on Systems, Man and Cybernetics"},{"key":"24_CR13","unstructured":"Tamassia, R., and I.G. Tollis, Efficient embedding of planar graphs in linear time, Proc. IEEE Int. Symp. on Circuits and Systems, Philadelphia, pp. 495\u2013498, 1987."},{"key":"24_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(91)90059-Q","volume":"39","author":"R. Tamassia","year":"1991","unstructured":"Tamassia, R., I.G. Tollis and J.S. Vitter, Lower bounds for planar orthogonal drawings of graphs, Inf. Proc. Letters 39 (1991), pp. 35\u201340.","journal-title":"Inf. Proc. Letters"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56402-0_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T23:47:20Z","timestamp":1640908040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56402-0_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540564027","9783540475545"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-56402-0_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}