{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:36Z","timestamp":1725663756845},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_244","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:05:00Z","timestamp":1330257900000},"page":"151-162","source":"Crossref","is-referenced-by-count":16,"title":["Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Battista","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Vargiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, R.F. Cohen, G. Di Battista, R. Tamassia, and I.G. Tollis, \u201cHow to Draw a Series-Parallel Digraph,\u201d Proc. 3rd Scandinavian Workshop on Algorithm Theory, 1992.","DOI":"10.1007\/3-540-55706-7_23"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"G. Di Battista and R. Tamassia \u201cAlgorithms for Plane Representations of Acyclic Digraphs,\u201d Theoretical Computer Science, vol. 61, pp. 175\u2013198, 1988.","journal-title":"Theoretical Computer Science"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"G. Di Battista and R. Tamassia \u201cIncremental Planarity Testing,\u201d Proc. 30th IEEE Symp. on Foundations of Computer Sciene, pp. 436\u2013441, 1989.","DOI":"10.1109\/SFCS.1989.63515"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"G. Di Battista and R. Tamassia \u201cOn Line Planarity Testing,\u201d Technical Report CS-89-31, Dept. of Computer Science, Brown Univ. 1989.","DOI":"10.1109\/SFCS.1989.63515"},{"key":"16_CR5","unstructured":"P. Eades and R. Tamassia, \u201cAlgorithms for Automatic Graph Drawing: An Annotated Bibliography,\u201d Technical Report CS-89-09, Dept. of Computer Science, Brown Univ. 1989."},{"key":"16_CR6","volume-title":"Graph Algoritms","author":"S. Even","year":"1979","unstructured":"S. Even \u201cGraph Algoritms,\u201d Computer Science Press, Potomac, MD, 1979."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"G. Kant \u201cA New Method for Planar Graph Drawings on a Grid,\u201d Proc. IEEE Symp. on Foundations of Computer Science, 1992.","DOI":"10.1145\/152992.153006"},{"key":"16_CR8","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"E. L. Lawler \u201cCombinatorial Optimization: Networks and Matroids,\u201d Holt, Rinehart and Winston, New York, Chapt. 4, 1976."},{"key":"16_CR9","unstructured":"T. Nishizeki and N. Chiba, \u201cPlanar Graphs: Theory and Algorithms,\u201d Annals of Discrete Mathematics 32, North-Holland, 1988."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230140202","volume":"14","author":"J. A. Storer","year":"1984","unstructured":"J. A. Storer \u201cOn Minimal Node-Cost Planar Embeddings,\u201d Networks, vol. 14, pp. 181\u2013212, 1984.","journal-title":"Networks"},{"issue":"no.3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia \u201cOn Embedding a Graph in the Grid with the Minimum Number of Bends,\u201d SIAM J. Computing, vol. 16, no. 3, pp. 421\u2013444, 1987.","journal-title":"SIAM J. Computing"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"R. Tamassia, \u201cPlanar Orthogonal Drawings of Graphs,\u201d Proc. IEEE Int. Symp. on Circuits and Systems, 1990.","DOI":"10.1109\/ISCAS.1990.112025"},{"key":"16_CR13","unstructured":"R. Tamassia and I.G. Tollis \u201cEfficient Embedding of Planar Graphs in Linear Time,\u201d Proc. IEEE Int. Symp. on Circuits and Systems, Philadelphia, pp. 495\u2013498, 1987."},{"issue":"no.9","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"CAS-36","author":"R. Tamassia","year":"1989","unstructured":"R. Tamassia and I.G. Tollis \u201cPlanar Grid Embedding in Linear Time,\u201d IEEE Trans. on Circuits and Systems, vol. CAS-36, no. 9, pp. 1230\u20131234, 1989.","journal-title":"IEEE Trans. on Circuits and Systems"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"R. Tamassia, I. G. Tollis, and J. S. Vitter \u201cLower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings,\u201d Proc. IEEE Symp. on Parallel and Distributed Processing, 1991.","DOI":"10.1109\/SPDP.1991.218215"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_244.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:15Z","timestamp":1605647295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_244","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}