{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T03:32:24Z","timestamp":1773199944293,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,2,1]],"date-time":"1985-02-01T00:00:00Z","timestamp":476064000000},"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":10393,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1985,2]]},"DOI":"10.1016\/0022-0000(85)90004-2","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"54-76","source":"Crossref","is-referenced-by-count":121,"title":["A linear algorithm for embedding planar graphs using PQ-trees"],"prefix":"10.1016","volume":"30","author":[{"given":"Norishige","family":"Chiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigenobu","family":"Abe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Ozawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0022-0000(85)90004-2_BIB1","first-page":"517","article-title":"On imbedding graphs in plane","volume":"11","author":"Auslander","year":"1961","journal-title":"J. Math. Mech."},{"key":"10.1016\/0022-0000(85)90004-2_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing 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."},{"key":"10.1016\/0022-0000(85)90004-2_BIB3","unstructured":"N. Chiba, T. Yamanouchi and T. Nishizeki, Linear algorithms for convex drawings of planar graphs, in \u201cProceedings of Silver Jubilee Conference on Combinatorics,\u201d Academic Press, in press."},{"key":"10.1016\/0022-0000(85)90004-2_BIB4","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0022-0000(85)90004-2_BIB5","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\/0022-0000(85)90004-2_BIB6","series-title":"Graph and Combinatories Conf., Contract No. NONR 1858-(21)","article-title":"An Efficient and Constructive Algorithm for Testing Whether a Graph Can Be Embedded in a Plane","author":"Goldstein","year":"1963"},{"key":"10.1016\/0022-0000(85)90004-2_BIB7","series-title":"Graph Theory","author":"Harary","year":"1972"},{"issue":"No. 3","key":"10.1016\/0022-0000(85)90004-2_BIB8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"issue":"No. 4","key":"10.1016\/0022-0000(85)90004-2_BIB9","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. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(85)90004-2_BIB10","series-title":"Theory of Graphs, Internat. Sympos. Rome, July 1966","first-page":"215","article-title":"An algorithm for planarity testing of graphs","author":"Lempel","year":"1967"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900042?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900042?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:52:08Z","timestamp":1550307128000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000085900042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["0022000085900042"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(85)90004-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}