{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T16:20:26Z","timestamp":1700497226347},"reference-count":28,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,7,1]],"date-time":"1985-07-01T00:00:00Z","timestamp":489024000000},"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":10243,"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,7]]},"DOI":"10.1016\/0166-218x(85)90079-4","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"281-297","source":"Crossref","is-referenced-by-count":6,"title":["A compact labeling scheme for series-parallel graphs"],"prefix":"10.1016","volume":"11","author":[{"given":"George","family":"Steiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90079-4_BIB1","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF02023922","article-title":"On graphs in which teo vertices are distinguished","volume":"12","author":"Adam","year":"1961","journal-title":"Acta. Math. Acad. Sci. Hungarica"},{"key":"10.1016\/0166-218X(85)90079-4_BIB2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","article-title":"The transitive reduction of a directed graph","volume":"1","author":"Aho","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(85)90079-4_BIB3","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.26.3.444","article-title":"Dynamic programming solution for sequencing problems with precedence constraints","volume":"26","author":"Baker","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(85)90079-4_BIB4","doi-asserted-by":"crossref","DOI":"10.1287\/opre.29.6.1195","article-title":"Single machine scheduling with series-parallel precedence constraints","author":"Burns","year":"1981"},{"key":"10.1016\/0166-218X(85)90079-4_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. Anal. Appl."},{"key":"10.1016\/0166-218X(85)90079-4_BIB6","article-title":"Computers and Intractability: A Guide to the Theory of NP Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(85)90079-4_BIB7","first-page":"196","article-title":"A dynamic programming approach to sequencing problems","volume":"10","author":"Held","year":"1962","journal-title":"J. SIAM"},{"key":"10.1016\/0166-218X(85)90079-4_BIB8","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1287\/opre.11.3.442","article-title":"Assembly line balancing","volume":"11","author":"Held","year":"1967","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(85)90079-4_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.8.1.1","article-title":"On knapsacks, partitions and a new dynamic programming technique for trees","volume":"8","author":"Johnson","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(85)90079-4_BIB10","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/opre.30.2.375","article-title":"On dynamic programming methods for assembly line balancing","volume":"30","author":"Kao","year":"1982","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(85)90079-4_BIB11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(83)90003-3","article-title":"A linear algorithm for the domination number of a series-parallel graph","volume":"5","author":"Kikuno","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(85)90079-4_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)90079-4_BIB13","article-title":"Sequencing problems with series-parallel precedence constraints","author":"Lawler","year":"1978"},{"key":"10.1016\/0166-218X(85)90079-4_BIB14","unstructured":"E.L. Lawler, Efficient implementation of dynamic programming algorithm for sequencing problems Report BW106\/79, Math. Centrum, Amsterdam."},{"key":"10.1016\/0166-218X(85)90079-4_BIB15","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","article-title":"Fast approximation algorithms for knapsack problems","volume":"3","author":"Lawler","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(85)90079-4_BIB16","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/opre.26.1.22","article-title":"Complexity of scheduling under precedence constraints","volume":"26","author":"Lenstra","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(85)90079-4_BIB17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(85)90079-4_BIB18","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1287\/opre.27.4.792","article-title":"Two-machine flow-shop problem with series-parallel precedence relations: An algorithm and extensions","volume":"27","author":"Monma","year":"1979","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(85)90079-4_BIB19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/moor.4.3.215","article-title":"Sequencing with series-parallel precedence constraints","volume":"4","author":"Monma","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(85)90079-4_BIB20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/sapm194221183","article-title":"The number of two terminal series-parallel networks","volume":"21","author":"Riordan","year":"1942","journal-title":"J. Math. Physics"},{"key":"10.1016\/0166-218X(85)90079-4_BIB21","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1287\/opre.27.4.782","article-title":"The two-machine flow time problem with series-parallel precedence constraints","volume":"27","author":"Sidney","year":"1979","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(85)90079-4_BIB22","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/moor.9.2.248","article-title":"Single machine scheduling with precedence constraints of dimension 2","volume":"9","author":"Steiner","year":"1984","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(85)90079-4_BIB23","series-title":"Ph.D. thesis","article-title":"Machine scheduling with precedence constraints","author":"Steiner","year":"1982"},{"key":"10.1016\/0166-218X(85)90079-4_BIB24","article-title":"Linear-time computability of combinatorial problems on series-parallel graphs","volume":"29","author":"Tamikazawa","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(85)90079-4_BIB25","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithm","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(85)90079-4_BIB26","article-title":"Parsing flowcharts and series-parallel graphs","author":"Valdes","year":"1978"},{"key":"10.1016\/0166-218X(85)90079-4_BIB27","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(85)90079-4_BIB28","series-title":"Aspects of Network and System Theory","article-title":"Linear graphs: theorems, algorithms","author":"Weinberg","year":"1971"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900794?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900794?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T04:27:21Z","timestamp":1554784041000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,7]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,7]]}},"alternative-id":["0166218X85900794"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90079-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,7]]}}}