{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T20:50:27Z","timestamp":1770411027803,"version":"3.49.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,11,1]],"date-time":"1985-11-01T00:00:00Z","timestamp":499651200000},"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":10120,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1985,11]]},"DOI":"10.1016\/0166-218x(85)90030-7","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T11:17:01Z","timestamp":1034075821000},"page":"279-291","source":"Crossref","is-referenced-by-count":23,"title":["N-free posets as generalizations of series-parallel posets"],"prefix":"10.1016","volume":"12","author":[{"given":"M.","family":"Habib","sequence":"first","affiliation":[]},{"given":"R.","family":"Jegou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90030-7_BIB1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0167-5060(08)70060-8","article-title":"The jump number of dags and posets: an introduction","volume":"9","author":"Chein","year":"1980","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"10.1016\/0166-218X(85)90030-7_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1051\/ita\/1979130100031","article-title":"Nombre de sauts et graphes s\u00e9rie-parrall\u00e8les","volume":"13","author":"Cogis","year":"1979","journal-title":"RAIRO Inform. Th\u00e9or."},{"issue":"2","key":"10.1016\/0166-218X(85)90030-7_BIB3","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0603021","article-title":"Decomposition of directed graphs","volume":"3","author":"Cunningham","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(85)90030-7_BIB4","doi-asserted-by":"crossref","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","article-title":"A combinatorial decomposition theory","volume":"32","author":"Cunningham","year":"1980","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(85)90030-7_BIB5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","article-title":"Topology of series-parallel networks","volume":"10","author":"Duffin","year":"1965","journal-title":"J. Math. Analysis Appl."},{"key":"10.1016\/0166-218X(85)90030-7_BIB6","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","article-title":"Partially ordered sets","volume":"63","author":"Dushnik","year":"1941","journal-title":"Amer. J. Math."},{"issue":"1","key":"10.1016\/0166-218X(85)90030-7_BIB7","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1137\/0604016","article-title":"Minimizing setups for ordered sets: a linear algebraic approach","volume":"4","author":"Gierz","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(85)90030-7_BIB8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.4064\/fm-65-2-157-167","article-title":"Maximal chains and antichains","volume":"65","author":"Grillet","year":"1969","journal-title":"Fund. Math."},{"key":"10.1016\/0166-218X(85)90030-7_BIB9","series-title":"On some complexity properties of N-free posets","author":"Habib","year":"1985"},{"key":"10.1016\/0166-218X(85)90030-7_BIB10","series-title":"Selected Topics in Graph Theory","first-page":"271","author":"Hemminger","year":"1978"},{"key":"10.1016\/0166-218X(85)90030-7_BIB11","first-page":"743","article-title":"Sur une certaine correspondence entre graphes","volume":"33","author":"Heuchenne","year":"1964","journal-title":"Bull. Soc. Roy. Sci. Li\u00e8ge"},{"key":"10.1016\/0166-218X(85)90030-7_BIB12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","article-title":"Sequencing jobs to minimize total weighted completion time subject to precedence constraints","volume":"2","author":"Lawler","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(85)90030-7_BIB13","doi-asserted-by":"crossref","first-page":"11","DOI":"10.4064\/fm-79-1-11-22","article-title":"Orders C.A.C.","author":"Leclerc","year":"1973","journal-title":"Fund. Math."},{"key":"10.1016\/0166-218X(85)90030-7_BIB14","series-title":"Ordered Sets","first-page":"171","article-title":"Dimension theory for ordered sets","author":"Kelly","year":"1982"},{"key":"10.1016\/0166-218X(85)90030-7_BIB15","unstructured":"W.R. Pulleyblank, On minimizing setups in precedence constrained scheduling, Discrete Appl. Math., to appear."},{"key":"10.1016\/0166-218X(85)90030-7_BIB16","first-page":"509","article-title":"Optimal linear extensions by interchanging chains","volume":"85","author":"Rival","year":"1982"},{"key":"10.1016\/0166-218X(85)90030-7_BIB17","first-page":"355","article-title":"Linear extensions of finite ordered sets","author":"Rival","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(85)90030-7_BIB18","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/0020-0190(82)90080-1","article-title":"A labelling algorithm to recognize a line digraph and output its root digraph","volume":"15","author":"Syslo","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(85)90030-7_BIB19","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00396269","article-title":"Minimizing the jump number for ordered sets: a graph-theoretic approach","author":"Sysle","year":"1984","journal-title":"Order 1"},{"issue":"3","key":"10.1016\/0166-218X(85)90030-7_BIB20","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","article-title":"Linear-time computability of combinatorial problems on series-parallel graphs","volume":"29","author":"Takamizawa","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(85)90030-7_BIB21","series-title":"Proc. 11th Ann. ACM Symp. on Theory of Computing","first-page":"1","article-title":"The recognition of series-parallel digraphs","author":"Valdes","year":"1979"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900307?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900307?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T10:51:14Z","timestamp":1554893474000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,11]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,11]]}},"alternative-id":["0166218X85900307"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90030-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,11]]}}}