{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T10:38:38Z","timestamp":1648550318171},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3490,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0012-365x(03)00305-4","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T22:32:50Z","timestamp":1063751570000},"page":"43-57","source":"Crossref","is-referenced-by-count":0,"title":["Orthogonal drawings based on the stratification of planar graphs"],"prefix":"10.1016","volume":"276","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Le Sa\u00ebc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Mosbah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0012-365X(03)00305-4_BIB1","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","article-title":"A layout algorithm for data-flow diagrams","volume":"SE-12","author":"Batini","year":"1986","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0012-365X(03)00305-4_BIB2","doi-asserted-by":"crossref","unstructured":"C. Batini, M. Talamo, R. Tamassia, Computer aided layout of entity-relationship diagrams, J. Systems and Software (1984) 163\u2013173.","DOI":"10.1016\/0164-1212(84)90006-2"},{"key":"10.1016\/S0012-365X(03)00305-4_BIB3","doi-asserted-by":"crossref","unstructured":"T. Beidl, M. Kaufmann, Area-efficient static and incremental graph drawings, in: Proceedings of the Fifth European Symposium on Algorithms (ESA\u201997), Lecture Notes in Computer Science, Vol. 1284, Springer, Berlin, 1997, pp. 37\u201352.","DOI":"10.1007\/3-540-63397-9_4"},{"key":"10.1016\/S0012-365X(03)00305-4_BIB4","doi-asserted-by":"crossref","unstructured":"N. Bonichon, B. Le Sa\u00ebc, M. Mosbah, Wagner's theorem on realizers, in: International Colloquium on Automata, Languages, and ProgrammingA2002 (ICALP2002), 2002.","DOI":"10.1007\/3-540-45465-9_89"},{"key":"10.1016\/S0012-365X(03)00305-4_BIB5","unstructured":"Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu, Orderly spanning trees with applications to graph encoding and graph drawing, in: Proceedings of the 12th Symposium on Discrete Algorithms, ACM and SIAM, 2001, pp. 506\u2013515."},{"key":"10.1016\/S0012-365X(03)00305-4_BIB6","unstructured":"N. Chiba, T. Nishizeki, Planar Graphs: Theory and Algorithms, Annals of Discrete Mathematics, Vol. 32, North-Holland, Amsterdam, 1988."},{"key":"10.1016\/S0012-365X(03)00305-4_BIB7","doi-asserted-by":"crossref","unstructured":"Richie Chin-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu, Compact encodings of planar graphs via canonical ordering and multiple parentheses, in: Proceedings of the 25th International Colloquium on Automata, Languages, and Programming (ICALP\u201998), Vol. 1443, 1998, pp. 118\u2013129.","DOI":"10.1007\/BFb0055046"},{"key":"10.1016\/S0012-365X(03)00305-4_BIB8","unstructured":"U. F\u00f6\u00dfmeier, G. Kant, M. Kaufmann, 2-visibility drawings of planar graphs, in: Graph Drawing (Proc. GD \u201996), Lecture Notes in Computer Science, Vol. 1190, Springer, Berlin, 1996, pp. 155\u2013168."},{"key":"10.1016\/S0012-365X(03)00305-4_BIB9","series-title":"Graph Drawing (Proceedings of GD \u201995)","first-page":"324","article-title":"On representation of some thickness-two graphs","volume":"Vol. 1027","author":"Hutchinson","year":"1996"},{"key":"10.1016\/S0012-365X(03)00305-4_BIB10","doi-asserted-by":"crossref","unstructured":"D.G. Kirkpatrick, S.K. Wismath, Weighted visibility graphs of bars and related flow problems, in: Proceedings of the First Workshop Algorithms Data Structures, Lecture Notes in Computer Science, Vol. 382, Springer, Berlin, 1989, pp. 325\u2013334.","DOI":"10.1007\/3-540-51542-9_28"},{"key":"10.1016\/S0012-365X(03)00305-4_BIB11","series-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"issue":"1","key":"10.1016\/S0012-365X(03)00305-4_BIB12","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/32.67575","article-title":"Towards the automatic generation of software diagrams","volume":"SE-17","author":"Protsko","year":"1984","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0012-365X(03)00305-4_BIB13","series-title":"Entity-Relationship Approach: Ten Years of Experience in Information Modeling, Proceedings of the Fifth International Conference on Entity-Relationship Approach, Dijon, France, November 17\u201319, 1986","first-page":"347","article-title":"A database designer's workbench","author":"Reiner","year":"1986"},{"key":"10.1016\/S0012-365X(03)00305-4_BIB14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF00353652","article-title":"Planar graphs and poset dimension","volume":"5","author":"Schnyder","year":"1989","journal-title":"Order"},{"key":"10.1016\/S0012-365X(03)00305-4_BIB15","unstructured":"W. Schnyder, Embedding planar graphs on the grid, Proceedings of the First ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 138\u2013148."},{"issue":"1","key":"10.1016\/S0012-365X(03)00305-4_BIB16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","article-title":"Automatic graph drawing and readability of diagrams","volume":"SMC-18","author":"Tamassia","year":"1988","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/S0012-365X(03)00305-4_BIB17","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","article-title":"A unified approach to visibility representations of planar graphs","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0012-365X(03)00305-4_BIB18","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/jgt.3190120306","article-title":"Rectilinear drawings of graphs","volume":"12","author":"Thomassen","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00305-4_BIB19","doi-asserted-by":"crossref","unstructured":"S.K. Wismath, Characterizing bar line-of-sight graphs, in: Proceedings of the First Annual ACM Symposium on Computational Geometry, 1985, pp. 147\u2013152.","DOI":"10.1145\/323233.323253"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03003054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03003054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T16:00:07Z","timestamp":1585152007000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03003054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0012365X03003054"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00305-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}