{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:32:01Z","timestamp":1757626321900,"version":"3.44.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0167-9260(89)90071-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"41-50","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Feed-through river routing"],"prefix":"10.1016","volume":"8","author":[{"given":"Amnon","family":"Joseph","sequence":"first","affiliation":[]},{"given":"Ron Y.","family":"Pinter","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1979","series-title":"Graph Algorithms","author":"Even","key":"10.1016\/0167-9260(89)90071-0_BIB1"},{"article-title":"Optimal compaction of multiple two-component channels under river routing","year":"1986","author":"Heng","key":"10.1016\/0167-9260(89)90071-0_BIB2"},{"year":"1976","series-title":"Combinatorial Optimization\u2014Networks and Matroids","author":"Lawler","key":"10.1016\/0167-9260(89)90071-0_BIB3"},{"issue":"3","key":"10.1016\/0167-9260(89)90071-0_BIB4","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1137\/0212029","article-title":"Optimal placement for river routing","volume":"12","author":"Leiserson","year":"1983","journal-title":"SIAM J. Comput."},{"article-title":"The impact of layer assignment methods on layout algorithms for integrated circuits","year":"1982","author":"Pinter","key":"10.1016\/0167-9260(89)90071-0_BIB5"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926089900710?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926089900710?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:36:31Z","timestamp":1757453791000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926089900710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0167926089900710"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(89)90071-0","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1989,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Feed-through river routing","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(89)90071-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}