{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:06:35Z","timestamp":1759190795938,"version":"3.44.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999,1]]},"DOI":"10.1016\/s0167-9260(98)00015-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:24:04Z","timestamp":1027610644000},"page":"47-56","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Provably good moat routing"],"prefix":"10.1016","volume":"27","author":[{"given":"J.L","family":"Ganley","sequence":"first","affiliation":[]},{"given":"J.P","family":"Cohoon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-9260(98)00015-7_BIB1","doi-asserted-by":"crossref","unstructured":"D.C. Wang, Pad placement and ring routing for custom chip layout, Proc. 27th Design Automation Conf. 1990, pp. 193\u2013199.","DOI":"10.1145\/123186.109845"},{"key":"10.1016\/S0167-9260(98)00015-7_BIB2","doi-asserted-by":"crossref","unstructured":"R.K. McGehee, A practical moat router, Proc. 24th Design Automation Conf. 1987, pp. 216\u2013222.","DOI":"10.1145\/37888.37921"},{"key":"10.1016\/S0167-9260(98)00015-7_BIB3","doi-asserted-by":"crossref","unstructured":"A. Hashimoto, J. Stevens, Wire routing by optimizing channel assignment within large apertures, Proc. 8th Design Automation Conf. 1971, pp. 155\u2013163.","DOI":"10.1145\/800158.805069"},{"key":"10.1016\/S0167-9260(98)00015-7_BIB4","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","article-title":"The complexity of coloring circular arcs and chords","volume":"1","author":"Garey","year":"1980","journal-title":"SIAM J. Algebraic Discrete Meth."},{"year":"1980","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","key":"10.1016\/S0167-9260(98)00015-7_BIB5"},{"key":"10.1016\/S0167-9260(98)00015-7_BIB6","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval graphs and circular arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0167-9260(98)00015-7_BIB7","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/12.589233","article-title":"Minimum-congestion hypergraph embedding in a cycle","volume":"46","author":"Ganley","year":"1997","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(98)00015-7_BIB8","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(91)90165-E","article-title":"Linear time algorithms on circular-arc graphs","volume":"40","author":"Hsu","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0167-9260(98)00015-7_BIB9","doi-asserted-by":"crossref","unstructured":"B.T. Preas Benchmarks for cell-based layout systems, Proc. 24th Design Automation Conf. 1987, pp. 319\u2013320.","DOI":"10.1145\/37888.37936"},{"key":"10.1016\/S0167-9260(98)00015-7_BIB10","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1109\/JSSC.1985.1052337","article-title":"The TimberWolf placement and routing package","volume":"20","author":"Sechen","year":"1985","journal-title":"IEEE J. Solid-State Circuits"},{"key":"10.1016\/S0167-9260(98)00015-7_BIB11","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0166-218X(92)90007-W","article-title":"Algorithms for routing around a rectangle","volume":"40","author":"Frank","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-9260(98)00015-7_BIB12","unstructured":"J.L. Ganley, J.P. Cohoon, A provably good moat routing algorithm, Proc. 6th Great Lakes Symp. on VLSI, 1996, pp. 86\u201391."},{"key":"10.1016\/S0167-9260(98)00015-7_BIB13","unstructured":"J.L. Ganley, Geometric interconnection and placement algorithms, Ph.D. Thesis, Department of Computer Science, University of Virginia, Charlottesville, Virginia, 1995."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926098000157?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926098000157?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:10:10Z","timestamp":1759137010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926098000157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0167926098000157"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(98)00015-7","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1999,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Provably good moat routing","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(98)00015-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}