{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:21:46Z","timestamp":1648966906980},"reference-count":3,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"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":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00294-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:10:32Z","timestamp":1027599032000},"page":"275-284","source":"Crossref","is-referenced-by-count":7,"title":["The edge versus path incidence matrix of series-parallel graphs and greedy packing"],"prefix":"10.1016","volume":"113","author":[{"given":"Alan J.","family":"Hoffman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00294-8_BIB1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0166-218X(85)90006-X","article-title":"Minimum cost flow algorithms for series-parallel networks","volume":"10","author":"Bein","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00294-8_BIB2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0012-365X(92)90555-T","article-title":"On simple combinatorial optimization problems","volume":"106\/107","author":"Hoffman","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(00)00294-8_BIB3","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/0097-3165(88)90039-8","article-title":"Greedy packing and series-parallel graphs","volume":"47","author":"Hoffman","year":"1988","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002948?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002948?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T05:52:56Z","timestamp":1556257976000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":3,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00002948"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00294-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}