{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:44Z","timestamp":1740109424904,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T00:00:00Z","timestamp":1598054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T00:00:00Z","timestamp":1598054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-19-1-0177"],"award-info":[{"award-number":["FA9550-19-1-0177"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s00224-020-09989-2","type":"journal-article","created":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T04:02:27Z","timestamp":1598068947000},"page":"1242-1272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Analyzing Clustering and Partitioning Problems in Selected VLSI Models"],"prefix":"10.1007","volume":"64","author":[{"given":"Z.","family":"Donovan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5821-5117","authenticated-orcid":false,"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Mkrtchyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,22]]},"reference":[{"issue":"9","key":"9989_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"9989_CR2","doi-asserted-by":"crossref","unstructured":"Arge, L.: External Memory Data Structures Algorithms - ESA 2001, 9Th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, Pp. 1\u201329 (2001)","DOI":"10.1007\/3-540-44676-1_1"},{"key":"9989_CR3","doi-asserted-by":"crossref","unstructured":"Asahiro, Y., Furukawa, T., Ikegami, K., Miyano, E. Calamoneri, T., Finocchi, I., Italiano, G. F. (eds.): How to Pack Directed Acyclic Graphs into Small Blocks. Springer Berlin Heidelberg, Berlin, Heidelberg (2006)","DOI":"10.1007\/11758471_27"},{"key":"9989_CR4","doi-asserted-by":"crossref","unstructured":"Asahiro, Y., Miyano, E., Yagita, T. Gervasi, O., Murgante, B., Misra, S., Stankova, E., Torre, C. M., Rocha, A. M. A., Taniar, D., Apduhan, B. O., Tarantino, E., Ryu, Y. (eds.): Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks. Springer International Publishing, Cham (2018)","DOI":"10.1007\/978-3-319-95165-2_43"},{"key":"9989_CR5","volume-title":"Algorithms and Theory of Computation Handbook., 2Nd Ed. \/ Edn","author":"MJ Atallah","year":"2010","unstructured":"Atallah, M.J., Blanton, M.: Algorithms and Theory of Computation Handbook., 2Nd Ed. \/ Edn. CRC Press, Boca Raton (2010)"},{"key":"9989_CR6","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)"},{"issue":"2","key":"9989_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"TN Bui","year":"1987","unstructured":"Bui, T.N., Chaudhuri, S., Leighton, F.T., Sipser, M.: Graph bisection algorithms with good average case behavior. Combinatorica 7 (2), 171\u2013191 (1987)","journal-title":"Combinatorica"},{"key":"9989_CR8","volume-title":"Sequential and Parallel Algorithms for Partitioning Simple Classes of Graphs. Tech. Rep., Department of Computer Science, The Pennsylvania State University","author":"TN Bui","year":"1989","unstructured":"Bui, T.N., Jones, C.: Sequential and Parallel Algorithms for Partitioning Simple Classes of Graphs. Tech. Rep., Department of Computer Science, The Pennsylvania State University. University Park, Pennsylvania (1989)"},{"key":"9989_CR9","doi-asserted-by":"crossref","unstructured":"Cong, J., Romesis, M.: Performance-driven multi-level clustering with application to hierarchical fpga mapping. In: Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232), pp. 389\u2013394 (2001)","DOI":"10.1145\/378239.378532"},{"key":"9989_CR10","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized algorithms. Springer Cham (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"9989_CR11","unstructured":"Diwan, A.A., Rane, S., Seshadri, S., Sudarshan, S.: Clustering techniques for minimizing external path length. In: VLDB\u201996, Proceedings of 22th International Conference on Very Large Data Bases, September 3-6, 1996, Mumbai (Bombay), India, pp. 342\u2013353 (1996)"},{"issue":"2","key":"9989_CR12","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s10878-019-00394-1","volume":"38","author":"Z Donovan","year":"2019","unstructured":"Donovan, Z., Gutin, G.Z., Mkrtchyan, V., Subramani, K.: Clustering without replication in combinatorial circuits. J. Comb. Optim. 38(2), 481\u2013501 (2019)","journal-title":"J. Comb. Optim."},{"key":"9989_CR13","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Kratsch, D.: Exact exponential algorithms. Texts in theoretical computer science. an EATCS series springer (2010)","DOI":"10.1007\/978-3-642-16533-7"},{"issue":"4","key":"9989_CR14","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0898-1221(88)90210-6","volume":"15","author":"M Goldberg","year":"1988","unstructured":"Goldberg, M., Miller, Z.: A parallel algorithm for bisection width in trees. Computers and Mathematics with Applications 15(4), 259\u2013266 (1988)","journal-title":"Computers and Mathematics with Applications"},{"key":"9989_CR15","doi-asserted-by":"crossref","unstructured":"Goldschmidt, O., Hochbaum, D.S.: Polynomial algorithm for the k-cut problem. In: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp. 444\u2013451 (1988)","DOI":"10.1109\/SFCS.1988.21960"},{"issue":"1","key":"9989_CR16","doi-asserted-by":"crossref","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. Integr. VLSI J. 36(1), 27\u201339 (2003)","journal-title":"Integr. VLSI J."},{"key":"9989_CR17","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Levitt, K.N., Turner, J.: Module clustering to minimize delay in digital networks IEEE Transactions on Computers 18(1) (1969)","DOI":"10.1109\/T-C.1969.222524"},{"key":"9989_CR18","unstructured":"MacGregor, R.M.: On Partitioning a Graph: A Theoretical and Empirical Study. Ph.D. Thesis, University of California, Berkeley (1988)"},{"key":"9989_CR19","doi-asserted-by":"crossref","unstructured":"Maheshwari, A., Zeh, N.: A Survey of Techniques for Designing I\/O-Efficient Algorithms. In: Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002], Pp. 36\u201361 (2002)","DOI":"10.1007\/3-540-36574-5_3"},{"key":"9989_CR20","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":"9989_CR21","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":"9989_CR22","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Reading, Massachusetts (1994)"},{"key":"9989_CR23","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)","DOI":"10.1145\/157485.164907"},{"issue":"4es","key":"9989_CR24","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1145\/242224.242495","volume":"28","author":"DE Vengroff","year":"1996","unstructured":"Vengroff, D.E., Vitter, J.S.: I\/o-efficient algorithms and environments. ACM Comput. Surv. 28(4es), 212 (1996)","journal-title":"ACM Comput. Surv."},{"key":"9989_CR25","doi-asserted-by":"crossref","unstructured":"Vitter, J.S.: External Memory Algorithms. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds.) Algorithms \u2014 ESA\u2019 98, pp 1-25, Springer Berlin Heidelberg, Berlin, Heidelberg (1998)","DOI":"10.1007\/3-540-68530-8_1"},{"issue":"2","key":"9989_CR26","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"JS Vitter","year":"2001","unstructured":"Vitter, J.S.: External memory algorithms and data structures. ACM Comput. Surv. 33(2), 209\u2013271 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"9989_CR27","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1561\/0400000014","volume":"2","author":"JS Vitter","year":"2006","unstructured":"Vitter, J.S.: Algorithms and data structures for external memory. Foundations and Trends in Theoretical Computer Science 2(4), 305\u2013474 (2006)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"9989_CR28","unstructured":"West, D.B.: Introduction to Graph Theory, 2Nd Ed. Edn. Prentice Hall, Upper Saddle River, N.J (2001)"},{"issue":"9","key":"9989_CR29","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1109\/43.658566","volume":"16","author":"HH Yang","year":"1997","unstructured":"Yang, H.H., Wong, D.F.: Circuit clustering for delay minimization under area and pin constraints. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 16(9), 976\u2013986 (1997)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-09989-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-020-09989-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-09989-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T11:31:51Z","timestamp":1667993511000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-020-09989-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,22]]},"references-count":29,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["9989"],"URL":"https:\/\/doi.org\/10.1007\/s00224-020-09989-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2020,8,22]]},"assertion":[{"value":"22 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}