{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T05:47:20Z","timestamp":1726120040159},"reference-count":7,"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)90022-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"215-217","source":"Crossref","is-referenced-by-count":24,"title":["Combinatorial algorithms on a class of graphs"],"prefix":"10.1016","volume":"54","author":[{"given":"N.M.","family":"Korneyenko","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90022-1_BIB1","first-page":"303","article-title":"Topology of series-parallel networks","volume":"10","author":"Duffin","year":"1965","journal-title":"J. Math. Appl."},{"issue":"3","key":"10.1016\/0166-218X(94)90022-1_BIB2","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1145\/321892.321897","article-title":"Advances on the hamiltonian completion problem","volume":"22","author":"Goodman","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)90022-1_BIB3","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(94)90022-1_BIB4","first-page":"79","article-title":"Linear-time computability of combinatorial problems on series-parallel graphs","volume":"108","author":"Takamizawa","year":"1981"},{"issue":"3","key":"10.1016\/0166-218X(94)90022-1_BIB5","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","article-title":"Linear-time computability of combinatorial problems on series-parallel graphs","volume":"29","author":"Takamizawa","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)90022-1_BIB6_1","first-page":"1","article-title":"The recognition of series-parallel graphs","author":"Valdez","year":"1979","journal-title":"Proceedings 11th STOC"},{"key":"10.1016\/0166-218X(94)90022-1_BIB6_2","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"Valdez","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900221?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900221?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:18Z","timestamp":1555136958000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94900221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":7,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0166218X94900221"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90022-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}