{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:04:50Z","timestamp":1759709090298,"version":"build-2065373602"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["Scienti?c"],"award-info":[{"award-number":["Scienti?c"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004462","name":"Consiglio Nazionale delle Ricerche","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004462","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00408-x","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T15:19:50Z","timestamp":1034954390000},"page":"897-917","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["Embedding problems for paths with direction constrained edges"],"prefix":"10.1016","volume":"289","author":[{"given":"Giuseppe Di","family":"Battista","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00408-X_BIB1","unstructured":"T.C. Biedl, Heuristics for 3D-orthogonal graph drawings, in: Proc. 4th Twente Workshop on Graphs and Combinatorial Optimization, 1995, University of Twente, Enschede, The Netherlands, 7\u20139 June 1995, pp. 41\u201344."},{"issue":"4","key":"10.1016\/S0304-3975(01)00408-X_BIB2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.7155\/jgaa.00018","article-title":"Orthogonal 3-D graph drawing","volume":"3","author":"Biedl","year":"1999","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"10.1016\/S0304-3975(01)00408-X_BIB3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02522826","article-title":"Three-dimensional graph drawing","volume":"17","author":"Cohen","year":"1997","journal-title":"Algorithmica"},{"year":"1999","series-title":"Graph Drawing","author":"Di Battista","key":"10.1016\/S0304-3975(01)00408-X_BIB4"},{"key":"10.1016\/S0304-3975(01)00408-X_BIB5","doi-asserted-by":"crossref","unstructured":"G. Di Battista, M. Patrignani, F. Vargiu, A split and push approach to 3D orthogonal drawing, J. Graph Algorithms Appl. 4(3) (2000) 105\u2013133, in: S.H. Whitesides, G. Liotta (Eds.), Special Issue on Selected Papers from the 1998 Symposium on Graph Drawing.","DOI":"10.7155\/jgaa.00027"},{"issue":"3","key":"10.1016\/S0304-3975(01)00408-X_BIB6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/S0895480194264010","article-title":"Angles of planar triangular graphs","volume":"9","author":"Di Battista","year":"1996","journal-title":"SIAM J. Discrete Math."},{"year":"1992","series-title":"Nanosystems Molecular Machinery, Manufacturing and Computation","author":"Drexler","key":"10.1016\/S0304-3975(01)00408-X_BIB7"},{"key":"10.1016\/S0304-3975(01)00408-X_BIB8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0020-0190(96)00133-0","article-title":"The techniques of Kolmogorov and Bardzin for three dimensional orthogonal graph drawings","volume":"60","author":"Eades","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00408-X_BIB9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0166-218X(00)00172-4","article-title":"Three dimensional orthogonal graph drawing algorithms","volume":"103","author":"Eades","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(01)00408-X_BIB10","doi-asserted-by":"crossref","unstructured":"A. Garg, New results on drawing angle graphs, Comput. Geom. Theory Appl. 9(1\u20132) (1998) 43\u201382, in: G. Di Battista, R. Tamassia (Eds.), Special Issue on Geometric Representations of Graphs.","DOI":"10.1016\/S0925-7721(97)00016-3"},{"issue":"4","key":"10.1016\/S0304-3975(01)00408-X_BIB11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.7155\/jgaa.00019","article-title":"Algorithms for incremental orthogonal graph drawing in three dimensions","volume":"3","author":"Papakostas","year":"1999","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"10.1016\/S0304-3975(01)00408-X_BIB12","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","article-title":"On embedding a graph in the grid with the minimum number of bends","volume":"16","author":"Tamassia","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00408-X_BIB13","doi-asserted-by":"crossref","unstructured":"V. Vijayan, Geometry of planar graphs with angles, in: Proc. 2nd Ann. ACM Symp. Comput. Geom. 1986, Yorktown Heights NY, 2\u20134 June 1986, pp. 116\u2013124.","DOI":"10.1145\/10515.10528"},{"key":"10.1016\/S0304-3975(01)00408-X_BIB14","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/0214027","article-title":"Rectilinear graphs and their embeddings","volume":"14","author":"Vijayan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00408-X_BIB15","doi-asserted-by":"crossref","unstructured":"C. Ware, G. Franck, Viewing a graph in a virtual reality display is three times as good as a 2D diagram, in: Proc. IEEE Conf. on Visual Languages, St. Louis, Missouri, USA, October 1994, pp. 182\u2013183.","DOI":"10.1109\/VL.1994.363621"},{"key":"10.1016\/S0304-3975(01)00408-X_BIB16","unstructured":"D.R. Wood, Three-dimensional orthogonal graph drawing, Ph.D. Thesis, School of Computer Science and Software Engineering, Monash University, 2000."},{"key":"10.1016\/S0304-3975(01)00408-X_BIB17","first-page":"332","article-title":"An algorithm for three-dimensional orthogonal graph drawing","volume":"Vol. 1547","author":"Wood","year":"1998"},{"key":"10.1016\/S0304-3975(01)00408-X_BIB18","first-page":"311","article-title":"Multi-dimensional orthogonal graph drawing with small boxes","volume":"Vol. 1731","author":"Wood","year":"1999"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100408X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100408X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:24Z","timestamp":1759625544000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750100408X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S030439750100408X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00408-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Embedding problems for paths with direction constrained edges","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(01)00408-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}