{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:45:42Z","timestamp":1743108342487,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250041"},{"type":"electronic","value":"9783030250058"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25005-8_17","type":"book-chapter","created":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T23:02:23Z","timestamp":1563145343000},"page":"201-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Disjoint Clustering in Combinatorial Circuits"],"prefix":"10.1007","author":[{"given":"Zola","family":"Donovan","sequence":"first","affiliation":[]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[]},{"given":"Vahan","family":"Mkrtchyan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2010","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2010). https:\/\/doi.org\/10.1007\/978-1-84800-998-1"},{"unstructured":"Behrens, D., Hebrich, E.B.K.: Heirarchical partitioning. In: Proceedings of the IEEE International Conference on CAD, pp. 171\u2013191 (1997)","key":"17_CR2"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/43.273754","volume":"13","author":"J Cong","year":"1994","unstructured":"Cong, J., Ding, Y.: FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(1), 1\u201312 (1994)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/43.363121","volume":"14","author":"LJ Hwang","year":"1995","unstructured":"Hwang, L.J., El Gamal, A.: Min-cut replication in partitioned networks. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(1), 96\u2013106 (1995)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0167-9260(03)00030-0","volume":"36","author":"D Kagaris","year":"2003","unstructured":"Kagaris, D.: On minimum delay clustering without replication. Integ. VLSI J. 36(1), 27\u201339 (2003)","journal-title":"Integ. VLSI J."},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/T-C.1969.222524","volume":"18","author":"EL Lawler","year":"1969","unstructured":"Lawler, E.L., Levitt, K.N., Turner, J.: Module clustering to minimize delay in digital networks. IEEE Trans. Comput. 18(1), 47\u201357 (1969)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"17_CR7","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1109\/43.384426","volume":"14","author":"L-T Liu","year":"1995","unstructured":"Liu, L.-T., Kuo, M.-T., Cheng, C.-K., Hu, T.C.: A replication cut for two-way partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(5), 623\u2013630 (1995)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"unstructured":"Mak, W.-K., Wong, D.F.: Minimum replication min-cut partitioning. In: Proceedings of International Conference on Computer Aided Design, pp. 205\u2013210 (1996)","key":"17_CR8"},{"unstructured":"Murgai, R., Brayton, R.K., Sangiovanni-Vincentelli, A.: On clustering for minimum delay\/area. In: 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers, pp. 6\u20139 (1991)","key":"17_CR9"},{"unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)","key":"17_CR10"},{"doi-asserted-by":"crossref","unstructured":"Rajaraman, R., Wong, D.F.: Optimal clustering for delay minimization. In: 30th ACM\/IEEE Design Automation Conference, pp. 309\u2013314 (1993)","key":"17_CR11","DOI":"10.1145\/157485.164907"},{"unstructured":"Shih, M., Kuh, E.S.: Circuit partitioning under capacity and I\/O constraints. In: Proceedings of the IEEE on Custom Integrated Circuits Conference, pp. 659\u2013662. IEEE, May 1994","key":"17_CR12"},{"key":"17_CR13","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25005-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:14:19Z","timestamp":1710350059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25005-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250041","9783030250058"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25005-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2019.di.unipi.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5-6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}