{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T04:29:24Z","timestamp":1781584164568,"version":"3.54.5"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8478,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["62550253"],"award-info":[{"award-number":["62550253"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0166-218x(90)90136-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"157-178","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Edge-disjoint paths in a grid bounded by two nested rectangles"],"prefix":"10.1016","volume":"27","author":[{"given":"Hitoshi","family":"Suzuki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Akira","family":"Ishiguro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90136-Z_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0166-218X(90)90136-Z_BIB2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF00289496","article-title":"Algorithm for routing in planar graphs","volume":"23","author":"Becker","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0166-218X(90)90136-Z_BIB3","first-page":"245","article-title":"VLSI routing: Four layers suffice","volume":"2","author":"Brady","year":"1984","journal-title":"VLSI Theory, Adv. Comput. Res."},{"issue":"4","key":"10.1016\/0166-218X(90)90136-Z_BIB4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF02579432","article-title":"Disjoint paths in rectilinear grids","volume":"2","author":"Frank","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(90)90136-Z_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(90)90136-Z_BIB6","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/0196-6774(86)90016-7","article-title":"Routing through a generalized switchbox","volume":"7","author":"Kaufmann","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(90)90136-Z_BIB7","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/0196-6774(87)90017-4","article-title":"On the routability of a convex grid","volume":"8","author":"Lai","year":"1987","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/0166-218X(90)90136-Z_BIB8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/0214023","article-title":"An efficient algorithm for finding multicommodity flows in planar networks","volume":"14","author":"Matsumoto","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0166-218X(90)90136-Z_BIB9","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/4904.4994","article-title":"Routing through a rectangle","volume":"33","author":"Mehlhorn","year":"1986","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0166-218X(90)90136-Z_BIB10","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/TCAD.1985.1270099","article-title":"A linear-time routing algorithm for convex grids","volume":"4","author":"Nishizeki","year":"1985","journal-title":"IEEE Trans. Comput.-Aided Design"},{"key":"10.1016\/0166-218X(90)90136-Z_BIB11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(83)90100-2","article-title":"Multicommodity flows in graphs","volume":"6","author":"Okamura","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(90)90136-Z_BIB12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","article-title":"Multicommodity flows in planar graphs","volume":"31","author":"Okamura","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(90)90136-Z_BIB13","first-page":"195","article-title":"Multicommodity flows in planar undirected graphs and shortest paths","author":"Suzuki","year":"1985","journal-title":"Proceedings 17th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(90)90136-Z_BIB14","first-page":"23","article-title":"A variable priority queue and its applications","author":"Suzuki","year":"1986","journal-title":"Inst. Elect. and Commun. Eng. of Japan"},{"key":"10.1016\/0166-218X(90)90136-Z_BIB15","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/BF01553903","article-title":"Algorithms for multicommodity flows in planar graphs","volume":"4","author":"Suzuki","year":"1989","journal-title":"Algorithmica"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090136Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090136Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:52:52Z","timestamp":1757451172000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090136Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["0166218X9090136Z"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90136-z","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Edge-disjoint paths in a grid bounded by two nested rectangles","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0166-218X(90)90136-Z","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}