{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T19:29:09Z","timestamp":1675798149309},"reference-count":9,"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)90017-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:50Z","timestamp":1027654310000},"page":"279-295","source":"Crossref","is-referenced-by-count":8,"title":["Minimizing the jump number for partially-ordered sets: a graph-theoretic approach, II"],"prefix":"10.1016","volume":"63","author":[{"given":"Maciej M.","family":"Sys\u0141o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(87)90017-3_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)90017-3_BIB2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00383598","article-title":"Minimizing setups in ordered sets of fixed width","volume":"1","author":"Colbourn","year":"1985","journal-title":"Order"},{"key":"10.1016\/0012-365X(87)90017-3_BIB3","doi-asserted-by":"crossref","unstructured":"N. Habib and R. M\u00f6hring, On some complexity properties of N-free posets and posets with bounded decomposition diameter, Discrete Math., this issue.","DOI":"10.1016\/0012-365X(87)90006-9"},{"key":"10.1016\/0012-365X(87)90017-3_BIB4","unstructured":"W.R. Pulleyblank, On minimizing setups in precedence-constrained scheduling, Discrete Appl. Math., to appear."},{"key":"10.1016\/0012-365X(87)90017-3_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)90017-3_BIB6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00396269","article-title":"Minimizing the jump number for partially-ordered sets: a graph-theoretic approach","volume":"1","author":"Sys\u0142o","year":"1985","journal-title":"Order"},{"key":"10.1016\/0012-365X(87)90017-3_BIB7","series-title":"Graphs and Order","first-page":"185","article-title":"A graph-theoretic approach to the jump number problem","author":"Sys\u0142o","year":"1985"},{"key":"10.1016\/0012-365X(87)90017-3_BIB8","series-title":"Research Report N-157","article-title":"On some new types of greedy chains and greedy linear extensions","author":"Sys\u0142o","year":"1986"},{"key":"10.1016\/0012-365X(87)90017-3_BIB9","series-title":"Research Report N-158","article-title":"An algorithm for solving the jump number problem","author":"Sys\u0142o","year":"1986"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87900173?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87900173?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:27:45Z","timestamp":1555154865000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X87900173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":9,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0012365X87900173"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(87)90017-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}