{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T22:29:34Z","timestamp":1672698574593},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"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":[[1993,5]]},"DOI":"10.1016\/0020-0190(93)90206-o","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"103-107","source":"Crossref","is-referenced-by-count":3,"title":["A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs"],"prefix":"10.1016","volume":"46","author":[{"given":"Fillia","family":"Makedon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dafna","family":"Sheinwald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaron","family":"Wolfsthal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(93)90206-O_BIB1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1137\/0608002","article-title":"Embedding graphs in books: A layout problem with applications to VLSI layout","volume":"8","author":"Chung","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0020-0190(93)90206-O_BIB2","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0020-0190(93)90206-O_BIB3","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1137\/0134037","article-title":"Complexity results for bandwidth minimization","volume":"34","author":"Garey","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0020-0190(93)90206-O_BIB4","series-title":"Ph.D. Dissertation","article-title":"Layout problems and their complexity","author":"Makedon","year":"1982"},{"issue":"3","key":"10.1016\/0020-0190(93)90206-O_BIB5","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1137\/0403034","article-title":"One-page book embedding under vertex-neighborhood constraints","volume":"3","author":"Moran","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(93)90206-O_BIB6","doi-asserted-by":"crossref","unstructured":"S. Moran and Y. Wolfsthal, Two-page book embedding of trees under vertex-neighborhood constraints, Discrete Appl. Math., to appear.","DOI":"10.1016\/0166-218X(93)90114-4"},{"key":"10.1016\/0020-0190(93)90206-O_BIB7","series-title":"Research Rept. RJ-7610","article-title":"On graphs of bandwidth two and their recognition","author":"Sheinwald","year":"1990"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390206O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390206O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:03Z","timestamp":1555144023000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390206O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["002001909390206O"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90206-o","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}