{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T08:54:49Z","timestamp":1767084889308},"publisher-location":"Boston, MA","reference-count":40,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387368375"},{"type":"electronic","value":"9780387687391"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-0-387-68739-1_5","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T23:19:17Z","timestamp":1188083957000},"page":"97-133","source":"Crossref","is-referenced-by-count":9,"title":["Capo: Congestion-Driven Placement for Standard-cell and RTL Netlists with Incremental Capability"],"prefix":"10.1007","author":[{"given":"Jarrod A.","family":"Roy","sequence":"first","affiliation":[]},{"given":"David A.","family":"Papa","sequence":"additional","affiliation":[]},{"given":"Igor L.","family":"Markov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1_Ref","doi-asserted-by":"crossref","unstructured":"Adya SN, Chaturvedi S, Roy JA, Papa DA, Markov IL (2004) Unification of partitioning, placement and floorplanning. In Proc ICCAD 550-557","DOI":"10.1109\/ICCAD.2004.1382639"},{"issue":"(6)","key":"5_CR2_Ref","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1109\/TVLSI.2003.817546","volume":"11","author":"SN Adya","year":"2003","unstructured":"Adya SN, Markov IL (2003) Fixed-outline floorplanning: enabling hierarchical design. IEEE Trans on VLSI 11(6):1120-1135","journal-title":"IEEE Trans on VLSI"},{"issue":"1","key":"5_CR3_Ref","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/1044111.1044116","volume":"10","author":"S. N. Adya","year":"2005","unstructured":"Adya SN, Markov IL (2005) Combinatorial techniques for mixed-size placement. ACM Trans on Design Auto of Elec Sys 10(5)","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"issue":"(4)","key":"5_CR4_Ref","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.vlsi.2005.08.003","volume":"25","author":"SN Adya","year":"2006","unstructured":"Adya SN, Markov IL, Villarrubia PG (2006) On whitespace and stability in physical synthesis. Integration: the VLSI J 25(4):340-362","journal-title":"Integration: the VLSI J"},{"key":"5_CR5_Ref","doi-asserted-by":"crossref","unstructured":"Agnihotri A et al. (2003) Fractional cut: improved recursive bisection placement. In Proc ICCAD 307-310","DOI":"10.1109\/ICCAD.2003.1257685"},{"issue":"(10)","key":"5_CR6_Ref","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1109\/TCAD.2003.818126","volume":"22","author":"CJ Alpert","year":"2003","unstructured":"Alpert CJ, Nam G-J, Villarrubia PG, (2003) Effective free space management for cut-based placement via analytical constraint generation. IEEE Trans on CAD 22 (10):1343-1353","journal-title":"IEEE Trans on CAD"},{"key":"5_CR7_Ref","doi-asserted-by":"crossref","unstructured":"Brenner U, Vygen J (2000) Faster optimal single-row placement with fixed ordering. In Proc DATE 117-121","DOI":"10.1145\/343647.343716"},{"issue":"(4)","key":"5_CR8_Ref","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1109\/TCAD.2003.809662","volume":"22","author":"U Brenner","year":"2003","unstructured":"Brenner U, Rohe A (2003) An effective congestion driven placement framework. IEEE Trans. on CAD 22(4):387-394","journal-title":"IEEE Trans. on CAD"},{"issue":"(9)","key":"5_CR9_Ref","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1109\/43.784119","volume":"18","author":"AE Caldwell","year":"1999","unstructured":"Caldwell AE, Kahng AB, Mantik S, Markov IL, Zelikovsky A (1999) On wirelength estimations for row-based placement. IEEE Trans on CAD 18(9):1265-1278","journal-title":"IEEE Trans on CAD"},{"key":"5_CR10_Ref","unstructured":"Caldwell AE, Kahng AB, Markov IL (2000) Improved algorithms for hypergraph bipartitioning. In Proc ASPDAC 661-666"},{"key":"5_CR11_Ref","doi-asserted-by":"crossref","unstructured":"Caldwell AE, Kahng AB, Markov IL (2000) Can recursive bisection alone produce routable placements? In Proc DAC 477-482","DOI":"10.1145\/337292.337549"},{"key":"5_CR12_Ref","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/351827.384247","volume":"5","author":"Andrew E. Caldwell","year":"2000","unstructured":"Caldwell AE, Kahng AB, Markov IL (2000) Design and implementation of move-based heuristics for vlsi hypergraph partitioning. ACM J of Experimental Algorithms 5","journal-title":"Journal of Experimental Algorithmics"},{"issue":"(11)","key":"5_CR13_Ref","doi-asserted-by":"crossref","first-page":"1304","DOI":"10.1109\/43.892854","volume":"19","author":"AE Caldwell","year":"2000","unstructured":"Caldwell AE, Kahng AB, Markov IL (2000) Optimal partitioners and end-case placers for standard-cell layout. IEEE Trans on CAD 19(11):1304-1314","journal-title":"IEEE Trans on CAD"},{"key":"5_CR14_Ref","unstructured":"Caldwell AE, Kahng AB, Markov IL. VLSI cad bookshelf. http:\/\/vlsicad . eecs.umich.edu\/BK\/. See also Caldwell AE, Kahng AB, Markov IL (2002) Toward cad-ip reuse: the marco gsrc bookshelf of fundamental cad algorithms. IEEE Design and Test 72-81"},{"issue":"(11)","key":"5_CR15_Ref","first-page":"716","volume":"22","author":"AE Caldwell","year":"2003","unstructured":"Caldwell AE, Kahng AB, Markov IL (2003) Hierarchical whitespace allocation in top-down placement. IEEE Trans on CAD 22(11):716-724","journal-title":"IEEE Trans on CAD"},{"issue":"(4)","key":"5_CR16_Ref","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1109\/TCAD.2004.825870","volume":"23","author":"C-C Chang","year":"2004","unstructured":"Chang C-C, Cong J, Romesis M, Xie M (2004) Optimality and scalability study of existing placement algorithms. IEEE Trans on CAD 23(4):537-549","journal-title":"IEEE Trans on CAD"},{"key":"5_CR17_Ref","unstructured":"Chen TC, Chang YW, Lin SC (2005) IMF: interconnect-driven multilevel floorplanning for large-scale building-module designs. In Proc ICCAD 159-164"},{"key":"5_CR18_Ref","unstructured":"Fiduccia CM, Mattheyses RM (1982) A linear-time heuristic for improving network partitions. In Proc DAC 175-181"},{"key":"5_CR19_Ref","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1995.0805","volume":"22","author":"AV Goldberg","year":"1997","unstructured":"Goldberg AV (1997) An efficient implementation of a scaling minimum-cost flow algorithm. ACM J. Algorithms 22:1-29","journal-title":"ACM J. Algorithms"},{"key":"5_CR20_Ref","unstructured":"IWLS 2005 Benchmarks, http:\/\/iwls.org\/iwls2005\/benchmarks.html"},{"key":"5_CR21_Ref","doi-asserted-by":"crossref","unstructured":"Kahng AB, Mantik S, Markov IL, (2002) Min-max placement For large-scale timing optimization. In Proc ISPD 143-148","DOI":"10.1145\/505388.505423"},{"key":"5_CR22_Ref","doi-asserted-by":"crossref","unstructured":"Kahng AB, Mandoiu II, Zelikovsky A (2003) Highly Scalable Algorithms for rectilinear and octilinear steiner trees. In Proc ASPDAC 827-833","DOI":"10.1145\/1119772.1119955"},{"issue":"(5)","key":"5_CR23_Ref","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/TCAD.2005.846366","volume":"25","author":"AB Kahng","year":"2005","unstructured":"Kahng AB, Wang Q (2005) Implementation and extensibility of an analytic placer. IEEE Trans on CAD 25(5):734-747","journal-title":"IEEE Trans on CAD"},{"key":"5_CR24_Ref","unstructured":"Kahng AB, Reda S (2004) Placement feedback: a concept and method for better min-cut placement. In Proc DAC 143-148"},{"key":"5_CR25_Ref","doi-asserted-by":"crossref","unstructured":"Karypis G, Aggarwal R, Kumar V, Shekhar S (1997) Multilevel hypergraph partitioning: applications in vlsi domain. In Proc DAC 526-629","DOI":"10.1145\/266021.266273"},{"key":"5_CR26_Ref","doi-asserted-by":"crossref","unstructured":"Khatkhate A, Li C, Agnihotri AR, Yildiz MC, Ono S, Koh C-K, Madden PH (2004). Recursive bisection based mixed block placement. In Proc ISPD 84-89","DOI":"10.1145\/981066.981084"},{"key":"5_CR27_Ref","unstructured":"Li C, Xie M, Koh C-K, Cong J, Madden PH (2004) Routability-driven placement and whitespace allocation. In Proc ICCAD 394-401"},{"key":"5_CR28_Ref","doi-asserted-by":"crossref","unstructured":"Li C, Koh C-K, Madden PH (2005) Floorplan management: incremental placement for gate sizing and buffer insertion. In Proc ASPDAC 349-354","DOI":"10.1145\/1120725.1120867"},{"key":"5_CR29_Ref","doi-asserted-by":"crossref","unstructured":"Moffitt MD, Ng AN, Markov IL, Pollack ME (2006) Constraint-driven floorplan repair. In Proc DAC 1103-1108","DOI":"10.1145\/1146909.1147188"},{"key":"5_CR30_Ref","unstructured":"Nam G-J, Alpert CJ, Villarrubia P, Winter B, Yildiz M (2005) The ISPD 2005 placement contest and benchmark suite. In Proc ISPD 216-220"},{"key":"5_CR31_Ref","unstructured":"Ng AN, Markov IL, Aggarwal R, Ramachandran V (2006) Solving hard instances of floorplacement. In Proc ISPD 170-177"},{"key":"5_CR32_Ref","doi-asserted-by":"crossref","unstructured":"Papa DA, Adya SN, Markov IL (2004) Constructive benchmarking for placement. In Proc GLSVLSI 113-118 http:\/\/vlsicad.eecs.umich.edu\/BK\/FEATURE\/","DOI":"10.1145\/988952.988981"},{"key":"5_CR33_Ref","doi-asserted-by":"crossref","unstructured":"Reda S, Chowdhary A (2006) Effective linear programming based placement methods. In Proc ISPD 186-191","DOI":"10.1145\/1123008.1123049"},{"issue":"(7)","key":"5_CR34_Ref","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1109\/TCAD.2005.855969","volume":"25","author":"JA Roy","year":"2006","unstructured":"Roy JA, Adya SN, Papa DA, Markov IL (2006) Min-cut floorplacement. IEEE Trans on CAD 25(7):1313-1326","journal-title":"IEEE Trans on CAD"},{"key":"5_CR35_Ref","doi-asserted-by":"crossref","unstructured":"Roy JA, Markov IL (2007) Seeing the forest and the trees: steiner wirelength optimization in placement. To appear in IEEE Trans on CAD","DOI":"10.1145\/1123008.1123024"},{"key":"5_CR36_Ref","doi-asserted-by":"crossref","unstructured":"Roy JA, Markov IL (2007) ECO-system: embracing the change in placement. To appear IEEE Trans on CAD","DOI":"10.1109\/TCAD.2007.907271"},{"key":"5_CR37_Ref","doi-asserted-by":"crossref","unstructured":"Roy JA, Papa DA, Ng AN, Markov IL (2006) Satisfying whitespace requirements in top-down placement. In Proc ISPD 206-208","DOI":"10.1145\/1123008.1123053"},{"key":"5_CR38_Ref","unstructured":"Tang X, Tian R, Wong MDF (2005) Optimal redistribution of whitespace for wirelength minimization. In Proc ASPDAC 412-417"},{"key":"5_CR39_Ref","doi-asserted-by":"crossref","unstructured":"Westra J, Bartels C, Groeneveld P (2004) Probabilistic congestion prediction. In Proc ISPD 204-209","DOI":"10.1145\/981066.981110"},{"issue":"(4)","key":"5_CR40_Ref","first-page":"410","volume":"22","author":"X Yang","year":"2002","unstructured":"Yang X, Choi B-K, Sarrafzadeh M (2002) Routability driven whitespace allocation for fixed-die standard-cell placement. IEEE Trans on CAD 22(4):410-419","journal-title":"IEEE Trans on CAD"}],"container-title":["Series on Integrated Circuits and Systems","Modern Circuit Placement"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-68739-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T22:39:51Z","timestamp":1684017591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-68739-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9780387368375","9780387687391"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-68739-1_5","relation":{},"ISSN":["1558-9412"],"issn-type":[{"type":"print","value":"1558-9412"}],"subject":[],"published":{"date-parts":[[2007]]}}}