{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:38:04Z","timestamp":1725496684261},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_7","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T04:37:43Z","timestamp":1196311063000},"page":"64-73","source":"Crossref","is-referenced-by-count":2,"title":["Embedding Problems for Paths with Direction Constrained Edges"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.7155\/jgaa.00018","volume":"3","author":"T. Biedl","year":"1999","unstructured":"T. Biedl, T. Shermer, S. Wismath, and S. Whitesides. Orthogonal 3-D graph drawing. J. Graph Algorithms and Applications, 3(4):63\u201379, 1999.","journal-title":"J. Graph Algorithms and Applications"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02522826","volume":"17","author":"R. F. Cohen","year":"1997","unstructured":"R. F. Cohen, P. Eades, T. Lin and F. Ruskey. Three-dimensional graph drawing. Algorithmica, 17(2):199\u2013208, 1997.","journal-title":"Algorithmica"},{"key":"7_CR3","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing. Prentice Hall, 1999."},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/S0895480194264010","volume":"9","author":"G. Battista Di","year":"1996","unstructured":"G. Di Battista and L. Vismara. Angles of planar triangular graphs. SIAM J. Discrete Math., 9(3):349\u2013359, 1996.","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0020-0190(96)00133-0","volume":"60","author":"P. Eades","year":"1996","unstructured":"P. Eades, C. Stirk, and S. Whitesides. The techniques of Kolmogorov and Bardzin for three dimensional orthogonal graph drawings. Inform. Process. Lett., 60:97\u2013103, 1996.","journal-title":"Inform. Process. Lett."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"P. Eades, A. Symvonis, and S. Whitesides. Two algorithms for three dimensional orthogonal graph drawing. In S. North, Ed, Graph Drawing (Proc. GD\u2019 96), volume 1190 of Lecture Notes Comput. Sci., pages 139\u2013154. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62495-3_44"},{"issue":"1\u20132","key":"7_CR7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0925-7721(97)00016-3","volume":"9","author":"A. Garg","year":"1998","unstructured":"A. Garg. New results on drawing angle graphs. Comput. Geom. Theory Appl., 9(1\u20132):43\u201382, 1998. Special Issue on Geometric Representations of Graphs, G. Di Battista and R. Tamassia, Eds.","journal-title":"Comput. Geom. Theory Appl."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"A. Papakostas and I. Tollis. Incremental orthogonal graph drawing in three dimensions. In G. Di Battista, Ed, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 139\u2013154. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_50"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","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."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/0214027","volume":"14","author":"G. Vijayan","year":"1985","unstructured":"G. Vijayan and A. Wigderson. Rectilinear graphs and their embeddings. SIAM J. Comput., 14:355\u2013372, 1985.","journal-title":"SIAM J. Comput."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"V. Vijayan. Geometry of planar graphs with angles. In Proc. 2nd Annu. ACM Sympos. Comput. Geom., pages 116\u2013124, 1986.","DOI":"10.1145\/10515.10528"},{"key":"7_CR12","unstructured":"D. R. Wood. Two-bend three-dimensional orthogonal grid drawing of maximum degree five graphs. Technical Report 98\/03, School of Computer Science and Software Engineering, Monash University, 1998."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"D. R. Wood. An algorithm for three-dimensional orthogonal graph drawing. In Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes Comput. Sci., pages 332\u2013346. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-37623-2_25"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T18:53:41Z","timestamp":1551120821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}