{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T13:57:49Z","timestamp":1768917469266,"version":"3.49.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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":5130,"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":[[1999,7]]},"DOI":"10.1016\/s0304-3975(98)00120-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:38:06Z","timestamp":1027604286000},"page":"179-191","source":"Crossref","is-referenced-by-count":38,"title":["A new planarity test"],"prefix":"10.1016","volume":"223","author":[{"given":"Shih","family":"Wei-Kuan","sequence":"first","affiliation":[]},{"given":"Hsu","family":"Wen-Lian","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00120-0_BIB1","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\/S0304-3975(98)00120-0_BIB2","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1137\/0222068","article-title":"An O(m log n)-time algorithm for the maximal planar subgraph problem","volume":"22","author":"Cai","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00120-0_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\/S0304-3975(98)00120-0_BIB4","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\/S0304-3975(98)00120-0_BIB5","unstructured":"A. Lempel, S. Even, I. Cederbaum, An algorithm for planarity testing of graphs, in: P. Rosenstiehl (Ed.), Theory of Graphs, Gordon and Breach, New York, pp. 215\u2013232."},{"key":"10.1016\/S0304-3975(98)00120-0_BIB6","first-page":"93","article-title":"Graph algorithms and NP-completeness","volume":"2","author":"Mehlhorn","year":"1984","journal-title":"Data Struct. Algor."},{"key":"10.1016\/S0304-3975(98)00120-0_BIB7_1","unstructured":"K. Mehlhorn, P. Mutzel, On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm, to appear in Algorithmica"},{"key":"10.1016\/S0304-3975(98)00120-0_BIB7_2","author":"Mehlhorn","year":"1994"},{"key":"10.1016\/S0304-3975(98)00120-0_BIB8","series-title":"Proc. ALCOM Internat. Workshop on Graph Drawing","article-title":"A unified approach of testing, embedding and drawing planar graphs","author":"Small","year":"1993"},{"key":"10.1016\/S0304-3975(98)00120-0_BIB9","series-title":"Proc. ALCOM Internat. Workshop on Graph Drawing","article-title":"A simple linear-time algorithm for embedding maximal planar graphs","author":"Stamm-Wilbrandt","year":"1993"},{"key":"10.1016\/S0304-3975(98)00120-0_BIB10","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1145\/1634.322451","article-title":"Depth-first search and Kuratowski subgraphs","volume":"31","author":"Williamson","year":"1984","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001200?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001200?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:27:46Z","timestamp":1556522866000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0304397598001200"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00120-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}