{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:24Z","timestamp":1725558864049},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_3","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T16:54:14Z","timestamp":1278348854000},"page":"18-24","source":"Crossref","is-referenced-by-count":3,"title":["Hexagonal Grid Drawings: Algorithms and Lower Bounds"],"prefix":"10.1007","author":[{"given":"Shabnam","family":"Aziza","sequence":"first","affiliation":[]},{"given":"Therese","family":"Biedl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"3_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00010","volume":"2","author":"T. Biedl","year":"1998","unstructured":"Biedl, T.: New lower bounds for orthogonal drawings. J. Graph Algorithms Appl.\u00a02(7), 1\u201331 (1998)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(97)00207-X","volume":"65","author":"T. Biedl","year":"1998","unstructured":"Biedl, T.: Relating bends and size in orthogonal graph drawings. Inform. Process. Lett.\u00a065(2), 111\u2013115 (1998)","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T. Biedl","year":"1998","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom.\u00a09(3), 159\u2013180 (1998)","journal-title":"Comput. Geom."},{"issue":"1-3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(00)00172-4","volume":"103","author":"P. Eades","year":"2000","unstructured":"Eades, P., Symvonis, A., Whitesides, S.: Three-dimensional orthogonal graph drawing algorithms. Discrete Appl. Math.\u00a0103(1-3), 55\u201387 (2000)","journal-title":"Discrete Appl. Math."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"Even, S., Tarjan, R.E.: Computing an st-numbering. Th. Comput. Sci.\u00a02, 339\u2013344 (1976)","journal-title":"Th. Comput. Sci."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-56402-0_53","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Kant","year":"1993","unstructured":"Kant, G.: Hexagonal grid drawings. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol.\u00a0657, pp. 263\u2013276. Springer, Heidelberg (1993)"},{"key":"3_CR7","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of Graphs (Internat. Sympos., Rome, 1966), New York, pp. 215\u2013232 (1967)"},{"issue":"1-2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0925-7721(97)00017-5","volume":"9","author":"A. Papakostas","year":"1998","unstructured":"Papakostas, A., Tollis, I.G.: Algorithms for area-efficient orthogonal drawings. Comput. Geom.\u00a09(1-2), 83\u2013110 (1998)","journal-title":"Comput. Geom."},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.3230140202","volume":"14","author":"J. Storer","year":"1984","unstructured":"Storer, J.: On minimal-node-cost planar embeddings. Networks\u00a014(2), 181\u2013212 (1984)","journal-title":"Networks"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","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.\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R. Tamassia","year":"1989","unstructured":"Tamassia, R., Tollis, I.G.: Planar grid embedding in linear time. IEEE Transactions on Circuits and Systems\u00a036(9), 1230\u20131234 (1989)","journal-title":"IEEE Transactions on Circuits and Systems"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1009760732249","volume":"3","author":"I. Tollis","year":"1998","unstructured":"Tollis, I.: Wiring layouts in the tri-hexagonal grid. Constraints\u00a03(1), 87\u2013120 (1998)","journal-title":"Constraints"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-37623-2_25","volume-title":"Graph Drawing","author":"D.R. Wood","year":"1999","unstructured":"Wood, D.R.: An algorithm for three-dimensional orthogonal graph drawing. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 332\u2013346. Springer, Heidelberg (1999)"},{"issue":"1","key":"3_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.7155\/jgaa.00060","volume":"7","author":"D.R. Wood","year":"2003","unstructured":"Wood, D.R.: Lower bounds for the number of bends in three-dimensional orthogonal graph drawings. J. Graph Algorithms Appl.\u00a07(1), 33\u201377 (2003)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1-3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(02)00044-0","volume":"299","author":"D.R. Wood","year":"2003","unstructured":"Wood, D.R.: Optimal three-dimensional orthogonal graph drawing in the general position model. Th. Comput. Sci.\u00a0299(1-3), 151\u2013178 (2003)","journal-title":"Th. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:41:59Z","timestamp":1619998919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}