{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:12:10Z","timestamp":1778497930682,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"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":8386,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,8]]},"DOI":"10.1016\/0166-218x(90)90110-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"111-134","source":"Crossref","is-referenced-by-count":40,"title":["Fixed edge-length graph drawing is NP-hard"],"prefix":"10.1016","volume":"28","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[]},{"given":"Nicholas C.","family":"Wormald","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90110-X_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(90)90110-X_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0166-218X(90)90110-X_BIB3","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\/0166-218X(90)90110-X_BIB4","series-title":"Tech. Rept. 82","article-title":"Algorithms for automatic graph drawing: An annotated bibliography","author":"Eades","year":"1987"},{"key":"10.1016\/0166-218X(90)90110-X_BIB5","series-title":"A Guide to the Theory of NP-Completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"issue":"4","key":"10.1016\/0166-218X(90)90110-X_BIB6","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(90)90110-X_BIB7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0196-6774(82)90011-6","article-title":"The NP-completeness column: An ongoing guide","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(90)90110-X_BIB8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0196-6774(84)90045-2","article-title":"The NP-completeness column: An ongoing guide","volume":"5","author":"Johnson","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(90)90110-X_BIB9","series-title":"Combinatorial Optimization","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0166-218X(90)90110-X_BIB10","series-title":"Theory and Practice","article-title":"Combinatorial Algorithms","author":"Reingold","year":"1977"},{"key":"10.1016\/0166-218X(90)90110-X_BIB11","series-title":"Tech. Rept. CMU-CS-80-102","article-title":"Two papers on graph embedding problems","author":"Saxe","year":"1980"},{"key":"10.1016\/0166-218X(90)90110-X_BIB12","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF00289576","article-title":"The complexity of drawing trees nicely","volume":"18","author":"Supowit","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0166-218X(90)90110-X_BIB13","series-title":"Progress in Graph Theory","first-page":"43","article-title":"Plane representations of graphs","author":"Thomassen","year":"1984"},{"key":"10.1016\/0166-218X(90)90110-X_BIB14","doi-asserted-by":"crossref","first-page":"13","DOI":"10.4153\/CJM-1956-004-9","article-title":"A class of Abelian groups","volume":"8","author":"Tutte","year":"1956","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(90)90110-X_BIB15","first-page":"131","article-title":"Universality considerations in VLSI circuits","volume":"30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(90)90110-X_BIB16","unstructured":"S. Whitesides, Private communication (1986)."},{"key":"10.1016\/0166-218X(90)90110-X_BIB17","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1002\/jgt.3190070307","article-title":"Integer flows","volume":"7","author":"Younger","year":"1983","journal-title":"J. Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090110X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090110X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:57:26Z","timestamp":1555135046000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090110X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["0166218X9090110X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90110-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}