{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T05:26:59Z","timestamp":1676784419124},"reference-count":4,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"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":9755,"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":[[1986,11]]},"DOI":"10.1016\/0166-218x(86)90051-x","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T16:34:42Z","timestamp":1032280482000},"page":"315-327","source":"Crossref","is-referenced-by-count":4,"title":["On BF-orderable graphs"],"prefix":"10.1016","volume":"15","author":[{"given":"Kurt","family":"Mehlhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd H.","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(86)90051-X_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellmann","year":"1958","journal-title":"Quart. Appl. Math."},{"issue":"3","key":"10.1016\/0166-218X(86)90051-X_BIB2","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."},{"key":"10.1016\/0166-218X(86)90051-X_BIB3","unstructured":"Th. Lengauer and K. Mehlhorn, VLSI complexity theory, efficient VLSI algorithms and the HILL design system, to appear in: J. Trullemans, ed., Algorithmics in VLSI, Proc. of the International Professorship in Computer Science (Academic Press, New York)."},{"key":"10.1016\/0166-218X(86)90051-X_BIB4","series-title":"Vol. 2: Graph Algorithms and NP-completeness","article-title":"Data Structures and Efficient Algorithms","author":"Mehlhorn","year":"1984"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X8690051X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X8690051X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T17:22:44Z","timestamp":1554830564000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X8690051X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":4,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["0166218X8690051X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(86)90051-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}