{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T23:23:35Z","timestamp":1778887415020,"version":"3.51.4"},"reference-count":36,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9024,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,11]]},"DOI":"10.1016\/0304-3975(88)90123-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"175-198","source":"Crossref","is-referenced-by-count":192,"title":["Algorithms for plane representations of acyclic digraphs"],"prefix":"10.1016","volume":"61","author":[{"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90123-5_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 Engineering"},{"key":"10.1016\/0304-3975(88)90123-5_BIB2","article-title":"Lattice Theory","volume":"25","author":"Birkhoff","year":"1967"},{"key":"10.1016\/0304-3975(88)90123-5_BIB3","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/TSMC.1980.4308390","article-title":"Automatic display of hierarchized graphs for computer aided decision analysis","volume":"SMC-10","author":"Carpano","year":"1980","journal-title":"IEEE Trans. Systems, Man, and Cybernetics"},{"key":"10.1016\/0304-3975(88)90123-5_BIB4","series-title":"Progress in Graph Theory","first-page":"153","article-title":"Linear algorithms for convex drawings of planar graphs","author":"Chiba","year":"1984"},{"key":"10.1016\/0304-3975(88)90123-5_BIB5","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","article-title":"A linear algorithm for embedding planar graphs using PQ-trees","volume":"30","author":"Chiba","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90123-5_BIB6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF00264230","article-title":"Drawing planar graphs nicely","volume":"22","author":"Chiba","year":"1985","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(88)90123-5_BIB7","series-title":"Graph-Theoretic Concepts in Computer Science","first-page":"277","article-title":"An algorithm for testing planarity of hierarchical graphs","volume":"246","author":"Di Battista","year":"1987"},{"key":"10.1016\/0304-3975(88)90123-5_BIB8","series-title":"Tech. Rept. 60","article-title":"An NP-hard crossing number problem for bipartite graphs","author":"Eades","year":"1985"},{"key":"10.1016\/0304-3975(88)90123-5_BIB9","first-page":"89","article-title":"Heuristics for reducing crossings in 2-layered networks","volume":"21","author":"Eades","year":"1986","journal-title":"Ars Combin."},{"key":"10.1016\/0304-3975(88)90123-5_BIB10","series-title":"Tech. Rept. 69","article-title":"The median heuristics for drawing 2-layered networks","author":"Eades","year":"1986"},{"key":"10.1016\/0304-3975(88)90123-5_BIB11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","article-title":"Computing an st-numbering","volume":"2","author":"Even","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90123-5_BIB12","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0304-3975(88)90123-5_BIB13","first-page":"229","article-title":"On straight lines representations of planar graphs","volume":"11","author":"Fary","year":"1948","journal-title":"Acta Sci. Math. Szeged"},{"key":"10.1016\/0304-3975(88)90123-5_BIB14","first-page":"124","article-title":"The geometry of planar graphs","author":"Grunbaum","year":"1981","journal-title":"Proc. 8th British Combinatorial Conf."},{"key":"10.1016\/0304-3975(88)90123-5_BIB15","doi-asserted-by":"crossref","first-page":"636","DOI":"10.4153\/CJM-1975-074-0","article-title":"Planar lattices","volume":"27","author":"Kelly","year":"1975","journal-title":"Canad. J. Math."},{"key":"10.1016\/0304-3975(88)90123-5_BIB16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(81)90203-X","article-title":"On the dimension of partially ordered sets","volume":"35","author":"Kelly","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(88)90123-5_BIB17","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(87)90008-2","article-title":"Fundamentals of planar ordered sets","volume":"63","author":"Kelly","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(88)90123-5_BIB18","first-page":"914","article-title":"Graph representations in interactive layout design","author":"Otten","year":"1978","journal-title":"Proc. IEEE Internat. Symp. on Circuits and Systems"},{"key":"10.1016\/0304-3975(88)90123-5_BIB19","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0095-8956(76)90024-1","article-title":"Planar lattices and planar graphs","volume":"21","author":"Platt","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0304-3975(88)90123-5_BIB20","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/BF02187706","article-title":"Rectilinear planar layouts of planar graphs and bipolar orientations","volume":"1","author":"Rosenstiehl","year":"1986","journal-title":"Discrete & Comput. Geom."},{"key":"10.1016\/0304-3975(88)90123-5_BIB21","series-title":"A browser for directed graphs","author":"Rowe","year":"1986"},{"key":"10.1016\/0304-3975(88)90123-5_BIB22","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1090\/S0002-9939-1951-0041425-5","article-title":"Convex maps","volume":"2","author":"Stein","year":"1951","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(88)90123-5_BIB23","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230140202","article-title":"On minimal node-cost planar embeddings","volume":"14","author":"Storer","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0304-3975(88)90123-5_BIB24","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","article-title":"Methods for visual understanding of hierarchical systems","volume":"SMC-11","author":"Sugiyama","year":"1981","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"key":"10.1016\/0304-3975(88)90123-5_BIB25","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\/0304-3975(88)90123-5_BIB26","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\/0304-3975(88)90123-5_BIB27","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0095-8956(80)90083-0","article-title":"Planarity and duality of finite and infinite planar graphs","volume":"29","author":"Thomassen","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0304-3975(88)90123-5_BIB28","series-title":"Progress in Graph Theory","first-page":"43","article-title":"Plane representations of graphs","author":"Thomassen","year":"1984"},{"key":"10.1016\/0304-3975(88)90123-5_BIB29","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0095-8956(77)90048-X","article-title":"The dimension of planar posets","volume":"22","author":"Trotter","year":"1977","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0304-3975(88)90123-5_BIB30","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","article-title":"Convex representations of graphs","volume":"10","author":"Tutte","year":"1960","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0304-3975(88)90123-5_BIB31","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","article-title":"How to draw a graph","volume":"3","author":"Tutte","year":"1963","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0304-3975(88)90123-5_BIB32","first-page":"26","article-title":"Bemerkungen zum Vierfarbenproblem","volume":"46","author":"Wagner","year":"1936","journal-title":"Jber. Deutsch. Math.-Verein"},{"key":"10.1016\/0304-3975(88)90123-5_BIB33","first-page":"502","article-title":"Crossing theory and hierarchy mapping","volume":"SMC-7","author":"Warfield","year":"1977","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"key":"10.1016\/0304-3975(88)90123-5_BIB34","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0016-0032(69)90097-0","article-title":"An algorithm for straight-line representation of planar graphs","volume":"287","author":"Woo","year":"1969","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0304-3975(88)90123-5_BIB35","series-title":"Ph.D. Thesis (Tech. Rept. STAN-CS-82-943)","article-title":"Drawing planar graphs","author":"Woods","year":"1982"},{"key":"10.1016\/0304-3975(88)90123-5_BIB36","series-title":"Convex Figures","author":"Yaglom","year":"1961"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901235?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901235?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:54:46Z","timestamp":1555113286000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":36,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["0304397588901235"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90123-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}