{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T12:15:47Z","timestamp":1780056947772,"version":"3.54.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T00:00:00Z","timestamp":1550707200000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10878-019-00394-1","type":"journal-article","created":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T13:56:14Z","timestamp":1550757374000},"page":"481-501","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Clustering without replication in combinatorial circuits"],"prefix":"10.1007","volume":"38","author":[{"given":"Zola","family":"Donovan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vahan","family":"Mkrtchyan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,2,21]]},"reference":[{"key":"394_CR1","volume-title":"Digraphs: theory algorithms and applications","author":"J Bang-Jensen","year":"2010","unstructured":"Bang-Jensen J, Gutin G (2010) Digraphs: theory algorithms and applications. Springer, London"},{"key":"394_CR2","unstructured":"Bui TN, Jones C (1989) Sequential and parallel algorithms for partitioning simple classes of graphs. Technical report, Department of Computer Science, The Pennsylvania State University, University Park, Pennsylvania"},{"issue":"2","key":"394_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"TN Bui","year":"1987","unstructured":"Bui TN, Chaudhuri S, Leighton FT, Sipser M (1987) Graph bisection algorithms with good average case behavior. Combinatorica 7(2):171\u2013191","journal-title":"Combinatorica"},{"key":"394_CR4","doi-asserted-by":"crossref","unstructured":"Cong J, Romesis M (2001) 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","DOI":"10.1145\/378239.378532"},{"issue":"7","key":"394_CR5","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.1016\/j.dam.2008.09.011","volume":"157","author":"R Denman","year":"2009","unstructured":"Denman R, Foster S (2009) Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT. Discrete Appl Math 157(7):1655\u20131659","journal-title":"Discrete Appl Math"},{"key":"394_CR6","doi-asserted-by":"crossref","unstructured":"Donovan Z, Mkrtchyan V, Subramani K (2015) On clustering without replication in combinatorial circuits. In: 9th International conference on combinatorial optimization and applications, COCOA 2015, Houston, TX, USA, 18\u201320 Dec 2015. Proceedings, pp 334\u2013347","DOI":"10.1007\/978-3-319-26626-8_25"},{"issue":"4","key":"394_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0898-1221(88)90210-6","volume":"15","author":"M Goldberg","year":"1988","unstructured":"Goldberg M, Miller Z (1988) A parallel algorithm for bisection width in trees. Comput Math Appl 15(4):259\u2013266","journal-title":"Comput Math Appl"},{"key":"394_CR8","doi-asserted-by":"crossref","unstructured":"Goldschmidt O, Hochbaum DS (1988) Polynomial algorithm for the k-cut problem. In: [Proceedings 1988] 29th Annual symposium on foundations of computer science, pp 444\u2013451","DOI":"10.1109\/SFCS.1988.21960"},{"issue":"1","key":"394_CR9","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/43.363121","volume":"14","author":"LJ Hwang","year":"1995","unstructured":"Hwang LJ, Gamal AE (1995) Min-cut replication in partitioned networks. IEEE Trans Comput Aided Des Integr Circuits Syst 14(1):96\u2013106","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"1","key":"394_CR10","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 (2003) On minimum delay clustering without replication. Integr VLSI J 36(1):27\u201339","journal-title":"Integr VLSI J"},{"key":"394_CR11","volume-title":"Discrete mathematics with applications","author":"T Koshy","year":"2004","unstructured":"Koshy T (2004) Discrete mathematics with applications. Elsevier, San Diego"},{"issue":"1","key":"394_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/T-C.1969.222524","volume":"18","author":"EL Lawler","year":"1969","unstructured":"Lawler EL, Levitt KN, Turner J (1969) Module clustering to minimize delay in digital networks. IEEE Trans Comput 18(1):47\u201357","journal-title":"IEEE Trans Comput"},{"key":"394_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-6627-6","volume-title":"Practical problems in VLSI physical design automation","author":"SK Lim","year":"2008","unstructured":"Lim SK (2008) Practical problems in VLSI physical design automation. Springer, Dordrecht"},{"key":"394_CR14","unstructured":"MacGregor RM (1988) On partitioning a graph: a theoretical and empirical study. PhD thesis, University of California, Berkeley"},{"key":"394_CR15","unstructured":"Mak WK, Wong DF (1996) Minimum replication min-cut partitioning. In: Proceedings of international conference on computer aided design, pp 205\u2013210"},{"key":"394_CR16","doi-asserted-by":"crossref","unstructured":"Murgai R, Brayton RK, Sangiovanni-Vincentelli A (1991) On clustering for minimum delay\/area. In: 1991 IEEE international conference on computer-aided design digest of technical papers, pp 6\u20139","DOI":"10.1109\/ICCAD.1991.185176"},{"key":"394_CR17","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Reading"},{"key":"394_CR18","doi-asserted-by":"crossref","unstructured":"Rajaraman R, Wong DF (1993) Optimal clustering for delay minimization. In: 30th ACM\/IEEE design automation conference, pp 309\u2013314","DOI":"10.1145\/157485.164907"},{"issue":"9","key":"394_CR19","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1109\/43.658566","volume":"16","author":"HH Yang","year":"1997","unstructured":"Yang HH, Wong DF (1997) Circuit clustering for delay minimization under area and pin constraints. IEEE Trans Comput Aided Des Integr Circuits Syst 16(9):976\u2013986","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00394-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00394-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00394-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T00:13:57Z","timestamp":1582244037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00394-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,21]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["394"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00394-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,21]]},"assertion":[{"value":"21 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}