{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T23:16:12Z","timestamp":1648768572518},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,5,1]],"date-time":"1987-05-01T00:00:00Z","timestamp":546825600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1987,5]]},"DOI":"10.1016\/0020-0190(87)90230-4","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T01:00:31Z","timestamp":1049504431000},"page":"119-122","source":"Crossref","is-referenced-by-count":3,"title":["An observation concerning constraint-based compaction"],"prefix":"10.1016","volume":"25","author":[{"given":"F.Miller","family":"Maley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0020-0190(87)90230-4_BIB1","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(87)90230-4_BIB2","series-title":"Proc. 25th Ann. Symp. on Foundations of Computer Science","first-page":"338","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","author":"Fredman","year":"1984"},{"key":"10.1016\/0020-0190(87)90230-4_BIB3","article-title":"Symbolic layout and compaction of integrated circuits","author":"Hsueh","year":"1979"},{"issue":"1","key":"10.1016\/0020-0190(87)90230-4_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","article-title":"Efficient algorithms for shortest paths in sparse networks","volume":"24","author":"Johnson","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(87)90230-4_BIB5","series-title":"Tech. Rept. 117","article-title":"Optimization techniques for IC layout and compaction","author":"Kedem","year":"1982"},{"key":"10.1016\/0020-0190(87)90230-4_BIB6","series-title":"Proc. 21st Ann. Allerton Conf. on Communication, Control, and Computing","first-page":"204","article-title":"A mixed-integer linear programming problem which is efficiently solvable","author":"Leiserson","year":"1983"},{"key":"10.1016\/0020-0190(87)90230-4_BIB7","series-title":"Proc. 9th Workshop on Graph-Theoretic Concepts in Computer Science","article-title":"Efficient algorithms for the constraint generation for integrated circuit layout compaction","author":"Lengauer","year":"1983"},{"issue":"3","key":"10.1016\/0020-0190(87)90230-4_BIB8","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/0196-6774(84)90020-8","article-title":"On the solution of inequality systems relevant to IC layout","volume":"5","author":"Lengauer","year":"1984","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/0020-0190(87)90230-4_BIB9","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TCAD.1983.1270022","article-title":"An algorithm to compact a VLSI symbolic layout with mixed constraints","author":"Liao","year":"1983","journal-title":"IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems CAD-2"},{"key":"10.1016\/0020-0190(87)90230-4_BIB10","series-title":"1985 Chapel Hill Conf. on Very Large Scale Integration","first-page":"261","article-title":"Compaction with automatic jog introduction","author":"Maley","year":"1985"},{"issue":"2,3","key":"10.1016\/0020-0190(87)90230-4_BIB11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0166-218X(86)90051-X","article-title":"On BF-orderable graphs","volume":"15","author":"Mehlhorn","year":"1986","journal-title":"Discrete Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902304?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902304?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T05:26:25Z","timestamp":1553405185000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087902304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,5]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,5]]}},"alternative-id":["0020019087902304"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90230-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,5]]}}}