{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:19:56Z","timestamp":1648955996236},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"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":9482,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1987,8]]},"DOI":"10.1016\/0167-6423(87)90026-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:19:32Z","timestamp":1027657172000},"page":"85-89","source":"Crossref","is-referenced-by-count":2,"title":["Some algorithms based on the dual of Dilworth's theorem"],"prefix":"10.1016","volume":"9","author":[{"given":"Anne","family":"Kaldewaij","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0167-6423(87)90026-8_BIB1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. of Math."},{"key":"10.1016\/0167-6423(87)90026-8_BIB2","series-title":"The Science of Programming","first-page":"259","author":"Gries","year":"1981"},{"key":"10.1016\/0167-6423(87)90026-8_BIB3","doi-asserted-by":"crossref","first-page":"876","DOI":"10.2307\/2316481","article-title":"A dual of Dilworth's decomposition theorem","volume":"78","author":"Mirsky","year":"1971","journal-title":"Amer. Math. Month."},{"issue":"3","key":"10.1016\/0167-6423(87)90026-8_BIB4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0167-6423(84)90005-4","article-title":"Small programming exercises 5","volume":"4","author":"Rem","year":"1984","journal-title":"Sci. Comput. Programming"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900268?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900268?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:28:58Z","timestamp":1555072138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642387900268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["0167642387900268"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(87)90026-8","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}