{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:06:23Z","timestamp":1751879183457},"reference-count":6,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"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":[[1987]]},"DOI":"10.1016\/0012-365x(87)90014-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:50Z","timestamp":1027654310000},"page":"249-260","source":"Crossref","is-referenced-by-count":7,"title":["Greedy linear extensions with constraints"],"prefix":"10.1016","volume":"63","author":[{"given":"Ivan","family":"Rival","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nejib","family":"Zaguia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(87)90014-8_BIB1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00383597","article-title":"On the greedy dimension of a partial order","volume":"1","author":"Bouchitt\u00e9","year":"1985","journal-title":"Order"},{"key":"10.1016\/0012-365X(87)90014-8_BIB2","doi-asserted-by":"crossref","unstructured":"O. Cogis and M. Habib, Nombre de sauts et graphes s\u00e9rie-parall\u00e8lles, RAIRO Inf. Th. 13(1) 3-18","DOI":"10.1051\/ita\/1979130100031"},{"key":"10.1016\/0012-365X(87)90014-8_BIB3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0166-218X(85)80005-6","article-title":"Greedy linear extensions to minimize jumps","volume":"11","author":"El-Zahar","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(87)90014-8_BIB4","series-title":"Ordered sets","first-page":"171","article-title":"Dimension theory for ordered sets","author":"Kelly","year":"1982"},{"key":"10.1016\/0012-365X(87)90014-8_BIB5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1090\/S0002-9939-1983-0715851-3","article-title":"Optimal linear extensions by interchanging chains","volume":"89","author":"Rival","year":"1983","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(87)90014-8_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/BF00390102","article-title":"Constructing greedy linear extensions by interchanging chains","volume":"3","author":"Rival","year":"1986","journal-title":"Order"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87900148?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87900148?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:10:09Z","timestamp":1580897409000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X87900148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":6,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0012365X87900148"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(87)90014-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}