{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T02:19:17Z","timestamp":1648606757598},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":7777,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0925-7721(92)90002-a","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:41:31Z","timestamp":1027654891000},"page":"203-226","source":"Crossref","is-referenced-by-count":1,"title":["A framework for 1-D compaction with forbidden region avoidance"],"prefix":"10.1016","volume":"1","author":[{"given":"Susanne","family":"Hambrusch","sequence":"first","affiliation":[]},{"given":"Hung-Yi","family":"Tu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(92)90002-A_BIB1","author":"Aho","year":"1974"},{"key":"10.1016\/0925-7721(92)90002-A_BIB2","first-page":"383","article-title":"Symbolic layout compaction review","author":"Boyer","year":"1988","journal-title":"Proceedings of 25th ACM\/IEEE Design Automation Conference"},{"key":"10.1016\/0925-7721(92)90002-A_BIB3","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","article-title":"Filtering search: A new approach to query-answering","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(92)90002-A_BIB4","first-page":"396","article-title":"Subjective review of compaction","author":"Cho","year":"1985","journal-title":"Proceedings of 22th ACM\/IEEE Design Automation Conference"},{"key":"10.1016\/0925-7721(92)90002-A_BIB5","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1137\/0216064","article-title":"Fast algorithms for shortest paths in planar graphs, with applications","volume":"16","author":"Frederickson","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(92)90002-A_BIB6","article-title":"Shortest path computations in S-graphs","author":"Frederickson","year":"1991"},{"key":"10.1016\/0925-7721(92)90002-A_BIB7","first-page":"145","article-title":"Magic's obstacle-avoiding global router","author":"Hamachi","year":"1985","journal-title":"Proc. of 1985 Chapel Hill VLSI Conference"},{"key":"10.1016\/0925-7721(92)90002-A_BIB8","first-page":"828","article-title":"1-d compaction in the presence of forbidden regions","author":"Hambrusch","year":"1990","journal-title":"Proceedings of 28th Allerton Conference on Communication, Control and Computing"},{"key":"10.1016\/0925-7721(92)90002-A_BIB9","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0196-6774(88)90008-9","article-title":"A mixed-integer linear programming problem which is efficiently solvable","volume":"9","author":"Leiserson","year":"1988","journal-title":"J Algorithms"},{"key":"10.1016\/0925-7721(92)90002-A_BIB10","author":"Lengauer","year":"1990"},{"key":"10.1016\/0925-7721(92)90002-A_BIB11","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0925-7721(92)90002-A_BIB12","first-page":"199","article-title":"Layout compaction","author":"Mlynski","year":"1986"},{"key":"10.1016\/0925-7721(92)90002-A_BIB13","author":"Preparata","year":"1985"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219290002A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219290002A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:55:17Z","timestamp":1555138517000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219290002A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["092577219290002A"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(92)90002-a","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}