{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:20:26Z","timestamp":1770322826744,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["59550239 (1984"],"award-info":[{"award-number":["59550239 (1984"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0304-3975(85)90222-1","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T03:31:32Z","timestamp":1060313492000},"page":"249-267","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":40,"special_numbering":"C","title":["An approach to the subgraph homeomorphism problem"],"prefix":"10.1016","volume":"38","author":[{"given":"Takao","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90222-1_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(85)90222-1_BIB2","series-title":"Technical Report TGAL83-20","article-title":"A linear time algorithm for the subgraph homeomorphism problem for the fixed graph K3,3","author":"Asano","year":"1983"},{"key":"10.1016\/0304-3975(85)90222-1_BIB3","series-title":"Proc. 14th Annual ACM Symp. on Theory of Computing","first-page":"245","article-title":"Edge-deletion and edge-contraction problems","author":"Asano","year":"1982"},{"key":"10.1016\/0304-3975(85)90222-1_BIB4","first-page":"303","article-title":"Topology of series-parallel networks","volume":"10","author":"Duffin","year":"1965","journal-title":"J. Math. Appl."},{"key":"10.1016\/0304-3975(85)90222-1_BIB5","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","article-title":"Network flow and testing graph connectivity","volume":"4","author":"Even","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90222-1_BIB6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","article-title":"The directed subgraph homeomorphism problem","volume":"10","author":"Fortune","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90222-1_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(85)90222-1_BIB8","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1090\/S0002-9904-1943-08065-2","article-title":"A note on primitive skew curves","volume":"49","author":"Hall","year":"1943","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(85)90222-1_BIB9","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0304-3975(85)90222-1_BIB10","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."},{"key":"10.1016\/0304-3975(85)90222-1_BIB11","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\/0304-3975(85)90222-1_BIB12","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0196-6774(81)90037-7","article-title":"The NP-complete column: An ongoing guide","volume":"2","author":"Johnson","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(85)90222-1_BIB13","article-title":"Finding a subgraph homeomorphic to K3,3 in polynomial time","author":"Kaschube","year":"1984"},{"key":"10.1016\/0304-3975(85)90222-1_BIB14","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","article-title":"Sur le probl\u00e8me des curbes gauches en topologie","volume":"15","author":"Kuratowski","year":"1930","journal-title":"Fund. Math."},{"key":"10.1016\/0304-3975(85)90222-1_BIB15","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0022-0000(80)90057-4","article-title":"The subgraph homeomorphism problem","volume":"20","author":"LaPaugh","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90222-1_BIB16","first-page":"597","article-title":"An O(max(m, n)) algorithm for finding a subgraph homeomorphic to K4","volume":"29","author":"Liu","year":"1980"},{"key":"10.1016\/0304-3975(85)90222-1_BIB17","first-page":"460","article-title":"A structural characterization of planar combinatorial graphs","volume":"3","author":"MacLane","year":"1937","journal-title":"Duke Math. J."},{"key":"10.1016\/0304-3975(85)90222-1_BIB18","first-page":"259","article-title":"Algorithms for detecting series-parallel graphs and D-charts","volume":"59","author":"Nishizeki","year":"1976","journal-title":"Trans. Inst. Elect. Commun. Eng. Japan"},{"key":"10.1016\/0304-3975(85)90222-1_BIB19","series-title":"Graph Theory and Algorithms","first-page":"207","article-title":"The two disjoint path problem and wire routing design","volume":"108","author":"Ohtsuki","year":"1981"},{"key":"10.1016\/0304-3975(85)90222-1_BIB20","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0304-3975(85)90222-1_BIB21","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","article-title":"Disjoint paths in graphs","volume":"29","author":"Seymour","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(85)90222-1_BIB22","unstructured":"P.D. Seymour, Adjacency in binary matroids, European J. Combin., to appear."},{"key":"10.1016\/0304-3975(85)90222-1_BIB23","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/322203.322207","article-title":"A polynomial solution to the undirected two path problem","volume":"27","author":"Shiloach","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90222-1_BIB24","doi-asserted-by":"crossref","first-page":"261","DOI":"10.3233\/FI-1978-2117","article-title":"Efficient outerplanarity testing","volume":"II","author":"Syso","year":"1979","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/0304-3975(85)90222-1_BIB25","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90222-1_BIB26","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/03081088308817513","article-title":"Finding triconnected components of graphs","volume":"13","author":"Vo","year":"1983","journal-title":"Linear and Multilinear Algebra"},{"key":"10.1016\/0304-3975(85)90222-1_BIB27","unstructured":"S.G. Williamson, Finding a Kuratowski subgraph in linear time, IRMA Strasbourg, Preprint."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585902221?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585902221?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:51Z","timestamp":1757477931000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585902221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":27,"alternative-id":["0304397585902221"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90222-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An approach to the subgraph homeomorphism problem","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(85)90222-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1985 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}