{"id":"https://openalex.org/W1505317030","doi":"https://doi.org/10.1109/iccad.2004.1382689","title":"Simultaneous escape routing and layer assignment for dense PCBs","display_name":"Simultaneous escape routing and layer assignment for dense PCBs","publication_year":2005,"publication_date":"2005-02-22","ids":{"openalex":"https://openalex.org/W1505317030","doi":"https://doi.org/10.1109/iccad.2004.1382689","mag":"1505317030"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2004.1382689","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2004.1382689","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/A5058119792","display_name":"Mustafa \u00d6zdal","orcid":"https://orcid.org/0000-0002-0286-2128"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.M. Ozdal","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA","institution_ids":["https://openalex.org/I183874917"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053378706","display_name":"Martin D. F. Wong","orcid":"https://orcid.org/0000-0001-8274-9688"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP","US"],"is_corresponding":false,"raw_author_name":"M.D.F. Wong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Dept. Commun. & Comput. Eng, Kyoto Univ., Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. Commun. & Comput. Eng, Kyoto Univ., Japan","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.8615,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.95223892,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"822","last_page":"829"},"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.9973000288009644,"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/T11269","display_name":"Algorithms and Data Compression","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.7239983081817627},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7062956690788269},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6754788756370544},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6233795285224915},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5924082398414612},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5721854567527771},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.543830156326294},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4797959625720978},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43884626030921936},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4228404462337494},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41442063450813293},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3450479507446289},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.24145567417144775}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.7239983081817627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7062956690788269},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6754788756370544},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6233795285224915},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5924082398414612},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5721854567527771},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.543830156326294},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4797959625720978},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43884626030921936},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4228404462337494},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41442063450813293},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3450479507446289},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.24145567417144775},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iccad.2004.1382689","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2004.1382689","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.87.5282","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.5282","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iccad.com/data2/iccad/iccad_04acceptedpapers.nsf/9cfb1ebaaf59043587256a6a00031f78/19baee44e7ddc1b587256eb70059c482/$FILE/10C01.PDF","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.6100000143051147,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2048214598","https://openalex.org/W2053651631","https://openalex.org/W2103741020","https://openalex.org/W2112942252","https://openalex.org/W2123118545","https://openalex.org/W2124983287","https://openalex.org/W2160474882","https://openalex.org/W2752885492","https://openalex.org/W4237638069","https://openalex.org/W4243214555","https://openalex.org/W6678226256"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2108305519","https://openalex.org/W3127002380","https://openalex.org/W2555559350","https://openalex.org/W2369989480","https://openalex.org/W2124642421","https://openalex.org/W2607223747","https://openalex.org/W2081964190","https://openalex.org/W2361465121","https://openalex.org/W2030786877"],"abstract_inverted_index":{"As":[0],"die":[1],"sizes":[2],"are":[3,8],"shrinking,":[4],"and":[5,16,28,103,159],"circuit":[6],"complexities":[7],"increasing,":[9],"the":[10,33,56,68,78,83,92,121,150,162,166,170],"PCB":[11],"routing":[12,20,37,49,54,70,124],"problem":[13,45,93],"becomes":[14],"more":[15,17],"challenging.":[18],"Traditional":[19],"algorithms":[21,106,147,174],"can":[22],"not":[23],"handle":[24],"these":[25,146,173],"challenges":[26],"effectively,":[27],"many":[29],"high-end":[30],"designs":[31],"in":[32,55,82],"industry":[34],"require":[35],"manual":[36],"efforts.":[38],"In":[39,59],"this":[40],"paper,":[41],"we":[42,61,90,144],"propose":[43,62,104],"a":[44,95,132],"decomposition":[46],"that":[47,77,116,135],"distinguishes":[48],"within":[50],"dense":[51],"components":[52,74],"from":[53],"intermediate":[57,84],"area.":[58],"particular,":[60],"an":[63,112],"effective":[64],"methodology":[65],"to":[66,119,148,156],"find":[67,120],"escape":[69],"solution":[71,125],"for":[72,107,140],"multiple":[73],"simultaneously":[75],"such":[76],"number":[79],"of":[80,153,172],"crossings":[81],"area":[85],"is":[86,111,117,131],"minimized.":[87],"For":[88],"this,":[89],"model":[91],"as":[94],"longest":[96],"path":[97],"with":[98],"forbidden":[99],"pairs":[100],"(LPFP)":[101],"problem,":[102],"two":[105],"it.":[108],"The":[109,129],"first":[110],"exact":[113],"polynomial-time":[114],"algorithm":[115,134],"guaranteed":[118],"maximal":[122,151],"planar":[123,154],"on":[126,177],"one":[127],"layer.":[128],"second":[130],"randomized":[133],"has":[136],"good":[137],"scalability":[138],"characteristics":[139],"large":[141],"circuits.":[142,179],"Then":[143],"use":[145],"assign":[149],"subset":[152],"nets":[155,164],"each":[157],"layer,":[158],"then":[160],"distribute":[161],"remaining":[163],"at":[165],"end.":[167],"We":[168],"demonstrate":[169],"effectiveness":[171],"through":[175],"experiments":[176],"industrial":[178]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}