{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:46:41Z","timestamp":1649141201077},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0020-0190(92)90247-s","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"7-10","source":"Crossref","is-referenced-by-count":0,"title":["Deciding whether graph G has page number one is in NC"],"prefix":"10.1016","volume":"44","author":[{"given":"Shigeru","family":"Masuyama","sequence":"first","affiliation":[]},{"given":"Shozo","family":"Naito","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90247-S_BIB1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","article-title":"A simple parallel tree contraction algorithm","volume":"10","author":"Abramson","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(92)90247-S_BIB2","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","article-title":"The book thickness of a graph","volume":"27","author":"Bernhart","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(92)90247-S_BIB3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0608002","article-title":"Embedding graphs in books: A graph layout problem with applications to VLSI design","volume":"8","author":"Chung","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0020-0190(92)90247-S_BIB4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","article-title":"Topology of series-parallel networks","volume":"10","author":"Duffin","year":"1965","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0020-0190(92)90247-S_BIB5","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"key":"10.1016\/0020-0190(92)90247-S_BIB6","series-title":"Graph Theory","author":"Harary","year":"1959"},{"key":"10.1016\/0020-0190(92)90247-S_BIB7","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0196-6774(91)90012-N","article-title":"Efficient parallel algorithms for series parallel graphs","volume":"12","author":"He","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(92)90247-S_BIB8","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\/0020-0190(92)90247-S_BIB9","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(83)90003-3","article-title":"A linear algorithm for the domination number of a series-parallel graph","volume":"5","author":"Kikuno","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(92)90247-S_BIB10","first-page":"580","article-title":"Finding biconnected components and computing tree functions in logarithmic parallel time","volume":"13","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90247-S_BIB11","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","article-title":"Embedding planar graphs in four pages","volume":"38","author":"Yannakakis","year":"1989","journal-title":"J. Comput. System Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290247S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290247S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:29:01Z","timestamp":1555129741000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290247S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["002001909290247S"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90247-s","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}