{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:18Z","timestamp":1759637598336},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"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":8904,"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":[[1989,3]]},"DOI":"10.1016\/0304-3975(89)90011-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"295-302","source":"Crossref","is-referenced-by-count":39,"title":["Subgraph isomorphism for biconnected outerplanar graphs in cubic time"],"prefix":"10.1016","volume":"63","author":[{"given":"Andrzej","family":"Lingas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90011-X_BIB1","series-title":"Distributive Lattices","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(89)90011-X_BIB2","series-title":"Computers and Intractability. A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(89)90011-X_BIB3","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0304-3975(89)90011-X_BIB4","article-title":"Isomorphism of planar graphs","author":"Hopcroft","year":"1980","journal-title":"Proc. 4th Ann. symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(89)90011-X_BIB5","series-title":"Proc. 11th workshop on Graph-theoretic Concepts in Computer Science","first-page":"217","article-title":"Subgraph isomorphism for easily separable graphs of bounded valence","author":"Lingas","year":"1985"},{"key":"10.1016\/0304-3975(89)90011-X_BIB6","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0209046","article-title":"Applications of a planar separator theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90011-X_BIB7","series-title":"Proc. 21st Ann. symp. of Foundations of Computer Science","article-title":"Isomorphism of bounded valence can be tested in polynomial time","author":"Luks","year":"1980"},{"key":"10.1016\/0304-3975(89)90011-X_BIB8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0167-5060(08)70324-8","article-title":"Subtree isomorphism in O(n52)","volume":"2","author":"Matula","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0304-3975(89)90011-X_BIB9","article-title":"Isomorphism testing for graphs of bounded genus","author":"Miller","year":"1980","journal-title":"Proc. Ann. 12th ACM Symp. on Theory of Computing"},{"issue":"5","key":"10.1016\/0304-3975(89)90011-X_BIB10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","article-title":"Linear algorithms to recognize outerplanar and maximal outer-planar graphs","volume":"9","author":"Mitchell","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(89)90011-X_BIB11","series-title":"Graph Theory","author":"Mount","year":"1981"},{"key":"10.1016\/0304-3975(89)90011-X_BIB12","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1137\/0206053","article-title":"An analysis of a good algorithm for the subtree problem","volume":"6","author":"Reyner","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90011-X_BIB13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(82)90133-5","article-title":"The subgraph isomorphism problem for outerplanar graphs","volume":"17","author":"Syslo","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90011-X_BIB14","author":"Syslo","year":"1985","journal-title":"Personal communication"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758990011X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758990011X?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:55:22Z","timestamp":1555113322000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758990011X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["030439758990011X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90011-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}