{"id":"https://openalex.org/W4245781162","doi":"https://doi.org/10.1109/iccad.2003.1257685","title":"Fractional cut: improved recursive bisection placement","display_name":"Fractional cut: improved recursive bisection placement","publication_year":2004,"publication_date":"2004-05-13","ids":{"openalex":"https://openalex.org/W4245781162","doi":"https://doi.org/10.1109/iccad.2003.1257685"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2003.1257685","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2003.1257685","pdf_url":null,"source":{"id":"https://openalex.org/S4363608282","display_name":"ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)","raw_type":"proceedings-article"},"type":"article","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/A5089228488","display_name":"Ameya R. Agnihotri","orcid":null},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Agnihotri","raw_affiliation_strings":["SUNY Binghamton Computer Science Department"],"affiliations":[{"raw_affiliation_string":"SUNY Binghamton Computer Science Department","institution_ids":["https://openalex.org/I123946342"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106486927","display_name":"Mehmet Can Yildiz","orcid":null},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.C. Yildiz","raw_affiliation_strings":["SUNY Binghamton Computer Science Department"],"affiliations":[{"raw_affiliation_string":"SUNY Binghamton Computer Science Department","institution_ids":["https://openalex.org/I123946342"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033527571","display_name":"Ateen Khatkhate","orcid":null},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Khatkhate","raw_affiliation_strings":["SUNY Binghamton Computer Science Department"],"affiliations":[{"raw_affiliation_string":"SUNY Binghamton Computer Science Department","institution_ids":["https://openalex.org/I123946342"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024620037","display_name":"Ajita Mathur","orcid":null},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Mathur","raw_affiliation_strings":["SUNY Binghamton Computer Science Department"],"affiliations":[{"raw_affiliation_string":"SUNY Binghamton Computer Science Department","institution_ids":["https://openalex.org/I123946342"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020600391","display_name":"Satoshi Ono","orcid":"https://orcid.org/0000-0001-9500-3068"},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Ono","raw_affiliation_strings":["SUNY Binghamton Computer Science Department"],"affiliations":[{"raw_affiliation_string":"SUNY Binghamton Computer Science Department","institution_ids":["https://openalex.org/I123946342"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074401951","display_name":"Patrick H. Madden","orcid":"https://orcid.org/0000-0002-1727-6885"},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P.H. Madden","raw_affiliation_strings":["SUNY Binghamton Computer Science Department"],"affiliations":[{"raw_affiliation_string":"SUNY Binghamton Computer Science Department","institution_ids":["https://openalex.org/I123946342"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5089228488"],"corresponding_institution_ids":["https://openalex.org/I123946342"],"apc_list":null,"apc_paid":null,"fwci":17.1122,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.99710378,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"307","last_page":"310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998999834060669,"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":0.9998999834060669,"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.9994000196456909,"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/T11527","display_name":"3D IC and TSV technologies","score":0.9975000023841858,"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/bisection","display_name":"Bisection","score":0.8715693950653076},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7826316356658936},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6740062236785889},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.568618893623352},{"id":"https://openalex.org/keywords/bisection-method","display_name":"Bisection method","score":0.5660466551780701},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5483893752098083},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4590953290462494},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.4388723373413086},{"id":"https://openalex.org/keywords/recursive-partitioning","display_name":"Recursive partitioning","score":0.4313507080078125},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.428941547870636},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2620502710342407},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11064675450325012},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.0727759599685669}],"concepts":[{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.8715693950653076},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7826316356658936},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6740062236785889},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.568618893623352},{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.5660466551780701},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5483893752098083},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4590953290462494},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4388723373413086},{"id":"https://openalex.org/C137345334","wikidata":"https://www.wikidata.org/wiki/Q7303350","display_name":"Recursive partitioning","level":2,"score":0.4313507080078125},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.428941547870636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2620502710342407},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11064675450325012},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0727759599685669},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2003.1257685","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2003.1257685","pdf_url":null,"source":{"id":"https://openalex.org/S4363608282","display_name":"ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1980746862","https://openalex.org/W1984954427","https://openalex.org/W2007480409","https://openalex.org/W2024060531","https://openalex.org/W2032145219","https://openalex.org/W2048796234","https://openalex.org/W2102502584","https://openalex.org/W2109753853","https://openalex.org/W2112805885","https://openalex.org/W2112994448","https://openalex.org/W2115762048","https://openalex.org/W2115866417","https://openalex.org/W2173598676","https://openalex.org/W2175984884","https://openalex.org/W2752885492","https://openalex.org/W4242608849","https://openalex.org/W4245197815","https://openalex.org/W4247987485","https://openalex.org/W6652027108","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2329494729","https://openalex.org/W3112697985","https://openalex.org/W41290553","https://openalex.org/W2585516632","https://openalex.org/W1986919722","https://openalex.org/W2093663313","https://openalex.org/W40332083","https://openalex.org/W4296983618","https://openalex.org/W2158390333","https://openalex.org/W2577097539"],"abstract_inverted_index":{"In":[0],"this":[1,25],"paper,":[2],"we":[3],"present":[4],"improvements":[5],"to":[6,12,22,75],"recursive":[7,117],"bisection":[8,118],"based":[9,40,80,119],"placement.In":[10],"contrast":[11],"prior":[13],"work,":[14],"our":[15,60,71,94,108],"horizontal":[16],"cut":[17,34],"lines":[18],"are":[19,73,97,110],"not":[20],"restricted":[21],"row":[23],"boundaries;":[24],"avoids":[26],"a":[27,37,86],"\"narrow":[28],"region\"":[29],"problem.To":[30],"support":[31],"these":[32,48],"new":[33],"line":[35],"positions,":[36],"dynamic":[38],"programming":[39],"legalization":[41],"algorithm":[42],"has":[43,49],"been":[44],"developed.The":[45],"combination":[46],"of":[47,77,88,103,115],"improved":[50],"the":[51,55,78,89,116,123],"stability":[52],"and":[53,122],"lowered":[54],"wire":[56,95],"lengths":[57,96],"produced":[58],"by":[59],"Feng":[61],"Shui":[62],"placement":[63,125],"tool.On":[64],"benchmarks":[65],"derived":[66],"from":[67],"industry":[68],"partitioning":[69],"examples,":[70],"results":[72,109],"close":[74],"those":[76,102,114],"annealing":[79],"tool":[81,120,126],"Dragon,":[82],"while":[83],"taking":[84],"only":[85],"fraction":[87],"run":[90],"time.On":[91],"synthetic":[92],"benchmarks,":[93],"nearly":[98],"23%":[99],"better":[100,112],"than":[101,113],"Dragon.For":[104],"both":[105],"benchmark":[106],"suites,":[107],"substantially":[111],"Capo":[121],"analytic":[124],"Kraftwerk.":[127]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}