{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:21Z","timestamp":1774449081937,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":6894,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0304-3975(94)90179-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"361-374","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":68,"title":["Drawing graphs in two layers"],"prefix":"10.1016","volume":"131","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90179-1_BIB1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamilton circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)90179-1_BIB2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01553888","article-title":"An efficient algorithm for maxdominance with applications","volume":"4","author":"Atallah","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(94)90179-1_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288531","article-title":"Some beautiful arguments using mathematical induction","volume":"13","author":"Dijkstra","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)90179-1_BIB4","first-page":"89","article-title":"Heuristics for reducing crossings in 2-layered networks","volume":"21A","author":"Eades","year":"1986","journal-title":"Ars Combin."},{"key":"10.1016\/0304-3975(94)90179-1_BIB5","series-title":"Proc. 1989 IEEE Workshop on Visual Languages","first-page":"13","article-title":"How to draw a directed graph","author":"Eades","year":"1989"},{"key":"10.1016\/0304-3975(94)90179-1_BIB6","series-title":"Proc. 9th Australian Computer Science Conf.","first-page":"327","article-title":"On an edge crossing problem","author":"Eades","year":"1986"},{"key":"10.1016\/0304-3975(94)90179-1_BIB7","first-page":"424","article-title":"How to draw a directed graph","volume":"13","author":"Eades","year":"1990","journal-title":"J. Inform. Process."},{"key":"10.1016\/0304-3975(94)90179-1_BIB8","series-title":"Tech. Report CS-89-09","article-title":"Algorithms for drawing graphs: an annotated bibliography","author":"Eades","year":"1989"},{"key":"10.1016\/0304-3975(94)90179-1_BIB9","series-title":"Tech. Report 108","article-title":"Edge crossings in drawings of bipartite graphs","author":"Eades","year":"1989"},{"key":"10.1016\/0304-3975(94)90179-1_BIB10","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1002\/spe.4380181104","article-title":"DAG \u2014 a program that draws directed graphs","volume":"18","author":"Gansner","year":"1988","journal-title":"Software Practice Experience"},{"key":"10.1016\/0304-3975(94)90179-1_BIB11","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(94)90179-1_BIB12","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","article-title":"Crossing number is NP-complete","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0304-3975(94)90179-1_BIB13","series-title":"Tech. Report CS-89-02","article-title":"A recursive algorithm for drawing hierarchical directed graphs","author":"Gschwind","year":"1989"},{"key":"10.1016\/0304-3975(94)90179-1_BIB14","series-title":"Algorithms and Data Structures (Proc. 3rd Workshop on Algorithms and Data Structures WADS'93)","first-page":"421","article-title":"On approximating the longest path in a graph","volume":"Vol. 709","author":"Karger","year":"1993"},{"key":"10.1016\/0304-3975(94)90179-1_BIB15","series-title":"Masters Thesis","article-title":"A view to graph layout problems","author":"Kelly","year":"1987"},{"key":"10.1016\/0304-3975(94)90179-1_BIB16","first-page":"149","article-title":"An optimal algorithm for the maximum two-chain problem","author":"Lou","year":"1990","journal-title":"SODA 90, Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0304-3975(94)90179-1_BIB17","series-title":"Tech. Report A-1988-1","article-title":"Experiments in drawing 2-level hierarchical graphs","author":"Makinen","year":"1988"},{"key":"10.1016\/0304-3975(94)90179-1_BIB18","series-title":"Tech. Report 87-07-08","article-title":"Automatic layout of large directed graphs","author":"Messinger","year":"1987"},{"key":"10.1016\/0304-3975(94)90179-1_BIB19","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1016\/0898-1221(89)90036-9","article-title":"An algorithm for the determination of a longest increasing subsequence in a sequence","volume":"17","author":"Orlowski","year":"1989","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0304-3975(94)90179-1_BIB20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/spe.4380201307","article-title":"EDGE: an extendible directed graph editor","volume":"20","author":"Paulich","year":"1990","journal-title":"Software Practice Experience"},{"key":"10.1016\/0304-3975(94)90179-1_BIB21","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/spe.4380170107","article-title":"A browser for directed graphs","volume":"17","author":"Rowe","year":"1987","journal-title":"Software Practice Experience"},{"key":"10.1016\/0304-3975(94)90179-1_BIB22","series-title":"VLSI Placement and Global Routing Using Simulated Annealing","author":"Sechen","year":"1988"},{"key":"10.1016\/0304-3975(94)90179-1_BIB23","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1080\/01969728708902150","article-title":"A cognitive approach for graph drawing","volume":"18","author":"Sugiyama","year":"1987","journal-title":"Cybernet. Systems"},{"key":"10.1016\/0304-3975(94)90179-1_BIB24","series-title":"Tech. Report 86","article-title":"Visualizing structural information: hierarchical drawing of a compound digraph","author":"Sugiyama","year":"1989"},{"key":"10.1016\/0304-3975(94)90179-1_BIB25","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","article-title":"Methods for visual understanding of hierarchical system structures","volume":"SMC-11","author":"Sugiyama","year":"1981","journal-title":"IEEE Trans. Systems Man Cybernet"},{"key":"10.1016\/0304-3975(94)90179-1_BIB26","series-title":"Computational Aspects of VLSI","author":"Ullman","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901791?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901791?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T14:18:33Z","timestamp":1762265913000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0304397594901791"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90179-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Drawing graphs in two layers","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(94)90179-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1994 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}