{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:36:11Z","timestamp":1742913371444,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031637742"},{"type":"electronic","value":"9783031637759"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63775-9_7","type":"book-chapter","created":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T06:03:07Z","timestamp":1719468187000},"page":"90-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hypergraph Clustering with\u00a0Path-Length Awareness"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3583-0859","authenticated-orcid":false,"given":"Julien","family":"Rodriguez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1594-152X","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Galea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3983-6289","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Pellegrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6660-4347","authenticated-orcid":false,"given":"Lilia","family":"Zaourar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,28]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Ababei, C., Selvakkumaran, N., Bazargan, K., Karypis, G.: Multi-objective circuit partitioning for cutsize and path-based delay minimization. In: Proceedings of the 2002 IEEE\/ACM International Conference on Computer-Aided Design, ICCAD 2002, pp. 181\u2013185. Association for Computing Machinery, New York (2002). https:\/\/doi.org\/10.1145\/774572.774599","DOI":"10.1145\/774572.774599"},{"key":"7_CR2","unstructured":"\u00c7ataly\u00fcrek, \u00dc.V., et al.: More Recent Advances in (Hyper)Graph Partitioning. Technical report arXiv:2205.13202, arXiv (2022). http:\/\/arxiv.org\/abs\/2205.13202"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Cong, J., Wu, C.: Global clustering-based performance-driven circuit partitioning. In: Proceedings of the 2002 International Symposium on Physical Design, ISPD 2002, pp. 149\u2013154. Association for Computing Machinery, New York (2002). https:\/\/doi.org\/10.1145\/505388.505424","DOI":"10.1145\/505388.505424"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/54.867894","volume":"17","author":"F Corno","year":"2000","unstructured":"Corno, F., Reorda, M.S., Squillero, G.: RT-level ITC\u201999 benchmarks and first ATPG results. J. IEEE Des. Test Comput. 17(3), 44\u201353 (2000)","journal-title":"J. IEEE Des. Test Comput."},{"key":"7_CR5","unstructured":"Diwan, A.A., Rane, S., Seshadri, S., Sudarshan, S.: Clustering techniques for minimizing external path length. In: Proceedings of the 22th International Conference on Very Large Data Bases, pp. 342\u2013353 (1996)"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Donovan, Z.N.: Algorithmic Issues in some Disjoint Clustering Problems in Combinatorial Circuits. Thesis dissertation, West Virginia University Libraries (2018). https:\/\/doi.org\/10.33915\/etd.3721. https:\/\/researchrepository.wvu.edu\/etd\/3721","DOI":"10.33915\/etd.3721"},{"key":"7_CR7","unstructured":"Donovan, Z.N., Mkrtchyan, V., Subramani, K.: Complexity issues in some clustering problems in combinatorial circuits. arXiv:1412.4051 (2017). http:\/\/arxiv.org\/abs\/1412.4051"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-030-25005-8_17","volume-title":"Combinatorial Algorithms","author":"Z Donovan","year":"2019","unstructured":"Donovan, Z., Subramani, K., Mkrtchyan, V.: Disjoint clustering in combinatorial circuits. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 201\u2013213. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25005-8_17"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Donovan, Z.N., Subramani, K., Mkrtchyan, V.: Analyzing clustering and partitioning problems in selected VLSI models. Theory Comput. Syst. 64(7), 1242\u20131272 (2020)","DOI":"10.1007\/s00224-020-09989-2"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Kagaris, D.: On minimum delay clustering without replication. Integration 36(1), 27\u201339 (2003)","DOI":"10.1016\/S0167-9260(03)00030-0"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 7(1), 69\u201379 (1999). https:\/\/doi.org\/10.1109\/92.748202","DOI":"10.1109\/92.748202"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Analysis of multilevel graph partitioning. In: Proceedings of the 1995 ACM\/IEEE Conference on Supercomputing, pp. 29\u2013es (1995)","DOI":"10.1145\/224170.224229"},{"key":"7_CR13","unstructured":"Karypis, G., Kumar, V.: Hmetis: a hypergraph partitioning package. ACM Trans. Architect. Code Optim. (1998)"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/T-C.1969.222524","volume":"100","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. 100(1), 47\u201357 (1969)","journal-title":"IEEE Trans. Comput."},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Murgai, R., Brayton, R.K., Sangiovanni-Vincentelli, A.: On clustering for minimum delay\/ara, pp. 6\u20139. IEEE Computer Society (1991). https:\/\/doi.org\/10.1109\/ICCAD.1991.185176. https:\/\/www.computer.org\/csdl\/proceedings-article\/iccad\/1991\/00185176\/12OmNASILTx","DOI":"10.1109\/ICCAD.1991.185176"},{"issue":"6","key":"7_CR16","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/43.703830","volume":"17","author":"P Pan","year":"1998","unstructured":"Pan, P., Karandikar, A.K., Liu, C.L.: Optimal clock period clustering for sequential circuits with retiming. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(6), 489\u2013498 (1998)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Pellegrini, F.: Scotch and PT-scotch graph partitioning software: an overview. In: Uwe\u00a0Naumann, O.S. (ed.) Combinatorial Scientific Computing, pp. 373\u2013406. Chapman and Hall\/CRC (2012). https:\/\/doi.org\/10.1201\/b11644-15. https:\/\/inria.hal.science\/hal-00770422","DOI":"10.1201\/b11644-15"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Rajaraman, R., Wong, M.D.F.: Optimal clustering for delay minimization. In: Proceedings of the 30th International Design Automation Conference, DAC 1993, pp. 309\u2013314. Association for Computing Machinery, New York (1993). https:\/\/doi.org\/10.1145\/157485.164907. https:\/\/doi.org\/10.1145\/157485.164907","DOI":"10.1145\/157485.164907"},{"key":"7_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/978-3-031-36024-4_50","volume-title":"ICCS 2023","author":"J Rodriguez","year":"2023","unstructured":"Rodriguez, J., Galea, F., Pellegrini, F., Zaourar, L.: A hypergraph model and associated optimization strategies for path length-driven netlist partitioning. In: Miky\u0161ka, J., de Mulatier, C., Paszynski, M., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M. (eds.) ICCS 2023. LNCS, vol. 10475, pp. 652\u2013660. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-36024-4_50"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63775-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T13:48:18Z","timestamp":1727185698000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63775-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637742","9783031637759"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63775-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}