{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:06:33Z","timestamp":1759190793438,"version":"3.44.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":[[2003,9]]},"DOI":"10.1016\/s0167-9260(03)00030-0","type":"journal-article","created":{"date-parts":[[2003,7,22]],"date-time":"2003-07-22T17:18:59Z","timestamp":1058894339000},"page":"27-39","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["On minimum delay clustering without replication"],"prefix":"10.1016","volume":"36","author":[{"given":"Dimitri","family":"Kagaris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0167-9260(03)00030-0_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","article-title":"Recent directions in netlist partitioning","volume":"19","author":"Alpert","year":"1995","journal-title":"Integration VLSI J."},{"issue":"1","key":"10.1016\/S0167-9260(03)00030-0_BIB2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/T-C.1969.222524","article-title":"Module clustering to minimize delay in digital networks","volume":"18","author":"Lawler","year":"1966","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(03)00030-0_BIB3","unstructured":"E.M. Sentovich, et al., SIS: a system for sequential circuit synthesis, Memo, Electronics Research Laboratory, UCB\/ERL M92\/41, University of California, Berkeley, May 1992."},{"key":"10.1016\/S0167-9260(03)00030-0_BIB4","unstructured":"R. Murgai, R.K. Brayton, A. Sangiovanni-Vincentelli, On clustering for minimum delay\/area. Proceedings of the IEEE International Conference on Computer-Aided Design, Santa Clara, CA, USA, November 1991, pp. 6\u20139."},{"key":"10.1016\/S0167-9260(03)00030-0_BIB5","doi-asserted-by":"crossref","unstructured":"R. Rajaraman, D.F. Wong, Optimal clustering for delay minimization, Proceedings of the 30th ACM\/IEEE Design Automation Conference, Dallas, TX, USA, June 1993, pp. 309\u2013314.","DOI":"10.1145\/157485.164907"},{"issue":"6","key":"10.1016\/S0167-9260(03)00030-0_BIB6","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1049\/ip-cdt:19952233","article-title":"Technique to minimize area overhead for delay-driven clustering","volume":"142","author":"Yeh","year":"1995","journal-title":"IEE Proc. Comput. Digital Tech."},{"issue":"9","key":"10.1016\/S0167-9260(03)00030-0_BIB7","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1109\/43.658566","article-title":"Circuit clustering for delay minimization under area and pin constraints","volume":"16","author":"Yang","year":"1997","journal-title":"IEEE Trans. Comput. Aid. Des."},{"issue":"4","key":"10.1016\/S0167-9260(03)00030-0_BIB8","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1109\/92.736137","article-title":"On circuit clustering for area\/delay tradeoff under capacity and pin constraints","volume":"6","author":"Huang","year":"1998","journal-title":"IEEE Trans. VLSI Systems"},{"issue":"6","key":"10.1016\/S0167-9260(03)00030-0_BIB9","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1109\/43.766729","article-title":"Delay-optimal clustering targeting low-power VLSI circuits","volume":"18","author":"Vaishnav","year":"1999","journal-title":"IEEE Trans. Comput. Aid. Des."},{"year":"1979","series-title":"Computers and Intractability\u2014A Guide to The Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0167-9260(03)00030-0_BIB10"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926003000300?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926003000300?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:11:38Z","timestamp":1759137098000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926003000300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0167926003000300"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(03)00030-0","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[2003,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On minimum delay clustering without replication","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(03)00030-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}