{"id":"https://openalex.org/W1592365454","doi":"https://doi.org/10.1109/iccad.2004.1382637","title":"A new incremental placement algorithm and its application to congestion-aware divisor extraction","display_name":"A new incremental placement algorithm and its application to congestion-aware divisor extraction","publication_year":2005,"publication_date":"2005-02-22","ids":{"openalex":"https://openalex.org/W1592365454","doi":"https://doi.org/10.1109/iccad.2004.1382637","mag":"1592365454"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2004.1382637","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2004.1382637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030499418","display_name":"Saurav Chatterjee","orcid":"https://orcid.org/0000-0002-6290-4342"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Chatterjee","raw_affiliation_strings":["Department of EECS, University of California at Berkeley, California","Dept. of Electr. Eng. & Comput.Sci., California Univ., Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of EECS, University of California at Berkeley, California","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput.Sci., California Univ., Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064568178","display_name":"Robert K. Brayton","orcid":"https://orcid.org/0000-0002-3861-1718"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Brayton","raw_affiliation_strings":["Department of EECS, University of California at Berkeley, Berkeley, California, USA","Dept. of Electr. Eng. & Comput.Sci., California Univ., Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of EECS, University of California at Berkeley, Berkeley, California, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput.Sci., California Univ., Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":4.8615,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.95302681,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"541","last_page":"548"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/router","display_name":"Router","score":0.7529827356338501},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.7128355503082275},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7092843055725098},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6287676692008972},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.45063772797584534},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4171590209007263},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.41320982575416565},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3195069432258606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2024872601032257},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0858657956123352}],"concepts":[{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.7529827356338501},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.7128355503082275},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7092843055725098},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6287676692008972},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.45063772797584534},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4171590209007263},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.41320982575416565},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3195069432258606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2024872601032257},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0858657956123352},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iccad.2004.1382637","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2004.1382637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.496.6719","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.496.6719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://embedded.eecs.berkeley.edu/mvsis/doc/2004/congestion-extraction-ICCAD04.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1511688816","https://openalex.org/W2048796234","https://openalex.org/W2093513607","https://openalex.org/W2100002116","https://openalex.org/W2102502584","https://openalex.org/W2103626283","https://openalex.org/W2118182815","https://openalex.org/W2124618076","https://openalex.org/W2146286671","https://openalex.org/W2150985898","https://openalex.org/W2152173554","https://openalex.org/W2166011990","https://openalex.org/W4231151455","https://openalex.org/W4247095439","https://openalex.org/W4248136059","https://openalex.org/W6630623413","https://openalex.org/W6677731803"],"related_works":["https://openalex.org/W2003930232","https://openalex.org/W2263167076","https://openalex.org/W4311255633","https://openalex.org/W2368007657","https://openalex.org/W2391191500","https://openalex.org/W4297894118","https://openalex.org/W2365398175","https://openalex.org/W3214555511","https://openalex.org/W1979748118","https://openalex.org/W2641655"],"abstract_inverted_index":{"This":[0],"work":[1],"presents":[2],"two":[3,96],"contributions.":[4],"The":[5,22,51,63,100,124],"first":[6,101],"is":[7,66],"an":[8,91,104,111,128,135],"incremental":[9,41],"placement":[10],"algorithm":[11,23,52,72],"for":[12,30,140],"placement-aware":[13,60,74],"logic":[14],"synthesis":[15],"along":[16],"with":[17,95,174],"a":[18,31,36,57,67,141,154,175],"proof":[19],"of":[20,48,59,70,82,114,138,144],"optimality.":[21],"can":[24,53],"efficiently":[25],"compute":[26],"the":[27,40,44,49,80,83,121,148,161,165],"optimum":[28],"location":[29],"newly":[32],"introduced":[33],"node":[34],"in":[35,43,56,90,110,116,134,158,168],"network":[37],"that":[38],"minimizes":[39],"increase":[42],"total":[45],"half-perimeter":[46],"wire-length":[47,166],"network.":[50],"be":[54],"applied":[55],"variety":[58],"optimization":[61],"contexts.":[62],"second":[64,125],"contribution":[65],"specific":[68],"application":[69],"this":[71],"to":[73,163],"common":[75],"divisor":[76],"extraction.":[77],"We":[78],"evaluate":[79],"effectiveness":[81],"proposed":[84],"extraction":[85,172],"procedure":[86],"by":[87,120],"using":[88],"it":[89],"otherwise":[92],"non-placement-aware":[93],"flow":[94,102,126],"different":[97],"final":[98],"placers.":[99],"uses":[103,127],"industrial":[105],"congestion-driven":[106],"placer":[107,131],"and":[108,132],"results":[109,133,167],"average":[112,136],"reduction":[113,137],"21%":[115],"congestion":[117,145],"as":[118],"measured":[119],"global":[122],"router.":[123],"academic":[129],"wire-length-driven":[130],"11%":[139],"tool-specific":[142],"measure":[143],"estimated":[146],"from":[147],"placement.":[149],"Our":[150],"experiments":[151],"also":[152],"reveal":[153],"rather":[155],"surprising":[156],"phenomenon:":[157],"many":[159],"cases":[160],"attempt":[162],"minimize":[164],"fewer":[169],"literals":[170],"after":[171],"than":[173],"conventional":[176],"literal-driven":[177],"approach.":[178]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}