乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T20:29:39Z","timestamp":1723235379985},"reference-count":18,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":6864,"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":[[1994,10]]},"DOI":"10.1016\/0166-218x(94)90021-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"169-213","source":"Crossref","is-referenced-by-count":38,"title":["Obstruction set isolation for the gate matrix layout problem"],"prefix":"10.1016","volume":"54","author":[{"given":"Nancy G.","family":"Kinnersley","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90021-3_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(94)90021-3_BIB2","first-page":"397","article-title":"On finding obstruction sets and polynomial-time algorithms for gate matrix layout","author":"Bryant","year":"1987","journal-title":"Proceedings of the 25th Allerton Conference on Communication, Control, and Computing"},{"key":"10.1016\/0166-218X(94)90021-3_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207168908803783","article-title":"Polynomial-time self-reducibility: theoretical motivations and practical results","volume":"31","author":"Brown","year":"1989","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0166-218X(94)90021-3_BIB4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/TCAD.1987.1270248","article-title":"Exact and approximate solutions for the gate matrix layout problem","volume":"6","author":"Deo","year":"1987","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/0166-218X(94)90021-3_BIB5","doi-asserted-by":"crossref","unstructured":"J.A. Ellis, I.H. Sudborough and J.S. Turner, The vertex separation and search number of a graph, Inform. and Comput., to appear.","DOI":"10.1006\/inco.1994.1064"},{"key":"10.1016\/0166-218X(94)90021-3_BIB6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(87)90054-8","article-title":"Nonconstructive advances in polynomial-time complexity","volume":"26","author":"Fellows","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(94)90021-3_BIB7","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1145\/44483.44491","article-title":"Nonconstructive tools for providing polynomial-time decidability","volume":"35","author":"Fellows","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)90021-3_BIB8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/0405010","article-title":"On well-partial-order theory and its application to combinatorial problems of VLSI design","volume":"5","author":"Fellows","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(94)90021-3_BIB9","first-page":"325","article-title":"Fast search algorithms for layout permutation problems","volume":"3","author":"Fellows","year":"1991","journal-title":"Internat. J. Comput. Aided VLSI Design"},{"key":"10.1016\/0166-218X(94)90021-3_BIB10","first-page":"501","article-title":"On search, decision and the efficiency of polynomial-time algorithms","author":"Fellows","year":"1989","journal-title":"Proceedings of the 21st ACM Symposium on the Theory of Computing"},{"key":"10.1016\/0166-218X(94)90021-3_BIB11","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(94)90021-3_BIB12","series-title":"Ph.D. Thesis","article-title":"Obstruction set isolation for layout permutation problems","author":"Kinnersley","year":"1989"},{"key":"10.1016\/0166-218X(94)90021-3_BIB13","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","article-title":"Sur le probleme des curbes gauches en topologie","volume":"15","author":"Kuratowski","year":"1930","journal-title":"Fund. Math."},{"key":"10.1016\/0166-218X(94)90021-3_BIB14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors I. Excluding a forest","volume":"35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(94)90021-3_BIB15","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","article-title":"Graph minors V. Excluding a planar graph","volume":"41","author":"Robertson","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(94)90021-3_BIB16","unstructured":"N. Robertson and P.D. Seymour, Graph minors XIII. The disjoint paths problems, to appear."},{"key":"10.1016\/0166-218X(94)90021-3_BIB17","unstructured":"N. Robertson and P.D. Seymour, Graph minors XVI. Wagner's conjecture, to appear."},{"key":"10.1016\/0166-218X(94)90021-3_BIB18","unstructured":"P.D. Seymour, private communication."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900213?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900213?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:29:23Z","timestamp":1555136963000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94900213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0166218X94900213"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90021-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}