{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:32:29Z","timestamp":1648618349765},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,1,28]],"date-time":"2012-01-28T00:00:00Z","timestamp":1327708800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s11083-012-9246-4","type":"journal-article","created":{"date-parts":[[2012,1,26]],"date-time":"2012-01-26T21:57:23Z","timestamp":1327615043000},"page":"339-350","source":"Crossref","is-referenced-by-count":0,"title":["The Arboreal Jump Number of an Order"],"prefix":"10.1007","volume":"30","author":[{"given":"Adriana P.","family":"Figueiredo","sequence":"first","affiliation":[]},{"given":"Michel","family":"Habib","sequence":"additional","affiliation":[]},{"given":"Sulamita","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Jayme Luiz","family":"Szwarcfiter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,28]]},"reference":[{"key":"9246_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0166-218X(94)90111-2","volume":"51","author":"A Arnim von","year":"1994","unstructured":"von Arnim, A., de la Higuera, C.: Computing the jump number on semi-orders is polynomial. Discrete Appl. Math. 51, 219\u2013232 (1994)","journal-title":"Discrete Appl. Math."},{"key":"9246_CR2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1008625405476","volume":"8","author":"L Bianco","year":"1997","unstructured":"Bianco, L., Dell\u2019olmo, P., Giordani, S.: An optimal algorithm to find the jump number of partially ordered sets. Comput. Optim. Appl. 8, 197\u2013210 (1997)","journal-title":"Comput. Optim. Appl."},{"key":"9246_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00337693","volume":"4","author":"V Bouchitt\u00e9","year":"1987","unstructured":"Bouchitt\u00e9, V., Habib, M.: NP-completeness properties about linear extensions. Order 4, 143\u2013154 (1987)","journal-title":"Order"},{"key":"9246_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1051\/ita\/1979130100031","volume":"13","author":"O Cogis","year":"1979","unstructured":"Cogis, O., Habib, M.: Nombre de sauts et graphes serie-parall\u00e9ls. RAIRO Inform. Theor. 13, 3\u201318 (1979)","journal-title":"RAIRO Inform. Theor."},{"key":"9246_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00383598","volume":"1","author":"CJ Colburn","year":"1985","unstructured":"Colburn, C.J., Pulleyblank, W.R.: Minimizing setups in ordered sets of fixed width. Order 1, 225\u2013229 (1985)","journal-title":"Order"},{"key":"9246_CR6","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1090\/S0002-9939-1982-0660592-3","volume":"85","author":"D Duffus","year":"1982","unstructured":"Duffus, D., Rival, I., Winkler, P.: Minimizing setups for cycle-free ordered sets. Proc. Am. Math. Soc. 85, 509\u2013513 (1982)","journal-title":"Proc. Am. Math. Soc."},{"key":"9246_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0167-6377(85)90027-6","volume":"4","author":"U Faigle","year":"1995","unstructured":"Faigle, U., Schrader, R.: A setup heuristic for interval orders. Oper. Res. Lett. 4, 185\u2013188 (1995)","journal-title":"Oper. Res. Lett."},{"key":"9246_CR8","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00346129","volume":"6","author":"S Felsner","year":"1990","unstructured":"Felsner, S.: A 3\/2-approximation algorithm for the jump number of interval orders. Order 6, 325\u2013334 (1990)","journal-title":"Order"},{"key":"9246_CR9","unstructured":"Felsner, S.: Bounds for the Jump Number of Partially Ordered Sets. TU Berlin (1991)"},{"key":"9246_CR10","first-page":"371","volume-title":"Ordres - Description et R\u00f4les","author":"M Habib","year":"1984","unstructured":"Habib, M.: Comparability invariants. In: Pouzet, M., Richard, D. (eds.) Ordres - Description et R\u00f4les, pp. 371\u2013386. North-Holland, Amsterdam (1984)"},{"key":"9246_CR11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(85)90030-7","volume":"12","author":"M Habib","year":"1985","unstructured":"Habib, M., Jegou, R.: N-free posets as generalizations of series-parallel posets. Discrete Appl. Math. 12, 279\u2013291 (1985)","journal-title":"Discrete Appl. Math."},{"key":"9246_CR12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0012-365X(87)90006-9","volume":"63","author":"M Habib","year":"1987","unstructured":"Habib, M., M\u00f6hring, R.: On some complexity properties of N-free posets with bounded decomposition diameter. Discrete Math. 63, 157\u2013182 (1987)","journal-title":"Discrete Math."},{"key":"9246_CR13","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF00390105","volume":"3","author":"D Kelly","year":"1986","unstructured":"Kelly, D.: Invariants of finite comparability graphs. Order 3, 155\u2013158 (1986)","journal-title":"Order"},{"key":"9246_CR14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00383398","volume":"8","author":"J Mitas","year":"1992","unstructured":"Mitas, J.: Tackling the jump number of interval orders. Order 8, 115\u2013132 (1992)","journal-title":"Order"},{"key":"9246_CR15","unstructured":"Pulleyblank, W.R.: On minimizing setups in precedence constraints scheduling. Manuscript (1981)"},{"key":"9246_CR16","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1090\/S0002-9939-1983-0715851-3","volume":"89","author":"I Rival","year":"1983","unstructured":"Rival, I.: Optimal linear extensions by interchanging chains. Proc. Am. Math. Soc. 89, 387\u2013394 (1983)","journal-title":"Proc. Am. Math. Soc."},{"key":"9246_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00337920","volume":"2","author":"G Steiner","year":"1986","unstructured":"Steiner, G.: On finding the jump number of a partial order by substitution decomposition. Order 2, 9\u201323 (1986)","journal-title":"Order"},{"key":"9246_CR18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00396269","volume":"1","author":"MM Syslo","year":"1984","unstructured":"Syslo, M.M.: Minimizing the jump number of a partially ordered set: a graph theoretic approach. Order 1, 7\u201319 (1984)","journal-title":"Order"},{"key":"9246_CR19","first-page":"195","volume-title":"Graphs and Orders","author":"MM Syslo","year":"1985","unstructured":"Syslo, M.M.: A graph theoretic approach to the jump number problem. In: Rival, I. (ed.) Graphs and Orders, pp. 195\u2013215. D. Reidel, Dordrecht (1985)"},{"key":"9246_CR20","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0012-365X(88)90224-5","volume":"72","author":"MM Syslo","year":"1988","unstructured":"Syslo, M.M.: An algorithm for solving the jump number problem. Discrete Math. 72, 337\u2013346 (1988)","journal-title":"Discrete Math."},{"key":"9246_CR21","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0012-365X(94)00290-Y","volume":"144","author":"MM Syslo","year":"1995","unstructured":"Syslo, M.M.: The jump number problem on interval orders - a 3\/2 approximation algorithm. Discrete Math. 144, 119\u2013130 (1995)","journal-title":"Discrete Math."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-012-9246-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-012-9246-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-012-9246-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:12:15Z","timestamp":1559351535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-012-9246-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,28]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9246"],"URL":"https:\/\/doi.org\/10.1007\/s11083-012-9246-4","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,28]]}}}