{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:32:38Z","timestamp":1648935158926},"reference-count":4,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":8843,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1016\/0012-365x(89)90098-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"335-342","source":"Crossref","is-referenced-by-count":0,"title":["Scaffold permutations"],"prefix":"10.1016","volume":"75","author":[{"given":"P.","family":"Rosenstiehl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(89)90098-8_BIB1","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1145\/62212.62254","article-title":"Small sets supporting F\u00e1ry embedding of planar graphs","author":"de Fraysseix","year":"1988","journal-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0012-365X(89)90098-8_BIB2","first-page":"170","article-title":"Sorting Jordan sequences in linear time using level-linked search trees","volume":"68","author":"Hoffmann","year":"1986"},{"key":"10.1016\/0012-365X(89)90098-8_BIB3","first-page":"11","article-title":"Sorting and Searching","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0012-365X(89)90098-8_BIB4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/800061.808752","article-title":"Self-adjusting binary trees","author":"Sleator","year":"1983","journal-title":"Proc. Fifteenth Annual ACM Symp. on Theory of Computing"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89900988?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89900988?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:50:39Z","timestamp":1555120239000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X89900988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":4,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0012365X89900988"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(89)90098-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}