{"id":"https://openalex.org/W1993763736","doi":"https://doi.org/10.1109/tcad.2013.2279516","title":"Algorithms for Maze Routing With Exact Matching Constraints","display_name":"Algorithms for Maze Routing With Exact Matching Constraints","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1993763736","doi":"https://doi.org/10.1109/tcad.2013.2279516","mag":"1993763736"},"language":"en","primary_location":{"id":"doi:10.1109/tcad.2013.2279516","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcad.2013.2279516","pdf_url":null,"source":{"id":"https://openalex.org/S100835903","display_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issn_l":"0278-0070","issn":["0278-0070","1937-4151"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","raw_type":"journal-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/A5103071783","display_name":"Muhammet Mustafa \u00d6zdal","orcid":"https://orcid.org/0000-0002-6239-9622"},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Muhammet Mustafa Ozdal","raw_affiliation_strings":["Intel Corporation, Hillsboro, OR, USA","Intel Corporation, , Hillsboro, OR, USA"],"affiliations":[{"raw_affiliation_string":"Intel Corporation, Hillsboro, OR, USA","institution_ids":["https://openalex.org/I1343180700"]},{"raw_affiliation_string":"Intel Corporation, , Hillsboro, OR, USA","institution_ids":["https://openalex.org/I1343180700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087624505","display_name":"Renato Hentschke","orcid":null},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Renato Fernandes Hentschke","raw_affiliation_strings":["Intel Corporation, Hillsboro, OR, USA","Intel Corporation, , Hillsboro, OR, USA"],"affiliations":[{"raw_affiliation_string":"Intel Corporation, Hillsboro, OR, USA","institution_ids":["https://openalex.org/I1343180700"]},{"raw_affiliation_string":"Intel Corporation, , Hillsboro, OR, USA","institution_ids":["https://openalex.org/I1343180700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103071783"],"corresponding_institution_ids":["https://openalex.org/I1343180700"],"apc_list":null,"apc_paid":null,"fwci":0.8373,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.76367628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"33","issue":"1","first_page":"101","last_page":"112"},"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.9997000098228455,"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/T11338","display_name":"Advancements in Photolithography Techniques","score":0.9988999962806702,"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/routing","display_name":"Routing (electronic design automation)","score":0.7376164793968201},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6665120124816895},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.654511570930481},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.556048572063446},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5401327610015869},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5058317184448242},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4993116855621338},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.48126858472824097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4692540168762207},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45870909094810486},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4224443733692169},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.41901981830596924},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.41800862550735474},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4177051782608032},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2532138228416443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21017426252365112},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08439525961875916}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.7376164793968201},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6665120124816895},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.654511570930481},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.556048572063446},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5401327610015869},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5058317184448242},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4993116855621338},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.48126858472824097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4692540168762207},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45870909094810486},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4224443733692169},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.41901981830596924},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.41800862550735474},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4177051782608032},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2532138228416443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21017426252365112},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08439525961875916},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcad.2013.2279516","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcad.2013.2279516","pdf_url":null,"source":{"id":"https://openalex.org/S100835903","display_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issn_l":"0278-0070","issn":["0278-0070","1937-4151"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1550639219","https://openalex.org/W1997134428","https://openalex.org/W2000200644","https://openalex.org/W2006236147","https://openalex.org/W2028326940","https://openalex.org/W2045697850","https://openalex.org/W2106928112","https://openalex.org/W2146519106","https://openalex.org/W2147555712","https://openalex.org/W2148328797","https://openalex.org/W2151933980","https://openalex.org/W2165465743","https://openalex.org/W2165849611","https://openalex.org/W3148657002","https://openalex.org/W4245484162","https://openalex.org/W6657784182"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2108305519","https://openalex.org/W1997091564","https://openalex.org/W2555559350","https://openalex.org/W3127002380","https://openalex.org/W2369989480","https://openalex.org/W2124642421","https://openalex.org/W2607223747","https://openalex.org/W2361465121","https://openalex.org/W2030786877"],"abstract_inverted_index":{"Exact":[0],"route":[1],"matching":[2,31],"is":[3],"an":[4,86],"important":[5],"constraint":[6],"for":[7,33,49],"analog":[8],"and":[9],"mixed":[10],"signal":[11],"designs":[12],"with":[13],"nonuniform":[14],"metal":[15],"stacks.":[16],"In":[17],"this":[18],"paper,":[19],"we":[20,84],"propose":[21,38,85],"a":[22,39,65],"constrained-path-based":[23],"maze":[24,46],"routing":[25,47,57,96],"algorithm":[26,48,109],"that":[27,42,106],"can":[28],"handle":[29],"exact":[30],"constraints":[32],"multiple":[34],"nets.":[35],"We":[36],"also":[37],"scalable":[40],"framework":[41],"utilizes":[43],"the":[44,55,70,91,94,99,107,119],"proposed":[45,59,108],"realistic":[50],"problem":[51],"sizes.":[52],"Compared":[53],"to":[54,76,79,89,111,118],"pattern":[56],"algorithms":[58,63],"recently":[60],",":[61],"our":[62],"allow":[64],"more":[66],"thorough":[67],"exploration":[68],"of":[69,93],"solution":[71],"space":[72],"by":[73],"allowing":[74],"bends":[75],"be":[77],"inserted":[78],"avoid":[80],"congested":[81],"regions.":[82],"Furthermore,":[83],"ILP-based":[87],"model":[88],"explore":[90],"impact":[92],"initial":[95],"topologies":[97],"on":[98],"final":[100],"solutions.":[101],"Our":[102],"experimental":[103],"study":[104],"demonstrates":[105],"leads":[110],"significant":[112],"reductions":[113],"in":[114],"congestion":[115],"costs":[116],"compared":[117],"previous":[120],"algorithm.":[121]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}